/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/sum_25x0-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 20:28:45,519 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 20:28:45,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 20:28:45,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 20:28:45,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 20:28:45,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 20:28:45,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 20:28:45,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 20:28:45,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 20:28:45,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 20:28:45,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 20:28:45,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 20:28:45,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 20:28:45,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 20:28:45,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 20:28:45,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 20:28:45,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 20:28:45,581 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 20:28:45,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 20:28:45,610 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 20:28:45,615 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 20:28:45,618 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 20:28:45,620 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 20:28:45,621 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 20:28:45,625 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 20:28:45,625 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 20:28:45,625 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 20:28:45,626 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 20:28:45,627 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 20:28:45,628 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 20:28:45,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 20:28:45,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 20:28:45,631 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 20:28:45,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 20:28:45,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 20:28:45,634 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 20:28:45,635 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 20:28:45,635 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 20:28:45,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 20:28:45,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 20:28:45,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 20:28:45,639 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-23 20:28:45,667 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 20:28:45,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 20:28:45,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 20:28:45,675 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 20:28:45,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 20:28:45,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 20:28:45,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 20:28:45,679 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 20:28:45,680 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 20:28:45,680 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 20:28:45,680 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 20:28:45,681 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 20:28:45,681 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 20:28:45,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 20:28:45,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 20:28:45,683 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-23 20:28:45,683 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 20:28:45,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 20:28:45,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 20:28:45,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 20:28:45,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-23 20:28:45,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 20:28:45,685 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-10-23 20:28:46,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 20:28:46,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 20:28:46,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 20:28:46,104 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 20:28:46,105 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 20:28:46,106 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_25x0-1.c [2020-10-23 20:28:46,187 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f984e803/dfaa2792117c4caeb5db1aba33659cb0/FLAG4e19e365a [2020-10-23 20:28:46,826 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 20:28:46,828 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_25x0-1.c [2020-10-23 20:28:46,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f984e803/dfaa2792117c4caeb5db1aba33659cb0/FLAG4e19e365a [2020-10-23 20:28:47,186 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f984e803/dfaa2792117c4caeb5db1aba33659cb0 [2020-10-23 20:28:47,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 20:28:47,201 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 20:28:47,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 20:28:47,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 20:28:47,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 20:28:47,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:28:47" (1/1) ... [2020-10-23 20:28:47,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31231773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:47, skipping insertion in model container [2020-10-23 20:28:47,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:28:47" (1/1) ... [2020-10-23 20:28:47,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 20:28:47,244 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 20:28:47,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:28:47,468 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 20:28:47,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:28:47,500 INFO L208 MainTranslator]: Completed translation [2020-10-23 20:28:47,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:47 WrapperNode [2020-10-23 20:28:47,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 20:28:47,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 20:28:47,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 20:28:47,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 20:28:47,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:47" (1/1) ... [2020-10-23 20:28:47,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:47" (1/1) ... [2020-10-23 20:28:47,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:47" (1/1) ... [2020-10-23 20:28:47,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:47" (1/1) ... [2020-10-23 20:28:47,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:47" (1/1) ... [2020-10-23 20:28:47,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:47" (1/1) ... [2020-10-23 20:28:47,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:47" (1/1) ... [2020-10-23 20:28:47,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 20:28:47,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 20:28:47,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 20:28:47,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 20:28:47,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 20:28:47,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 20:28:47,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 20:28:47,664 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 20:28:47,665 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-10-23 20:28:47,665 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 20:28:47,665 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 20:28:47,665 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 20:28:47,665 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 20:28:47,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 20:28:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-10-23 20:28:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 20:28:47,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 20:28:47,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 20:28:47,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 20:28:47,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 20:28:47,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 20:28:47,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 20:28:48,127 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 20:28:48,128 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-23 20:28:48,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:28:48 BoogieIcfgContainer [2020-10-23 20:28:48,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 20:28:48,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 20:28:48,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 20:28:48,143 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 20:28:48,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:28:47" (1/3) ... [2020-10-23 20:28:48,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db75a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:28:48, skipping insertion in model container [2020-10-23 20:28:48,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:47" (2/3) ... [2020-10-23 20:28:48,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db75a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:28:48, skipping insertion in model container [2020-10-23 20:28:48,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:28:48" (3/3) ... [2020-10-23 20:28:48,147 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_25x0-1.c [2020-10-23 20:28:48,160 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-23 20:28:48,165 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 20:28:48,180 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 20:28:48,205 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 20:28:48,206 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 20:28:48,206 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-10-23 20:28:48,206 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 20:28:48,206 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 20:28:48,206 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 20:28:48,206 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 20:28:48,206 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 20:28:48,222 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-10-23 20:28:48,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-23 20:28:48,233 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:48,234 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:48,234 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:48,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:48,241 INFO L82 PathProgramCache]: Analyzing trace with hash -342472451, now seen corresponding path program 1 times [2020-10-23 20:28:48,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:48,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1671611731] [2020-10-23 20:28:48,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:48,335 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:28:48,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1671611731] [2020-10-23 20:28:48,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:48,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 20:28:48,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888184081] [2020-10-23 20:28:48,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 20:28:48,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:48,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 20:28:48,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-23 20:28:48,633 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 6 states. [2020-10-23 20:28:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:49,075 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-10-23 20:28:49,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 20:28:49,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-10-23 20:28:49,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:49,089 INFO L225 Difference]: With dead ends: 52 [2020-10-23 20:28:49,089 INFO L226 Difference]: Without dead ends: 34 [2020-10-23 20:28:49,096 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:28:49,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-23 20:28:49,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-10-23 20:28:49,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-23 20:28:49,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2020-10-23 20:28:49,182 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 27 [2020-10-23 20:28:49,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:49,184 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2020-10-23 20:28:49,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 20:28:49,184 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-10-23 20:28:49,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-23 20:28:49,188 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:49,190 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:49,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 20:28:49,190 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:49,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:49,192 INFO L82 PathProgramCache]: Analyzing trace with hash 653425116, now seen corresponding path program 1 times [2020-10-23 20:28:49,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:49,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [264662425] [2020-10-23 20:28:49,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:49,207 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:49,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:49,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:49,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:49,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-23 20:28:49,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [264662425] [2020-10-23 20:28:49,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:49,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 20:28:49,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91683090] [2020-10-23 20:28:49,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 20:28:49,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:49,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 20:28:49,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-23 20:28:49,451 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 7 states. [2020-10-23 20:28:49,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:49,774 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-10-23 20:28:49,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-23 20:28:49,775 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-10-23 20:28:49,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:49,777 INFO L225 Difference]: With dead ends: 46 [2020-10-23 20:28:49,777 INFO L226 Difference]: Without dead ends: 39 [2020-10-23 20:28:49,779 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:28:49,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-23 20:28:49,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-10-23 20:28:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-23 20:28:49,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-10-23 20:28:49,794 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2020-10-23 20:28:49,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:49,795 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-10-23 20:28:49,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 20:28:49,795 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-10-23 20:28:49,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-23 20:28:49,797 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:49,797 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:49,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 20:28:49,797 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:49,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:49,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1221623283, now seen corresponding path program 2 times [2020-10-23 20:28:49,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:49,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [828633458] [2020-10-23 20:28:49,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:49,802 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:49,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:49,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:49,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:49,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-23 20:28:50,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [828633458] [2020-10-23 20:28:50,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:50,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 20:28:50,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540356412] [2020-10-23 20:28:50,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 20:28:50,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:50,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 20:28:50,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-23 20:28:50,022 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 8 states. [2020-10-23 20:28:50,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:50,301 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-10-23 20:28:50,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 20:28:50,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-10-23 20:28:50,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:50,304 INFO L225 Difference]: With dead ends: 51 [2020-10-23 20:28:50,304 INFO L226 Difference]: Without dead ends: 44 [2020-10-23 20:28:50,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-23 20:28:50,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-10-23 20:28:50,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-10-23 20:28:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-23 20:28:50,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2020-10-23 20:28:50,319 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 45 [2020-10-23 20:28:50,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:50,319 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2020-10-23 20:28:50,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 20:28:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-10-23 20:28:50,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-10-23 20:28:50,322 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:50,322 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:50,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 20:28:50,322 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:50,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:50,323 INFO L82 PathProgramCache]: Analyzing trace with hash 942298982, now seen corresponding path program 3 times [2020-10-23 20:28:50,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:50,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [934483124] [2020-10-23 20:28:50,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:50,327 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-23 20:28:50,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [934483124] [2020-10-23 20:28:50,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:50,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 20:28:50,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90125973] [2020-10-23 20:28:50,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 20:28:50,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:50,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 20:28:50,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:28:50,557 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 9 states. [2020-10-23 20:28:50,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:50,959 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-10-23 20:28:50,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 20:28:50,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-10-23 20:28:50,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:50,962 INFO L225 Difference]: With dead ends: 56 [2020-10-23 20:28:50,962 INFO L226 Difference]: Without dead ends: 49 [2020-10-23 20:28:50,963 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-10-23 20:28:50,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-10-23 20:28:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-10-23 20:28:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-10-23 20:28:50,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2020-10-23 20:28:50,991 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 54 [2020-10-23 20:28:50,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:50,991 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2020-10-23 20:28:50,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 20:28:50,991 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2020-10-23 20:28:50,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-23 20:28:50,997 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:50,997 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:50,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 20:28:50,998 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:50,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:50,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1161295337, now seen corresponding path program 4 times [2020-10-23 20:28:51,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:51,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1912752862] [2020-10-23 20:28:51,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:51,003 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-23 20:28:51,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1912752862] [2020-10-23 20:28:51,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:51,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 20:28:51,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241051753] [2020-10-23 20:28:51,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 20:28:51,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:51,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 20:28:51,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-23 20:28:51,216 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 10 states. [2020-10-23 20:28:51,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:51,803 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-10-23 20:28:51,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-23 20:28:51,809 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-10-23 20:28:51,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:51,811 INFO L225 Difference]: With dead ends: 61 [2020-10-23 20:28:51,811 INFO L226 Difference]: Without dead ends: 54 [2020-10-23 20:28:51,812 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-10-23 20:28:51,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-10-23 20:28:51,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-10-23 20:28:51,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-23 20:28:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-10-23 20:28:51,826 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 63 [2020-10-23 20:28:51,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:51,827 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-10-23 20:28:51,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 20:28:51,827 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-10-23 20:28:51,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-23 20:28:51,829 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:51,829 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:51,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 20:28:51,829 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:51,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:51,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2109333008, now seen corresponding path program 5 times [2020-10-23 20:28:51,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:51,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [166953957] [2020-10-23 20:28:51,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:51,834 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-23 20:28:52,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [166953957] [2020-10-23 20:28:52,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:52,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-23 20:28:52,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621618213] [2020-10-23 20:28:52,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 20:28:52,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:52,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 20:28:52,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:28:52,085 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 11 states. [2020-10-23 20:28:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:52,614 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-10-23 20:28:52,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-23 20:28:52,615 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-10-23 20:28:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:52,616 INFO L225 Difference]: With dead ends: 66 [2020-10-23 20:28:52,616 INFO L226 Difference]: Without dead ends: 59 [2020-10-23 20:28:52,617 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-10-23 20:28:52,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-23 20:28:52,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-23 20:28:52,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-23 20:28:52,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-10-23 20:28:52,636 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 72 [2020-10-23 20:28:52,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:52,639 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-10-23 20:28:52,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 20:28:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-10-23 20:28:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-23 20:28:52,642 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:52,642 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:52,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 20:28:52,644 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:52,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:52,645 INFO L82 PathProgramCache]: Analyzing trace with hash 639783135, now seen corresponding path program 6 times [2020-10-23 20:28:52,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:52,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [689080967] [2020-10-23 20:28:52,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:52,650 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,008 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-23 20:28:53,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [689080967] [2020-10-23 20:28:53,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:53,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 20:28:53,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532562902] [2020-10-23 20:28:53,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 20:28:53,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:53,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 20:28:53,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-23 20:28:53,012 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 12 states. [2020-10-23 20:28:53,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:53,599 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-10-23 20:28:53,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 20:28:53,600 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-10-23 20:28:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:53,603 INFO L225 Difference]: With dead ends: 71 [2020-10-23 20:28:53,603 INFO L226 Difference]: Without dead ends: 64 [2020-10-23 20:28:53,604 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-10-23 20:28:53,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-23 20:28:53,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-10-23 20:28:53,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-23 20:28:53,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2020-10-23 20:28:53,620 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 81 [2020-10-23 20:28:53,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:53,620 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2020-10-23 20:28:53,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 20:28:53,621 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2020-10-23 20:28:53,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-10-23 20:28:53,622 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:53,622 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:53,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 20:28:53,623 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:53,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:53,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1631598970, now seen corresponding path program 7 times [2020-10-23 20:28:53,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:53,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1911688484] [2020-10-23 20:28:53,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:53,632 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,120 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-23 20:28:54,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1911688484] [2020-10-23 20:28:54,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:54,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-23 20:28:54,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603900175] [2020-10-23 20:28:54,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-23 20:28:54,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:54,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-23 20:28:54,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-10-23 20:28:54,124 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 13 states. [2020-10-23 20:28:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:54,746 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-10-23 20:28:54,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 20:28:54,747 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-10-23 20:28:54,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:54,751 INFO L225 Difference]: With dead ends: 76 [2020-10-23 20:28:54,751 INFO L226 Difference]: Without dead ends: 69 [2020-10-23 20:28:54,752 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-10-23 20:28:54,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-10-23 20:28:54,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-10-23 20:28:54,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-23 20:28:54,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-10-23 20:28:54,782 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 90 [2020-10-23 20:28:54,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:54,783 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-10-23 20:28:54,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-23 20:28:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-10-23 20:28:54,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-10-23 20:28:54,787 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:54,787 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:54,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-23 20:28:54,788 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:54,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:54,788 INFO L82 PathProgramCache]: Analyzing trace with hash -440062251, now seen corresponding path program 8 times [2020-10-23 20:28:54,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:54,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [299713678] [2020-10-23 20:28:54,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:54,796 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:55,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:55,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:55,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:55,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:55,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:55,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:55,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:55,250 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-23 20:28:55,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [299713678] [2020-10-23 20:28:55,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:55,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-23 20:28:55,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155650065] [2020-10-23 20:28:55,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-23 20:28:55,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:55,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-23 20:28:55,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-10-23 20:28:55,258 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 14 states. [2020-10-23 20:28:55,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:55,923 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-10-23 20:28:55,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-23 20:28:55,924 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-10-23 20:28:55,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:55,925 INFO L225 Difference]: With dead ends: 81 [2020-10-23 20:28:55,926 INFO L226 Difference]: Without dead ends: 74 [2020-10-23 20:28:55,927 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-10-23 20:28:55,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-23 20:28:55,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-23 20:28:55,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-23 20:28:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2020-10-23 20:28:55,957 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 99 [2020-10-23 20:28:55,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:55,958 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2020-10-23 20:28:55,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-23 20:28:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2020-10-23 20:28:55,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-10-23 20:28:55,960 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:55,960 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:55,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 20:28:55,960 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:55,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:55,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1832058372, now seen corresponding path program 9 times [2020-10-23 20:28:55,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:55,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1275538770] [2020-10-23 20:28:55,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:55,970 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,488 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-23 20:28:56,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1275538770] [2020-10-23 20:28:56,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:56,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-23 20:28:56,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704164929] [2020-10-23 20:28:56,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-23 20:28:56,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:56,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-23 20:28:56,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-23 20:28:56,490 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 15 states. [2020-10-23 20:28:57,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:57,176 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-10-23 20:28:57,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 20:28:57,177 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-10-23 20:28:57,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:57,179 INFO L225 Difference]: With dead ends: 86 [2020-10-23 20:28:57,179 INFO L226 Difference]: Without dead ends: 79 [2020-10-23 20:28:57,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-10-23 20:28:57,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-23 20:28:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-23 20:28:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-23 20:28:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2020-10-23 20:28:57,206 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 108 [2020-10-23 20:28:57,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:57,206 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2020-10-23 20:28:57,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-23 20:28:57,206 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2020-10-23 20:28:57,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-10-23 20:28:57,207 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:57,208 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:57,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 20:28:57,208 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:57,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:57,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1858719797, now seen corresponding path program 10 times [2020-10-23 20:28:57,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:57,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [726346774] [2020-10-23 20:28:57,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:57,215 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:57,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:57,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:57,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:57,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:57,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:57,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:57,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:57,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:57,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:57,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:57,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:57,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-23 20:28:57,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [726346774] [2020-10-23 20:28:57,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:57,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-10-23 20:28:57,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858954395] [2020-10-23 20:28:57,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-23 20:28:57,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:57,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-23 20:28:57,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-10-23 20:28:57,746 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 16 states. [2020-10-23 20:28:58,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:58,483 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-10-23 20:28:58,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-23 20:28:58,484 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2020-10-23 20:28:58,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:58,485 INFO L225 Difference]: With dead ends: 91 [2020-10-23 20:28:58,485 INFO L226 Difference]: Without dead ends: 84 [2020-10-23 20:28:58,487 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=268, Invalid=544, Unknown=0, NotChecked=0, Total=812 [2020-10-23 20:28:58,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-23 20:28:58,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-10-23 20:28:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-23 20:28:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2020-10-23 20:28:58,502 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 117 [2020-10-23 20:28:58,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:58,503 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2020-10-23 20:28:58,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-23 20:28:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2020-10-23 20:28:58,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-10-23 20:28:58,505 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:58,505 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:58,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-23 20:28:58,505 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:58,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:58,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1671901298, now seen corresponding path program 11 times [2020-10-23 20:28:58,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:58,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1863879370] [2020-10-23 20:28:58,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:58,513 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:59,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-23 20:28:59,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1863879370] [2020-10-23 20:28:59,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:59,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-10-23 20:28:59,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990479584] [2020-10-23 20:28:59,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-23 20:28:59,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:59,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-23 20:28:59,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-10-23 20:28:59,093 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 17 states. [2020-10-23 20:28:59,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:59,933 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2020-10-23 20:28:59,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-23 20:28:59,934 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2020-10-23 20:28:59,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:59,936 INFO L225 Difference]: With dead ends: 96 [2020-10-23 20:28:59,936 INFO L226 Difference]: Without dead ends: 89 [2020-10-23 20:28:59,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2020-10-23 20:28:59,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-23 20:28:59,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-10-23 20:28:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-23 20:28:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2020-10-23 20:28:59,955 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 126 [2020-10-23 20:28:59,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:59,955 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2020-10-23 20:28:59,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-23 20:28:59,955 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2020-10-23 20:28:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-10-23 20:28:59,957 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:59,958 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:59,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-23 20:28:59,958 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:59,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:59,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1502940223, now seen corresponding path program 12 times [2020-10-23 20:28:59,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:59,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1430794052] [2020-10-23 20:28:59,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:59,967 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:29:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:29:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-23 20:29:00,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1430794052] [2020-10-23 20:29:00,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:29:00,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-10-23 20:29:00,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361692045] [2020-10-23 20:29:00,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-23 20:29:00,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:29:00,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-23 20:29:00,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-10-23 20:29:00,545 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 18 states. [2020-10-23 20:29:01,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:29:01,466 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2020-10-23 20:29:01,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-23 20:29:01,467 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2020-10-23 20:29:01,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:29:01,468 INFO L225 Difference]: With dead ends: 101 [2020-10-23 20:29:01,468 INFO L226 Difference]: Without dead ends: 94 [2020-10-23 20:29:01,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2020-10-23 20:29:01,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-10-23 20:29:01,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-10-23 20:29:01,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-23 20:29:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2020-10-23 20:29:01,491 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 135 [2020-10-23 20:29:01,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:29:01,492 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2020-10-23 20:29:01,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-23 20:29:01,492 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2020-10-23 20:29:01,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-10-23 20:29:01,495 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:29:01,496 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:29:01,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-23 20:29:01,496 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:29:01,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:29:01,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1695288856, now seen corresponding path program 13 times [2020-10-23 20:29:01,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:29:01,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1329314693] [2020-10-23 20:29:01,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:29:01,527 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:29:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:01,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:29:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:01,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:29:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:01,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:01,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:01,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:01,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:01,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:01,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:01,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-23 20:29:02,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1329314693] [2020-10-23 20:29:02,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:29:02,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-10-23 20:29:02,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447786233] [2020-10-23 20:29:02,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-23 20:29:02,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:29:02,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-23 20:29:02,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-10-23 20:29:02,325 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 19 states. [2020-10-23 20:29:03,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:29:03,304 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2020-10-23 20:29:03,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-23 20:29:03,305 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2020-10-23 20:29:03,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:29:03,307 INFO L225 Difference]: With dead ends: 106 [2020-10-23 20:29:03,307 INFO L226 Difference]: Without dead ends: 99 [2020-10-23 20:29:03,308 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-10-23 20:29:03,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-10-23 20:29:03,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2020-10-23 20:29:03,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-10-23 20:29:03,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2020-10-23 20:29:03,322 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 144 [2020-10-23 20:29:03,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:29:03,323 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2020-10-23 20:29:03,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-23 20:29:03,323 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2020-10-23 20:29:03,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-10-23 20:29:03,326 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:29:03,326 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:29:03,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-23 20:29:03,327 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:29:03,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:29:03,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1916345015, now seen corresponding path program 14 times [2020-10-23 20:29:03,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:29:03,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [85224865] [2020-10-23 20:29:03,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:29:03,333 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:29:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:29:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:29:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:04,127 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-23 20:29:04,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [85224865] [2020-10-23 20:29:04,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:29:04,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-10-23 20:29:04,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518576815] [2020-10-23 20:29:04,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-23 20:29:04,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:29:04,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-23 20:29:04,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-10-23 20:29:04,132 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 20 states. [2020-10-23 20:29:05,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:29:05,111 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2020-10-23 20:29:05,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-23 20:29:05,112 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 153 [2020-10-23 20:29:05,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:29:05,114 INFO L225 Difference]: With dead ends: 111 [2020-10-23 20:29:05,114 INFO L226 Difference]: Without dead ends: 104 [2020-10-23 20:29:05,115 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=450, Invalid=882, Unknown=0, NotChecked=0, Total=1332 [2020-10-23 20:29:05,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-23 20:29:05,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-10-23 20:29:05,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-23 20:29:05,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2020-10-23 20:29:05,129 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 153 [2020-10-23 20:29:05,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:29:05,130 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2020-10-23 20:29:05,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-23 20:29:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2020-10-23 20:29:05,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-10-23 20:29:05,131 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:29:05,131 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:29:05,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-23 20:29:05,132 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:29:05,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:29:05,132 INFO L82 PathProgramCache]: Analyzing trace with hash -540599902, now seen corresponding path program 15 times [2020-10-23 20:29:05,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:29:05,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2013107370] [2020-10-23 20:29:05,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:29:05,137 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:29:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:29:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:29:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:06,077 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-23 20:29:06,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2013107370] [2020-10-23 20:29:06,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:29:06,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-10-23 20:29:06,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466518521] [2020-10-23 20:29:06,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-23 20:29:06,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:29:06,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-23 20:29:06,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2020-10-23 20:29:06,079 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 21 states. [2020-10-23 20:29:07,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:29:07,087 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2020-10-23 20:29:07,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-23 20:29:07,088 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 162 [2020-10-23 20:29:07,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:29:07,089 INFO L225 Difference]: With dead ends: 116 [2020-10-23 20:29:07,089 INFO L226 Difference]: Without dead ends: 109 [2020-10-23 20:29:07,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=503, Invalid=979, Unknown=0, NotChecked=0, Total=1482 [2020-10-23 20:29:07,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-23 20:29:07,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-10-23 20:29:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-23 20:29:07,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2020-10-23 20:29:07,109 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 162 [2020-10-23 20:29:07,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:29:07,115 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2020-10-23 20:29:07,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-23 20:29:07,115 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2020-10-23 20:29:07,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-10-23 20:29:07,118 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:29:07,118 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:29:07,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-23 20:29:07,118 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:29:07,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:29:07,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1851147437, now seen corresponding path program 16 times [2020-10-23 20:29:07,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:29:07,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [613030883] [2020-10-23 20:29:07,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:29:07,125 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:29:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:29:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:29:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:08,130 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-23 20:29:08,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [613030883] [2020-10-23 20:29:08,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:29:08,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-10-23 20:29:08,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556407891] [2020-10-23 20:29:08,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-23 20:29:08,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:29:08,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-23 20:29:08,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2020-10-23 20:29:08,133 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 22 states. [2020-10-23 20:29:09,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:29:09,255 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2020-10-23 20:29:09,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-23 20:29:09,255 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 171 [2020-10-23 20:29:09,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:29:09,257 INFO L225 Difference]: With dead ends: 121 [2020-10-23 20:29:09,258 INFO L226 Difference]: Without dead ends: 114 [2020-10-23 20:29:09,260 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=559, Invalid=1081, Unknown=0, NotChecked=0, Total=1640 [2020-10-23 20:29:09,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-10-23 20:29:09,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-10-23 20:29:09,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-23 20:29:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2020-10-23 20:29:09,276 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 171 [2020-10-23 20:29:09,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:29:09,276 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2020-10-23 20:29:09,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-23 20:29:09,276 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2020-10-23 20:29:09,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-10-23 20:29:09,278 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:29:09,278 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:29:09,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-23 20:29:09,278 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:29:09,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:29:09,279 INFO L82 PathProgramCache]: Analyzing trace with hash -383495636, now seen corresponding path program 17 times [2020-10-23 20:29:09,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:29:09,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1762677843] [2020-10-23 20:29:09,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:29:09,284 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:29:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:09,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:29:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:09,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:29:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:09,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:09,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:09,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:09,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:09,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:09,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:09,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:09,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:09,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:09,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:09,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:09,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:09,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:09,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:09,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:09,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:10,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:10,235 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-23 20:29:10,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1762677843] [2020-10-23 20:29:10,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:29:10,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-10-23 20:29:10,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910806086] [2020-10-23 20:29:10,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-23 20:29:10,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:29:10,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-23 20:29:10,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2020-10-23 20:29:10,237 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 23 states. [2020-10-23 20:29:11,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:29:11,474 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2020-10-23 20:29:11,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-23 20:29:11,478 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 180 [2020-10-23 20:29:11,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:29:11,480 INFO L225 Difference]: With dead ends: 126 [2020-10-23 20:29:11,480 INFO L226 Difference]: Without dead ends: 119 [2020-10-23 20:29:11,481 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=618, Invalid=1188, Unknown=0, NotChecked=0, Total=1806 [2020-10-23 20:29:11,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-10-23 20:29:11,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2020-10-23 20:29:11,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-23 20:29:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2020-10-23 20:29:11,499 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 180 [2020-10-23 20:29:11,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:29:11,500 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2020-10-23 20:29:11,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-23 20:29:11,500 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2020-10-23 20:29:11,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-10-23 20:29:11,501 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:29:11,501 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:29:11,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-23 20:29:11,502 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:29:11,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:29:11,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1621618269, now seen corresponding path program 18 times [2020-10-23 20:29:11,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:29:11,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [875354737] [2020-10-23 20:29:11,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:29:11,509 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:29:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:11,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:29:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:11,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:29:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:11,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:11,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:11,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:11,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:11,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:11,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:11,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:12,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:12,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:12,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:12,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:12,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:12,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:12,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:12,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:12,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:12,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:12,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-23 20:29:12,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [875354737] [2020-10-23 20:29:12,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:29:12,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-10-23 20:29:12,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426153048] [2020-10-23 20:29:12,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-23 20:29:12,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:29:12,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-23 20:29:12,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2020-10-23 20:29:12,627 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 24 states. [2020-10-23 20:29:13,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:29:13,884 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2020-10-23 20:29:13,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-23 20:29:13,890 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 189 [2020-10-23 20:29:13,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:29:13,892 INFO L225 Difference]: With dead ends: 131 [2020-10-23 20:29:13,892 INFO L226 Difference]: Without dead ends: 124 [2020-10-23 20:29:13,893 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=680, Invalid=1300, Unknown=0, NotChecked=0, Total=1980 [2020-10-23 20:29:13,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-10-23 20:29:13,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2020-10-23 20:29:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-10-23 20:29:13,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2020-10-23 20:29:13,908 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 189 [2020-10-23 20:29:13,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:29:13,909 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2020-10-23 20:29:13,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-23 20:29:13,909 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2020-10-23 20:29:13,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-10-23 20:29:13,910 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:29:13,910 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:29:13,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-23 20:29:13,911 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:29:13,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:29:13,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1138628534, now seen corresponding path program 19 times [2020-10-23 20:29:13,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:29:13,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [903414816] [2020-10-23 20:29:13,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:29:13,916 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:29:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:14,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:29:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:14,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:29:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:14,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:14,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:14,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:14,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:14,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:14,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:14,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:14,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:14,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:14,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:14,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:14,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:14,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:14,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:14,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:14,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:14,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:14,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:14,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-23 20:29:15,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [903414816] [2020-10-23 20:29:15,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:29:15,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-10-23 20:29:15,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451701569] [2020-10-23 20:29:15,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-23 20:29:15,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:29:15,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-23 20:29:15,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=363, Unknown=0, NotChecked=0, Total=600 [2020-10-23 20:29:15,190 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 25 states. [2020-10-23 20:29:16,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:29:16,527 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2020-10-23 20:29:16,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-23 20:29:16,528 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 198 [2020-10-23 20:29:16,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:29:16,530 INFO L225 Difference]: With dead ends: 136 [2020-10-23 20:29:16,530 INFO L226 Difference]: Without dead ends: 129 [2020-10-23 20:29:16,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=745, Invalid=1417, Unknown=0, NotChecked=0, Total=2162 [2020-10-23 20:29:16,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-10-23 20:29:16,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2020-10-23 20:29:16,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-10-23 20:29:16,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2020-10-23 20:29:16,554 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 198 [2020-10-23 20:29:16,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:29:16,555 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2020-10-23 20:29:16,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-23 20:29:16,555 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2020-10-23 20:29:16,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-10-23 20:29:16,557 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:29:16,557 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:29:16,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-23 20:29:16,557 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:29:16,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:29:16,558 INFO L82 PathProgramCache]: Analyzing trace with hash -223075943, now seen corresponding path program 20 times [2020-10-23 20:29:16,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:29:16,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [701687774] [2020-10-23 20:29:16,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:29:16,565 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:29:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:16,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:29:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:16,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:29:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:16,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:16,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:16,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:16,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:17,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:17,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:17,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:17,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:17,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:17,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:17,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:17,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:17,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:17,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:17,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:17,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:17,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:17,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:17,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:17,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:17,891 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-10-23 20:29:17,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [701687774] [2020-10-23 20:29:17,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:29:17,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2020-10-23 20:29:17,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006373496] [2020-10-23 20:29:17,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-10-23 20:29:17,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:29:17,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-23 20:29:17,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2020-10-23 20:29:17,893 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 26 states. [2020-10-23 20:29:19,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:29:19,328 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2020-10-23 20:29:19,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-23 20:29:19,329 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 207 [2020-10-23 20:29:19,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:29:19,331 INFO L225 Difference]: With dead ends: 141 [2020-10-23 20:29:19,331 INFO L226 Difference]: Without dead ends: 134 [2020-10-23 20:29:19,333 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=813, Invalid=1539, Unknown=0, NotChecked=0, Total=2352 [2020-10-23 20:29:19,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-10-23 20:29:19,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2020-10-23 20:29:19,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-10-23 20:29:19,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2020-10-23 20:29:19,349 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 207 [2020-10-23 20:29:19,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:29:19,349 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2020-10-23 20:29:19,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-10-23 20:29:19,349 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2020-10-23 20:29:19,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-10-23 20:29:19,351 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:29:19,351 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:29:19,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-23 20:29:19,351 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:29:19,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:29:19,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1160852928, now seen corresponding path program 21 times [2020-10-23 20:29:19,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:29:19,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [36937720] [2020-10-23 20:29:19,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:29:19,357 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:29:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:19,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:29:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:19,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:29:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:19,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:19,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:19,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:19,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:19,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:19,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:19,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:19,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:19,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:19,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:20,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:20,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:20,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:20,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:20,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:20,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:20,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:20,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:20,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:20,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:20,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:20,646 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2020-10-23 20:29:20,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [36937720] [2020-10-23 20:29:20,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:29:20,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2020-10-23 20:29:20,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343298453] [2020-10-23 20:29:20,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-10-23 20:29:20,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:29:20,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-10-23 20:29:20,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=420, Unknown=0, NotChecked=0, Total=702 [2020-10-23 20:29:20,648 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 27 states. [2020-10-23 20:29:22,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:29:22,178 INFO L93 Difference]: Finished difference Result 146 states and 147 transitions. [2020-10-23 20:29:22,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-23 20:29:22,179 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 216 [2020-10-23 20:29:22,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:29:22,181 INFO L225 Difference]: With dead ends: 146 [2020-10-23 20:29:22,181 INFO L226 Difference]: Without dead ends: 139 [2020-10-23 20:29:22,182 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=884, Invalid=1666, Unknown=0, NotChecked=0, Total=2550 [2020-10-23 20:29:22,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-10-23 20:29:22,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-10-23 20:29:22,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-10-23 20:29:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2020-10-23 20:29:22,198 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 216 [2020-10-23 20:29:22,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:29:22,199 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2020-10-23 20:29:22,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-10-23 20:29:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2020-10-23 20:29:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-10-23 20:29:22,200 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:29:22,201 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:29:22,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-23 20:29:22,201 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:29:22,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:29:22,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1665133425, now seen corresponding path program 22 times [2020-10-23 20:29:22,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:29:22,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1803688029] [2020-10-23 20:29:22,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:29:22,205 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:29:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:22,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:29:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:22,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:29:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:22,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:22,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:22,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:22,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:22,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:22,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:22,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:22,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:22,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:22,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:22,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:22,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:22,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:23,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:23,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:23,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:23,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:23,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:23,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:23,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:23,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:23,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2020-10-23 20:29:23,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1803688029] [2020-10-23 20:29:23,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:29:23,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2020-10-23 20:29:23,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7997393] [2020-10-23 20:29:23,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-23 20:29:23,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:29:23,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-23 20:29:23,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=450, Unknown=0, NotChecked=0, Total=756 [2020-10-23 20:29:23,893 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 28 states. [2020-10-23 20:29:25,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:29:25,497 INFO L93 Difference]: Finished difference Result 151 states and 152 transitions. [2020-10-23 20:29:25,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-23 20:29:25,497 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 225 [2020-10-23 20:29:25,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:29:25,499 INFO L225 Difference]: With dead ends: 151 [2020-10-23 20:29:25,499 INFO L226 Difference]: Without dead ends: 144 [2020-10-23 20:29:25,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=958, Invalid=1798, Unknown=0, NotChecked=0, Total=2756 [2020-10-23 20:29:25,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-10-23 20:29:25,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2020-10-23 20:29:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-10-23 20:29:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2020-10-23 20:29:25,520 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 225 [2020-10-23 20:29:25,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:29:25,520 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2020-10-23 20:29:25,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-23 20:29:25,521 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2020-10-23 20:29:25,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-10-23 20:29:25,522 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:29:25,522 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:29:25,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-23 20:29:25,523 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:29:25,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:29:25,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1123076554, now seen corresponding path program 23 times [2020-10-23 20:29:25,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:29:25,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2044122552] [2020-10-23 20:29:25,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:29:25,528 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:29:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:25,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:29:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:25,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:29:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:25,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:25,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:25,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:25,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:25,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:26,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:26,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:26,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:26,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:26,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:26,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:26,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:26,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:26,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:26,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:26,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:26,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:26,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:26,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:26,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:26,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:26,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:26,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2020-10-23 20:29:27,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2044122552] [2020-10-23 20:29:27,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:29:27,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2020-10-23 20:29:27,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594413712] [2020-10-23 20:29:27,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-10-23 20:29:27,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:29:27,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-10-23 20:29:27,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=481, Unknown=0, NotChecked=0, Total=812 [2020-10-23 20:29:27,195 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 29 states. [2020-10-23 20:29:28,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:29:28,809 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2020-10-23 20:29:28,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-23 20:29:28,810 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 234 [2020-10-23 20:29:28,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:29:28,812 INFO L225 Difference]: With dead ends: 156 [2020-10-23 20:29:28,812 INFO L226 Difference]: Without dead ends: 149 [2020-10-23 20:29:28,813 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1035, Invalid=1935, Unknown=0, NotChecked=0, Total=2970 [2020-10-23 20:29:28,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-10-23 20:29:28,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2020-10-23 20:29:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-10-23 20:29:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2020-10-23 20:29:28,834 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 234 [2020-10-23 20:29:28,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:29:28,835 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2020-10-23 20:29:28,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-10-23 20:29:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2020-10-23 20:29:28,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2020-10-23 20:29:28,837 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:29:28,838 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:29:28,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-23 20:29:28,838 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:29:28,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:29:28,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1991346821, now seen corresponding path program 24 times [2020-10-23 20:29:28,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:29:28,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [147045157] [2020-10-23 20:29:28,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:29:28,843 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:29:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:28,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:29:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:28,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:29:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:29,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:29,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:29,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:29,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:29,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:29,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:29,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:29,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:29,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:29,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:29,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:29,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:29,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:29,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:29,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:29,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:30,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:30,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:30,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:30,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:30,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:30,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:30,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:30,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:30,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2020-10-23 20:29:30,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [147045157] [2020-10-23 20:29:30,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:29:30,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2020-10-23 20:29:30,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780293441] [2020-10-23 20:29:30,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-10-23 20:29:30,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:29:30,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-10-23 20:29:30,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=513, Unknown=0, NotChecked=0, Total=870 [2020-10-23 20:29:30,699 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 30 states. [2020-10-23 20:29:32,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:29:32,438 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2020-10-23 20:29:32,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-10-23 20:29:32,439 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 243 [2020-10-23 20:29:32,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:29:32,441 INFO L225 Difference]: With dead ends: 161 [2020-10-23 20:29:32,441 INFO L226 Difference]: Without dead ends: 154 [2020-10-23 20:29:32,444 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1115, Invalid=2077, Unknown=0, NotChecked=0, Total=3192 [2020-10-23 20:29:32,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-10-23 20:29:32,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2020-10-23 20:29:32,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-10-23 20:29:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2020-10-23 20:29:32,461 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 243 [2020-10-23 20:29:32,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:29:32,462 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2020-10-23 20:29:32,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-10-23 20:29:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2020-10-23 20:29:32,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2020-10-23 20:29:32,463 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:29:32,464 INFO L422 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:29:32,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-23 20:29:32,464 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:29:32,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:29:32,464 INFO L82 PathProgramCache]: Analyzing trace with hash 492729940, now seen corresponding path program 25 times [2020-10-23 20:29:32,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:29:32,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1183457204] [2020-10-23 20:29:32,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:29:32,469 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:29:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:32,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:29:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:32,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:29:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:32,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:33,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:33,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:33,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:33,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:33,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:33,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:33,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:34,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:34,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:34,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:34,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:34,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:34,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:34,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:34,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:35,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:35,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:35,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:35,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:35,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:35,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:35,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:36,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:36,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2020-10-23 20:29:37,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1183457204] [2020-10-23 20:29:37,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:29:37,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2020-10-23 20:29:37,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635034578] [2020-10-23 20:29:37,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 62 states [2020-10-23 20:29:37,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:29:37,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2020-10-23 20:29:37,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=727, Invalid=3055, Unknown=0, NotChecked=0, Total=3782 [2020-10-23 20:29:37,500 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 62 states. [2020-10-23 20:29:42,419 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-10-23 20:29:52,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:29:52,125 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2020-10-23 20:29:52,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2020-10-23 20:29:52,125 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 252 [2020-10-23 20:29:52,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:29:52,126 INFO L225 Difference]: With dead ends: 154 [2020-10-23 20:29:52,126 INFO L226 Difference]: Without dead ends: 0 [2020-10-23 20:29:52,133 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3032 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=4325, Invalid=17137, Unknown=0, NotChecked=0, Total=21462 [2020-10-23 20:29:52,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-23 20:29:52,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-23 20:29:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-23 20:29:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-23 20:29:52,134 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 252 [2020-10-23 20:29:52,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:29:52,134 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-23 20:29:52,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2020-10-23 20:29:52,134 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-23 20:29:52,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-23 20:29:52,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-23 20:29:52,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-23 20:29:52,292 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 122 [2020-10-23 20:29:52,401 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2020-10-23 20:29:52,522 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 119 [2020-10-23 20:29:54,965 WARN L193 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 208 DAG size of output: 164 [2020-10-23 20:29:56,610 WARN L193 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 181 DAG size of output: 134 [2020-10-23 20:29:58,101 WARN L193 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 181 DAG size of output: 134 [2020-10-23 20:29:59,744 WARN L193 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 187 DAG size of output: 140 [2020-10-23 20:30:01,341 WARN L193 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 187 DAG size of output: 140 [2020-10-23 20:30:01,540 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-23 20:30:01,540 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-23 20:30:01,540 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-23 20:30:01,541 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-23 20:30:01,541 INFO L277 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-10-23 20:30:01,541 INFO L277 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-10-23 20:30:01,541 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:30:01,541 INFO L277 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-10-23 20:30:01,541 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-23 20:30:01,541 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-10-23 20:30:01,541 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-23 20:30:01,542 INFO L277 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-10-23 20:30:01,542 INFO L277 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-10-23 20:30:01,542 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:30:01,542 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:30:01,542 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:30:01,542 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-23 20:30:01,542 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-23 20:30:01,543 INFO L270 CegarLoopResult]: At program point sumEXIT(lines 5 11) the Hoare annotation is: (and (let ((.cse2 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (<= |sum_#res| .cse2))) (or (and (<= (+ |sum_#in~m| 2) |sum_#res|) (<= |sum_#in~n| 2) .cse0 .cse1) (and (<= (+ |sum_#in~m| 24) |sum_#res|) .cse0 .cse1) (and (<= (+ |sum_#in~m| 16) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 16)) (and (<= (+ |sum_#in~m| 14) |sum_#res|) .cse0 (<= |sum_#in~n| 14) .cse1) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#res|) (<= |sum_#in~n| 9)) (and .cse0 (<= (+ |sum_#in~m| 23) |sum_#res|) .cse1 (<= |sum_#in~n| 23)) (and (<= (+ |sum_#in~m| 6) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6)) (and (<= (+ |sum_#in~m| 1) |sum_#res|) .cse0 (<= |sum_#in~n| 1) .cse1) (and .cse0 (<= |sum_#in~n| 8) .cse1 (<= (+ |sum_#in~m| 8) |sum_#res|)) (and (<= |sum_#in~n| 4) .cse0 .cse1 (<= (+ |sum_#in~m| 4) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 13) .cse1 (<= (+ |sum_#in~m| 13) |sum_#res|)) (and (<= (+ |sum_#in~m| 10) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 10)) (and (<= (+ |sum_#in~m| 11) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 11)) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= (+ |sum_#in~m| 12) |sum_#res|)) (and (<= |sum_#in~n| 19) .cse0 .cse1 (<= (+ |sum_#in~m| 19) |sum_#res|)) (and (<= |sum_#in~n| 17) .cse0 .cse1 (<= (+ |sum_#in~m| 17) |sum_#res|)) (and .cse0 (<= (+ |sum_#in~m| 7) |sum_#res|) (<= |sum_#in~n| 7) .cse1) (and (<= (+ |sum_#in~m| 18) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 18)) (and (<= (+ |sum_#in~m| 15) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 15)) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= (+ |sum_#in~m| 5) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 3) .cse1 (<= (+ |sum_#in~m| 3) |sum_#res|)) (and .cse0 .cse1 (<= (+ |sum_#in~m| 21) |sum_#res|) (<= |sum_#in~n| 21)) (and .cse0 .cse1 (<= |sum_#in~n| 20) (<= (+ |sum_#in~m| 20) |sum_#res|)) (and (<= |sum_#res| |sum_#in~m|) .cse0 (<= .cse2 |sum_#res|)) (and (<= |sum_#in~n| 22) .cse0 .cse1 (<= (+ |sum_#in~m| 22) |sum_#res|))))) (let ((.cse3 (= sum_~n |sum_#in~n|))) (or (and .cse3 (<= (+ |sum_#in~m| 25) |sum_#res|)) (and .cse3 (<= |sum_#in~n| 24))))) [2020-10-23 20:30:01,543 INFO L270 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (<= 1 sum_~n) (= sum_~m |sum_#in~m|)) [2020-10-23 20:30:01,543 INFO L270 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (let ((.cse0 (= sum_~n |sum_#in~n|)) (.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (<= |sum_#t~ret7| (+ |sum_#in~n| |sum_#in~m|)))) (or (and .cse0 (<= |sum_#in~n| 24) .cse1 .cse2 (<= (+ |sum_#in~m| 24) |sum_#t~ret7|)) (and .cse0 .cse1 (<= |sum_#in~n| 6) (<= (+ |sum_#in~m| 6) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 22) |sum_#t~ret7|) (<= |sum_#in~n| 22) .cse1 .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 16) |sum_#t~ret7|) (<= |sum_#in~n| 16) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 23) |sum_#t~ret7|) (<= |sum_#in~n| 23) .cse2) (and .cse0 (<= (+ |sum_#in~m| 3) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 3) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 11) .cse2 (<= (+ |sum_#in~m| 11) |sum_#t~ret7|)) (and .cse0 .cse1 (<= (+ |sum_#in~m| 10) |sum_#t~ret7|) .cse2 (<= |sum_#in~n| 10)) (and .cse0 (<= (+ |sum_#in~m| 4) |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse1 .cse2) (and .cse0 (<= (+ |sum_#in~m| 21) |sum_#t~ret7|) .cse1 .cse2 (<= |sum_#in~n| 21)) (and .cse0 .cse1 (<= |sum_#in~n| 20) (<= (+ |sum_#in~m| 20) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= (+ |sum_#in~m| 12) |sum_#t~ret7|) .cse2) (and .cse0 (<= |sum_#in~n| 19) .cse1 (<= (+ |sum_#in~m| 19) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 7) (<= (+ |sum_#in~m| 7) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 1) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 1) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 15) .cse2 (<= (+ |sum_#in~m| 15) |sum_#t~ret7|)) (and .cse0 (<= |sum_#in~n| 2) .cse1 .cse2 (<= (+ |sum_#in~m| 2) |sum_#t~ret7|)) (and .cse0 .cse1 (<= |sum_#in~n| 8) (<= (+ |sum_#in~m| 8) |sum_#t~ret7|) .cse2) (and .cse0 (<= |sum_#in~n| 17) .cse1 (<= (+ |sum_#in~m| 17) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 18) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 18) .cse2) (and .cse0 (<= |sum_#in~n| 5) .cse1 (<= (+ |sum_#in~m| 5) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#t~ret7|) (<= |sum_#in~n| 9) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 13) |sum_#t~ret7|) (<= |sum_#in~n| 13) .cse2) (and .cse0 (<= (+ |sum_#in~m| 25) |sum_#t~ret7|) .cse1 .cse2) (and .cse0 (<= (+ |sum_#in~m| 14) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 14) .cse2))) [2020-10-23 20:30:01,543 INFO L270 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|) (<= sum_~n 0)) [2020-10-23 20:30:01,544 INFO L270 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: (let ((.cse0 (= sum_~n |sum_#in~n|)) (.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (<= |sum_#t~ret7| (+ |sum_#in~n| |sum_#in~m|)))) (or (and .cse0 (<= |sum_#in~n| 24) .cse1 .cse2 (<= (+ |sum_#in~m| 24) |sum_#t~ret7|)) (and .cse0 .cse1 (<= |sum_#in~n| 6) (<= (+ |sum_#in~m| 6) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 22) |sum_#t~ret7|) (<= |sum_#in~n| 22) .cse1 .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 16) |sum_#t~ret7|) (<= |sum_#in~n| 16) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 23) |sum_#t~ret7|) (<= |sum_#in~n| 23) .cse2) (and .cse0 (<= (+ |sum_#in~m| 3) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 3) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 11) .cse2 (<= (+ |sum_#in~m| 11) |sum_#t~ret7|)) (and .cse0 .cse1 (<= (+ |sum_#in~m| 10) |sum_#t~ret7|) .cse2 (<= |sum_#in~n| 10)) (and .cse0 (<= (+ |sum_#in~m| 4) |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse1 .cse2) (and .cse0 (<= (+ |sum_#in~m| 21) |sum_#t~ret7|) .cse1 .cse2 (<= |sum_#in~n| 21)) (and .cse0 .cse1 (<= |sum_#in~n| 20) (<= (+ |sum_#in~m| 20) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= (+ |sum_#in~m| 12) |sum_#t~ret7|) .cse2) (and .cse0 (<= |sum_#in~n| 19) .cse1 (<= (+ |sum_#in~m| 19) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 7) (<= (+ |sum_#in~m| 7) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 1) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 1) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 15) .cse2 (<= (+ |sum_#in~m| 15) |sum_#t~ret7|)) (and .cse0 (<= |sum_#in~n| 2) .cse1 .cse2 (<= (+ |sum_#in~m| 2) |sum_#t~ret7|)) (and .cse0 .cse1 (<= |sum_#in~n| 8) (<= (+ |sum_#in~m| 8) |sum_#t~ret7|) .cse2) (and .cse0 (<= |sum_#in~n| 17) .cse1 (<= (+ |sum_#in~m| 17) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 18) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 18) .cse2) (and .cse0 (<= |sum_#in~n| 5) .cse1 (<= (+ |sum_#in~m| 5) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#t~ret7|) (<= |sum_#in~n| 9) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 13) |sum_#t~ret7|) (<= |sum_#in~n| 13) .cse2) (and .cse0 (<= (+ |sum_#in~m| 25) |sum_#t~ret7|) .cse1 .cse2) (and .cse0 (<= (+ |sum_#in~m| 14) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 14) .cse2))) [2020-10-23 20:30:01,544 INFO L270 CegarLoopResult]: At program point L6(lines 6 10) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|)) [2020-10-23 20:30:01,544 INFO L270 CegarLoopResult]: At program point L9-3(line 9) the Hoare annotation is: (and (let ((.cse27 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (<= |sum_#res| .cse27)) (.cse3 (<= |sum_#t~ret7| .cse27))) (or (let ((.cse0 (+ |sum_#in~m| 10))) (and (<= .cse0 |sum_#res|) .cse1 .cse2 (<= .cse0 |sum_#t~ret7|) .cse3 (<= |sum_#in~n| 10))) (let ((.cse4 (+ |sum_#in~m| 12))) (and .cse1 .cse2 (<= |sum_#in~n| 12) (<= .cse4 |sum_#t~ret7|) .cse3 (<= .cse4 |sum_#res|))) (let ((.cse5 (+ |sum_#in~m| 20))) (and .cse1 .cse2 (<= |sum_#in~n| 20) (<= .cse5 |sum_#t~ret7|) (<= .cse5 |sum_#res|) .cse3)) (let ((.cse6 (+ |sum_#in~m| 5))) (and (<= |sum_#in~n| 5) .cse1 .cse2 (<= .cse6 |sum_#t~ret7|) (<= .cse6 |sum_#res|) .cse3)) (let ((.cse7 (+ |sum_#in~m| 15))) (and (<= .cse7 |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 15) .cse3 (<= .cse7 |sum_#t~ret7|))) (let ((.cse8 (+ |sum_#in~m| 17))) (and (<= |sum_#in~n| 17) .cse1 .cse2 (<= .cse8 |sum_#t~ret7|) .cse3 (<= .cse8 |sum_#res|))) (let ((.cse9 (+ |sum_#in~m| 6))) (and (<= .cse9 |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 6) (<= .cse9 |sum_#t~ret7|) .cse3)) (let ((.cse10 (+ |sum_#in~m| 23))) (and .cse1 (<= .cse10 |sum_#res|) (<= .cse10 |sum_#t~ret7|) .cse2 (<= |sum_#in~n| 23) .cse3)) (let ((.cse11 (+ |sum_#in~m| 24))) (and (<= .cse11 |sum_#res|) .cse1 .cse2 .cse3 (<= .cse11 |sum_#t~ret7|))) (let ((.cse12 (+ |sum_#in~m| 14))) (and (<= .cse12 |sum_#t~ret7|) (<= .cse12 |sum_#res|) .cse1 (<= |sum_#in~n| 14) .cse2 .cse3)) (let ((.cse13 (+ |sum_#in~m| 13))) (and .cse1 (<= .cse13 |sum_#t~ret7|) (<= |sum_#in~n| 13) .cse2 (<= .cse13 |sum_#res|) .cse3)) (let ((.cse14 (+ |sum_#in~m| 11))) (and (<= .cse14 |sum_#res|) .cse1 .cse2 (<= |sum_#in~n| 11) .cse3 (<= .cse14 |sum_#t~ret7|))) (let ((.cse15 (+ |sum_#in~m| 3))) (and (<= .cse15 |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 3) .cse2 (<= .cse15 |sum_#res|) .cse3)) (let ((.cse16 (+ |sum_#in~m| 8))) (and .cse1 (<= |sum_#in~n| 8) .cse2 (<= .cse16 |sum_#res|) (<= .cse16 |sum_#t~ret7|) .cse3)) (let ((.cse17 (+ |sum_#in~m| 9))) (and .cse1 .cse2 (<= .cse17 |sum_#res|) (<= .cse17 |sum_#t~ret7|) (<= |sum_#in~n| 9) .cse3)) (let ((.cse18 (+ |sum_#in~m| 16))) (and (<= .cse18 |sum_#res|) .cse1 .cse2 (<= .cse18 |sum_#t~ret7|) (<= |sum_#in~n| 16) .cse3)) (let ((.cse19 (+ |sum_#in~m| 22))) (and (<= .cse19 |sum_#t~ret7|) (<= |sum_#in~n| 22) .cse1 .cse2 (<= .cse19 |sum_#res|) .cse3)) (let ((.cse20 (+ |sum_#in~m| 1))) (and (<= .cse20 |sum_#t~ret7|) (<= .cse20 |sum_#res|) .cse1 (<= |sum_#in~n| 1) .cse2 .cse3)) (let ((.cse21 (+ |sum_#in~m| 7))) (and .cse1 (<= .cse21 |sum_#res|) (<= |sum_#in~n| 7) .cse2 (<= .cse21 |sum_#t~ret7|) .cse3)) (let ((.cse22 (+ |sum_#in~m| 4))) (and (<= .cse22 |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse1 .cse2 (<= .cse22 |sum_#res|) .cse3)) (let ((.cse23 (+ |sum_#in~m| 2))) (and (<= .cse23 |sum_#res|) (<= |sum_#in~n| 2) .cse1 .cse2 .cse3 (<= .cse23 |sum_#t~ret7|))) (let ((.cse24 (+ |sum_#in~m| 18))) (and (<= .cse24 |sum_#res|) (<= .cse24 |sum_#t~ret7|) .cse1 .cse2 (<= |sum_#in~n| 18) .cse3)) (let ((.cse25 (+ |sum_#in~m| 19))) (and (<= |sum_#in~n| 19) .cse1 (<= .cse25 |sum_#t~ret7|) .cse2 (<= .cse25 |sum_#res|) .cse3)) (let ((.cse26 (+ |sum_#in~m| 21))) (and (<= .cse26 |sum_#t~ret7|) .cse1 .cse2 (<= .cse26 |sum_#res|) .cse3 (<= |sum_#in~n| 21)))))) (let ((.cse28 (= sum_~n |sum_#in~n|))) (or (and .cse28 (<= |sum_#in~n| 24)) (let ((.cse29 (+ |sum_#in~m| 25))) (and .cse28 (<= .cse29 |sum_#res|) (<= .cse29 |sum_#t~ret7|)))))) [2020-10-23 20:30:01,545 INFO L270 CegarLoopResult]: At program point L5(lines 5 11) the Hoare annotation is: (= sum_~n |sum_#in~n|) [2020-10-23 20:30:01,545 INFO L270 CegarLoopResult]: At program point sumFINAL(lines 5 11) the Hoare annotation is: (and (let ((.cse2 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (<= |sum_#res| .cse2))) (or (and (<= (+ |sum_#in~m| 2) |sum_#res|) (<= |sum_#in~n| 2) .cse0 .cse1) (and (<= (+ |sum_#in~m| 24) |sum_#res|) .cse0 .cse1) (and (<= (+ |sum_#in~m| 16) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 16)) (and (<= (+ |sum_#in~m| 14) |sum_#res|) .cse0 (<= |sum_#in~n| 14) .cse1) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#res|) (<= |sum_#in~n| 9)) (and .cse0 (<= (+ |sum_#in~m| 23) |sum_#res|) .cse1 (<= |sum_#in~n| 23)) (and (<= (+ |sum_#in~m| 6) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6)) (and (<= (+ |sum_#in~m| 1) |sum_#res|) .cse0 (<= |sum_#in~n| 1) .cse1) (and .cse0 (<= |sum_#in~n| 8) .cse1 (<= (+ |sum_#in~m| 8) |sum_#res|)) (and (<= |sum_#in~n| 4) .cse0 .cse1 (<= (+ |sum_#in~m| 4) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 13) .cse1 (<= (+ |sum_#in~m| 13) |sum_#res|)) (and (<= (+ |sum_#in~m| 10) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 10)) (and (<= (+ |sum_#in~m| 11) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 11)) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= (+ |sum_#in~m| 12) |sum_#res|)) (and (<= |sum_#in~n| 19) .cse0 .cse1 (<= (+ |sum_#in~m| 19) |sum_#res|)) (and (<= |sum_#in~n| 17) .cse0 .cse1 (<= (+ |sum_#in~m| 17) |sum_#res|)) (and .cse0 (<= (+ |sum_#in~m| 7) |sum_#res|) (<= |sum_#in~n| 7) .cse1) (and (<= (+ |sum_#in~m| 18) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 18)) (and (<= (+ |sum_#in~m| 15) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 15)) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= (+ |sum_#in~m| 5) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 3) .cse1 (<= (+ |sum_#in~m| 3) |sum_#res|)) (and .cse0 .cse1 (<= (+ |sum_#in~m| 21) |sum_#res|) (<= |sum_#in~n| 21)) (and .cse0 .cse1 (<= |sum_#in~n| 20) (<= (+ |sum_#in~m| 20) |sum_#res|)) (and (<= |sum_#res| |sum_#in~m|) .cse0 (<= .cse2 |sum_#res|)) (and (<= |sum_#in~n| 22) .cse0 .cse1 (<= (+ |sum_#in~m| 22) |sum_#res|))))) (let ((.cse3 (= sum_~n |sum_#in~n|))) (or (and .cse3 (<= (+ |sum_#in~m| 25) |sum_#res|)) (and .cse3 (<= |sum_#in~n| 24))))) [2020-10-23 20:30:01,545 INFO L277 CegarLoopResult]: At program point sumENTRY(lines 5 11) the Hoare annotation is: true [2020-10-23 20:30:01,545 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 13 20) the Hoare annotation is: true [2020-10-23 20:30:01,545 INFO L270 CegarLoopResult]: At program point mainEXIT(lines 13 20) the Hoare annotation is: (<= 25 main_~a~0) [2020-10-23 20:30:01,545 INFO L270 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: false [2020-10-23 20:30:01,545 INFO L270 CegarLoopResult]: At program point L17(lines 17 19) the Hoare annotation is: (and (<= main_~a~0 main_~result~0) (<= main_~a~0 25) (<= main_~result~0 main_~a~0) (<= 25 main_~a~0) (= main_~b~0 0)) [2020-10-23 20:30:01,545 INFO L270 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: false [2020-10-23 20:30:01,545 INFO L270 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= main_~a~0 25) (<= 25 main_~a~0) (= main_~b~0 0)) [2020-10-23 20:30:01,546 INFO L270 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (<= main_~a~0 25) (<= 25 main_~a~0)) [2020-10-23 20:30:01,546 INFO L270 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (and (<= |main_#t~ret8| main_~a~0) (<= main_~a~0 25) (<= main_~a~0 |main_#t~ret8|) (<= 25 main_~a~0) (= main_~b~0 0)) [2020-10-23 20:30:01,546 INFO L270 CegarLoopResult]: At program point L17-2(lines 13 20) the Hoare annotation is: (<= 25 main_~a~0) [2020-10-23 20:30:01,546 INFO L270 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (and (<= |main_#t~ret8| main_~a~0) (<= main_~a~0 25) (<= main_~a~0 |main_#t~ret8|) (<= 25 main_~a~0) (= main_~b~0 0)) [2020-10-23 20:30:01,546 INFO L270 CegarLoopResult]: At program point L16-3(line 16) the Hoare annotation is: (and (<= |main_#t~ret8| main_~a~0) (<= main_~a~0 main_~result~0) (<= main_~a~0 25) (<= main_~a~0 |main_#t~ret8|) (<= main_~result~0 main_~a~0) (<= 25 main_~a~0) (= main_~b~0 0)) [2020-10-23 20:30:01,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:30:01 BoogieIcfgContainer [2020-10-23 20:30:01,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 20:30:01,587 INFO L168 Benchmark]: Toolchain (without parser) took 74387.82 ms. Allocated memory was 153.1 MB in the beginning and 675.3 MB in the end (delta: 522.2 MB). Free memory was 136.3 MB in the beginning and 633.9 MB in the end (delta: -497.6 MB). Peak memory consumption was 409.4 MB. Max. memory is 8.0 GB. [2020-10-23 20:30:01,587 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 153.1 MB. Free memory was 127.4 MB in the beginning and 127.3 MB in the end (delta: 70.8 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 20:30:01,588 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.62 ms. Allocated memory is still 153.1 MB. Free memory was 135.5 MB in the beginning and 126.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-23 20:30:01,588 INFO L168 Benchmark]: Boogie Preprocessor took 32.97 ms. Allocated memory is still 153.1 MB. Free memory was 126.5 MB in the beginning and 125.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-23 20:30:01,589 INFO L168 Benchmark]: RCFGBuilder took 595.64 ms. Allocated memory is still 153.1 MB. Free memory was 125.3 MB in the beginning and 124.8 MB in the end (delta: 417.6 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-23 20:30:01,591 INFO L168 Benchmark]: TraceAbstraction took 73443.37 ms. Allocated memory was 153.1 MB in the beginning and 675.3 MB in the end (delta: 522.2 MB). Free memory was 124.4 MB in the beginning and 633.9 MB in the end (delta: -509.6 MB). Peak memory consumption was 398.5 MB. Max. memory is 8.0 GB. [2020-10-23 20:30:01,593 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 153.1 MB. Free memory was 127.4 MB in the beginning and 127.3 MB in the end (delta: 70.8 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 296.62 ms. Allocated memory is still 153.1 MB. Free memory was 135.5 MB in the beginning and 126.5 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 32.97 ms. Allocated memory is still 153.1 MB. Free memory was 126.5 MB in the beginning and 125.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 595.64 ms. Allocated memory is still 153.1 MB. Free memory was 125.3 MB in the beginning and 124.8 MB in the end (delta: 417.6 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 73443.37 ms. Allocated memory was 153.1 MB in the beginning and 675.3 MB in the end (delta: 522.2 MB). Free memory was 124.4 MB in the beginning and 633.9 MB in the end (delta: -509.6 MB). Peak memory consumption was 398.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for sum Derived contract for procedure sum: (((((((((((((((((((((((((((\old(m) + 2 <= \result && \old(n) <= 2) && m == \old(m)) && \result <= \old(n) + \old(m)) || ((\old(m) + 24 <= \result && m == \old(m)) && \result <= \old(n) + \old(m))) || (((\old(m) + 16 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 16)) || (((\old(m) + 14 <= \result && m == \old(m)) && \old(n) <= 14) && \result <= \old(n) + \old(m))) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(m) + 9 <= \result) && \old(n) <= 9)) || (((m == \old(m) && \old(m) + 23 <= \result) && \result <= \old(n) + \old(m)) && \old(n) <= 23)) || (((\old(m) + 6 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 6)) || (((\old(m) + 1 <= \result && m == \old(m)) && \old(n) <= 1) && \result <= \old(n) + \old(m))) || (((m == \old(m) && \old(n) <= 8) && \result <= \old(n) + \old(m)) && \old(m) + 8 <= \result)) || (((\old(n) <= 4 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 4 <= \result)) || (((m == \old(m) && \old(n) <= 13) && \result <= \old(n) + \old(m)) && \old(m) + 13 <= \result)) || (((\old(m) + 10 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 10)) || (((\old(m) + 11 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 11)) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(n) <= 12) && \old(m) + 12 <= \result)) || (((\old(n) <= 19 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 19 <= \result)) || (((\old(n) <= 17 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 17 <= \result)) || (((m == \old(m) && \old(m) + 7 <= \result) && \old(n) <= 7) && \result <= \old(n) + \old(m))) || (((\old(m) + 18 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 18)) || (((\old(m) + 15 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 15)) || (((\old(n) <= 5 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 5 <= \result)) || (((m == \old(m) && \old(n) <= 3) && \result <= \old(n) + \old(m)) && \old(m) + 3 <= \result)) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(m) + 21 <= \result) && \old(n) <= 21)) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(n) <= 20) && \old(m) + 20 <= \result)) || ((\result <= \old(m) && m == \old(m)) && \old(n) + \old(m) <= \result)) || (((\old(n) <= 22 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 22 <= \result)) && ((n == \old(n) && \old(m) + 25 <= \result) || (n == \old(n) && \old(n) <= 24)) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 25 <= a - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 63.9s, OverallIterations: 26, TraceHistogramMax: 26, AutomataDifference: 38.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 748 SDtfs, 3235 SDslu, 1858 SDs, 0 SdLazy, 5624 SolverSat, 933 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1699 GetRequests, 779 SyntacticMatches, 0 SemanticMatches, 920 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8882 ImplicationChecksByTransitivity, 37.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 149 PreInvPairs, 524 NumberOfFragments, 2712 HoareAnnotationTreeSize, 149 FomulaSimplifications, 7523 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 39 FomulaSimplificationsInter, 10396 FormulaSimplificationTreeSizeReductionInter, 8.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...