/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-7d8eed3 [2020-11-07 00:43:58,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:43:58,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:43:58,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:43:58,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:43:58,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:43:58,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:43:58,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:43:58,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:43:58,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:43:58,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:43:58,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:43:58,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:43:58,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:43:58,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:43:58,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:43:58,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:43:58,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:43:58,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:43:58,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:43:58,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:43:58,529 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:43:58,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:43:58,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:43:58,547 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:43:58,547 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:43:58,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:43:58,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:43:58,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:43:58,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:43:58,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:43:58,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:43:58,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:43:58,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:43:58,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:43:58,556 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:43:58,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:43:58,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:43:58,557 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:43:58,558 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:43:58,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:43:58,560 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 00:43:58,585 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:43:58,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:43:58,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:43:58,589 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:43:58,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:43:58,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:43:58,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:43:58,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:43:58,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:43:58,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:43:58,592 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:43:58,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:43:58,592 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:43:58,593 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:43:58,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:43:58,593 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:43:58,593 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:43:58,593 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:43:58,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:43:58,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:43:58,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:43:58,594 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:43:58,595 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-11-07 00:43:58,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:43:59,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:43:59,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:43:59,012 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:43:59,013 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:43:59,014 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-11-07 00:43:59,106 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a54b069/0604c007ac354752b4acc25670b58bcf/FLAGf89d03de5 [2020-11-07 00:43:59,808 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:43:59,809 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_25x0-1.c [2020-11-07 00:43:59,817 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a54b069/0604c007ac354752b4acc25670b58bcf/FLAGf89d03de5 [2020-11-07 00:44:00,209 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a54b069/0604c007ac354752b4acc25670b58bcf [2020-11-07 00:44:00,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:44:00,221 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:44:00,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:44:00,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:44:00,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:44:00,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:44:00" (1/1) ... [2020-11-07 00:44:00,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46aada01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:44:00, skipping insertion in model container [2020-11-07 00:44:00,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:44:00" (1/1) ... [2020-11-07 00:44:00,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:44:00,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:44:00,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:44:00,457 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:44:00,475 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:44:00,493 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:44:00,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:44:00 WrapperNode [2020-11-07 00:44:00,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:44:00,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:44:00,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:44:00,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:44:00,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:44:00" (1/1) ... [2020-11-07 00:44:00,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:44:00" (1/1) ... [2020-11-07 00:44:00,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:44:00" (1/1) ... [2020-11-07 00:44:00,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:44:00" (1/1) ... [2020-11-07 00:44:00,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:44:00" (1/1) ... [2020-11-07 00:44:00,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:44:00" (1/1) ... [2020-11-07 00:44:00,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:44:00" (1/1) ... [2020-11-07 00:44:00,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:44:00,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:44:00,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:44:00,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:44:00,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:44:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:44:00,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:44:00,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:44:00,629 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:44:00,629 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-11-07 00:44:00,629 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:44:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:44:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:44:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:44:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:44:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-11-07 00:44:00,631 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:44:00,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:44:00,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:44:00,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:44:00,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:44:00,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:44:00,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:44:01,145 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:44:01,146 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:44:01,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:44:01 BoogieIcfgContainer [2020-11-07 00:44:01,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:44:01,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:44:01,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:44:01,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:44:01,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:44:00" (1/3) ... [2020-11-07 00:44:01,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba5b476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:44:01, skipping insertion in model container [2020-11-07 00:44:01,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:44:00" (2/3) ... [2020-11-07 00:44:01,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba5b476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:44:01, skipping insertion in model container [2020-11-07 00:44:01,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:44:01" (3/3) ... [2020-11-07 00:44:01,162 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_25x0-1.c [2020-11-07 00:44:01,181 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:44:01,185 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:44:01,198 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:44:01,267 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:44:01,271 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:44:01,271 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:44:01,271 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:44:01,271 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:44:01,272 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:44:01,272 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:44:01,272 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:44:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-11-07 00:44:01,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-07 00:44:01,335 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:01,336 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-11-07 00:44:01,337 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:01,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:01,352 INFO L82 PathProgramCache]: Analyzing trace with hash -342472451, now seen corresponding path program 1 times [2020-11-07 00:44:01,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:01,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [530384223] [2020-11-07 00:44:01,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:01,464 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:01,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:01,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:44:01,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [530384223] [2020-11-07 00:44:01,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:01,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:44:01,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672912865] [2020-11-07 00:44:01,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:44:01,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:01,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:44:01,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:44:01,887 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 6 states. [2020-11-07 00:44:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:02,212 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-11-07 00:44:02,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:44:02,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-11-07 00:44:02,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:02,224 INFO L225 Difference]: With dead ends: 52 [2020-11-07 00:44:02,225 INFO L226 Difference]: Without dead ends: 34 [2020-11-07 00:44:02,228 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:44:02,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-11-07 00:44:02,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-11-07 00:44:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-07 00:44:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2020-11-07 00:44:02,290 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 27 [2020-11-07 00:44:02,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:02,291 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2020-11-07 00:44:02,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:44:02,291 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-11-07 00:44:02,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-07 00:44:02,293 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:02,294 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-11-07 00:44:02,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:44:02,294 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:02,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:02,301 INFO L82 PathProgramCache]: Analyzing trace with hash 653425116, now seen corresponding path program 1 times [2020-11-07 00:44:02,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:02,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [472743427] [2020-11-07 00:44:02,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:02,306 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:02,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:02,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:02,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-07 00:44:02,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [472743427] [2020-11-07 00:44:02,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:02,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:44:02,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071531266] [2020-11-07 00:44:02,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:44:02,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:02,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:44:02,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:44:02,635 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 7 states. [2020-11-07 00:44:02,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:02,969 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-11-07 00:44:02,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:44:02,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-11-07 00:44:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:02,973 INFO L225 Difference]: With dead ends: 46 [2020-11-07 00:44:02,974 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 00:44:02,976 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-11-07 00:44:02,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 00:44:03,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-07 00:44:03,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 00:44:03,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-11-07 00:44:03,006 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2020-11-07 00:44:03,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:03,006 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-11-07 00:44:03,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:44:03,007 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-11-07 00:44:03,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-07 00:44:03,010 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:03,010 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-11-07 00:44:03,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:44:03,011 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:03,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:03,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1221623283, now seen corresponding path program 2 times [2020-11-07 00:44:03,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:03,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1188007702] [2020-11-07 00:44:03,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:03,020 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:03,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:03,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:03,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:03,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-07 00:44:03,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1188007702] [2020-11-07 00:44:03,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:03,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:44:03,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951727267] [2020-11-07 00:44:03,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:44:03,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:03,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:44:03,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:44:03,250 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 8 states. [2020-11-07 00:44:03,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:03,575 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-11-07 00:44:03,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:44:03,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-11-07 00:44:03,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:03,578 INFO L225 Difference]: With dead ends: 51 [2020-11-07 00:44:03,578 INFO L226 Difference]: Without dead ends: 44 [2020-11-07 00:44:03,579 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:44:03,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-11-07 00:44:03,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-11-07 00:44:03,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-11-07 00:44:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2020-11-07 00:44:03,595 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 45 [2020-11-07 00:44:03,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:03,596 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2020-11-07 00:44:03,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:44:03,596 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-11-07 00:44:03,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-07 00:44:03,598 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:03,599 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-11-07 00:44:03,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:44:03,599 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:03,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:03,600 INFO L82 PathProgramCache]: Analyzing trace with hash 942298982, now seen corresponding path program 3 times [2020-11-07 00:44:03,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:03,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [272250795] [2020-11-07 00:44:03,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:03,604 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:03,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:03,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:03,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:03,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:03,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:03,779 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-11-07 00:44:03,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [272250795] [2020-11-07 00:44:03,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:03,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:44:03,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281468047] [2020-11-07 00:44:03,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:44:03,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:03,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:44:03,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:44:03,783 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 9 states. [2020-11-07 00:44:04,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:04,162 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-11-07 00:44:04,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:44:04,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-11-07 00:44:04,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:04,164 INFO L225 Difference]: With dead ends: 56 [2020-11-07 00:44:04,165 INFO L226 Difference]: Without dead ends: 49 [2020-11-07 00:44:04,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:44:04,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-11-07 00:44:04,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-11-07 00:44:04,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-11-07 00:44:04,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2020-11-07 00:44:04,180 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 54 [2020-11-07 00:44:04,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:04,181 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2020-11-07 00:44:04,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:44:04,181 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2020-11-07 00:44:04,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-07 00:44:04,183 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:04,183 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-11-07 00:44:04,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:44:04,184 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:04,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:04,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1161295337, now seen corresponding path program 4 times [2020-11-07 00:44:04,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:04,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1786384299] [2020-11-07 00:44:04,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:04,188 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:04,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:04,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:04,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:04,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:04,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:04,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-11-07 00:44:04,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1786384299] [2020-11-07 00:44:04,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:04,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:44:04,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756793756] [2020-11-07 00:44:04,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:44:04,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:04,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:44:04,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:44:04,395 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 10 states. [2020-11-07 00:44:04,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:04,879 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-11-07 00:44:04,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:44:04,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-11-07 00:44:04,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:04,882 INFO L225 Difference]: With dead ends: 61 [2020-11-07 00:44:04,882 INFO L226 Difference]: Without dead ends: 54 [2020-11-07 00:44:04,884 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:44:04,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-11-07 00:44:04,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-11-07 00:44:04,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-07 00:44:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-11-07 00:44:04,909 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 63 [2020-11-07 00:44:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:04,911 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-11-07 00:44:04,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:44:04,915 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-11-07 00:44:04,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-07 00:44:04,918 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:04,921 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-11-07 00:44:04,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:44:04,922 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:04,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:04,925 INFO L82 PathProgramCache]: Analyzing trace with hash -2109333008, now seen corresponding path program 5 times [2020-11-07 00:44:04,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:04,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [810104113] [2020-11-07 00:44:04,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:04,928 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:05,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:05,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:05,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:05,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:05,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:05,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:05,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:05,205 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-11-07 00:44:05,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [810104113] [2020-11-07 00:44:05,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:05,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:44:05,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267824604] [2020-11-07 00:44:05,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:44:05,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:05,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:44:05,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:44:05,208 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 11 states. [2020-11-07 00:44:05,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:05,829 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-11-07 00:44:05,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:44:05,830 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-11-07 00:44:05,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:05,832 INFO L225 Difference]: With dead ends: 66 [2020-11-07 00:44:05,832 INFO L226 Difference]: Without dead ends: 59 [2020-11-07 00:44:05,836 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-11-07 00:44:05,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-07 00:44:05,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-07 00:44:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-07 00:44:05,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-11-07 00:44:05,866 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 72 [2020-11-07 00:44:05,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:05,866 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-11-07 00:44:05,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:44:05,867 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-11-07 00:44:05,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 00:44:05,870 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:05,871 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-11-07 00:44:05,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:44:05,874 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:05,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:05,878 INFO L82 PathProgramCache]: Analyzing trace with hash 639783135, now seen corresponding path program 6 times [2020-11-07 00:44:05,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:05,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1034040697] [2020-11-07 00:44:05,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:05,881 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:05,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:05,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:06,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:06,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:06,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:06,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:06,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:06,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:06,207 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-11-07 00:44:06,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1034040697] [2020-11-07 00:44:06,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:06,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:44:06,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086505764] [2020-11-07 00:44:06,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:44:06,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:06,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:44:06,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:44:06,210 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 12 states. [2020-11-07 00:44:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:06,898 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-11-07 00:44:06,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 00:44:06,898 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-11-07 00:44:06,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:06,900 INFO L225 Difference]: With dead ends: 71 [2020-11-07 00:44:06,903 INFO L226 Difference]: Without dead ends: 64 [2020-11-07 00:44:06,904 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-11-07 00:44:06,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-07 00:44:06,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-11-07 00:44:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-07 00:44:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2020-11-07 00:44:06,923 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 81 [2020-11-07 00:44:06,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:06,924 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2020-11-07 00:44:06,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:44:06,927 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2020-11-07 00:44:06,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-07 00:44:06,929 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:06,929 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-11-07 00:44:06,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:44:06,929 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:06,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:06,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1631598970, now seen corresponding path program 7 times [2020-11-07 00:44:06,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:06,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [76128972] [2020-11-07 00:44:06,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:06,936 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-11-07 00:44:07,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [76128972] [2020-11-07 00:44:07,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:07,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 00:44:07,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164334060] [2020-11-07 00:44:07,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 00:44:07,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:07,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 00:44:07,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:44:07,312 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 13 states. [2020-11-07 00:44:07,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:07,983 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-11-07 00:44:07,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 00:44:07,984 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-11-07 00:44:07,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:07,987 INFO L225 Difference]: With dead ends: 76 [2020-11-07 00:44:07,987 INFO L226 Difference]: Without dead ends: 69 [2020-11-07 00:44:07,988 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-11-07 00:44:07,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-07 00:44:08,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-11-07 00:44:08,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-07 00:44:08,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-11-07 00:44:08,008 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 90 [2020-11-07 00:44:08,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:08,009 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-11-07 00:44:08,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 00:44:08,009 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-11-07 00:44:08,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-11-07 00:44:08,011 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:08,012 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-11-07 00:44:08,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:44:08,012 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:08,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:08,013 INFO L82 PathProgramCache]: Analyzing trace with hash -440062251, now seen corresponding path program 8 times [2020-11-07 00:44:08,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:08,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [349594414] [2020-11-07 00:44:08,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:08,017 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:08,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:08,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:08,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:08,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:08,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:08,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:08,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:08,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:08,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:08,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:08,493 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-11-07 00:44:08,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [349594414] [2020-11-07 00:44:08,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:08,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-07 00:44:08,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501124206] [2020-11-07 00:44:08,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 00:44:08,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:08,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 00:44:08,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:44:08,503 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 14 states. [2020-11-07 00:44:09,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:09,226 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-11-07 00:44:09,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 00:44:09,227 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-11-07 00:44:09,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:09,231 INFO L225 Difference]: With dead ends: 81 [2020-11-07 00:44:09,231 INFO L226 Difference]: Without dead ends: 74 [2020-11-07 00:44:09,233 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-11-07 00:44:09,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-07 00:44:09,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-11-07 00:44:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-07 00:44:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2020-11-07 00:44:09,250 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 99 [2020-11-07 00:44:09,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:09,251 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2020-11-07 00:44:09,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 00:44:09,251 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2020-11-07 00:44:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-11-07 00:44:09,252 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:09,253 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-11-07 00:44:09,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:44:09,253 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:09,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:09,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1832058372, now seen corresponding path program 9 times [2020-11-07 00:44:09,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:09,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [486076861] [2020-11-07 00:44:09,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:09,257 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:09,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:09,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:09,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:09,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:09,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:09,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:09,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:09,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:09,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:09,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:09,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-11-07 00:44:09,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [486076861] [2020-11-07 00:44:09,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:09,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:44:09,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137861297] [2020-11-07 00:44:09,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:44:09,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:09,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:44:09,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:44:09,735 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 15 states. [2020-11-07 00:44:10,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:10,429 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-11-07 00:44:10,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:44:10,430 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-11-07 00:44:10,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:10,431 INFO L225 Difference]: With dead ends: 86 [2020-11-07 00:44:10,432 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 00:44:10,433 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-11-07 00:44:10,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 00:44:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-11-07 00:44:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-07 00:44:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2020-11-07 00:44:10,466 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 108 [2020-11-07 00:44:10,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:10,468 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2020-11-07 00:44:10,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:44:10,468 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2020-11-07 00:44:10,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-11-07 00:44:10,469 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:10,470 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-11-07 00:44:10,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:44:10,470 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:10,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:10,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1858719797, now seen corresponding path program 10 times [2020-11-07 00:44:10,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:10,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1580697443] [2020-11-07 00:44:10,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:10,475 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:10,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:11,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:11,109 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-11-07 00:44:11,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1580697443] [2020-11-07 00:44:11,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:11,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-07 00:44:11,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109960749] [2020-11-07 00:44:11,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 00:44:11,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:11,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 00:44:11,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-11-07 00:44:11,114 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 16 states. [2020-11-07 00:44:11,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:11,925 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-11-07 00:44:11,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 00:44:11,929 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2020-11-07 00:44:11,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:11,930 INFO L225 Difference]: With dead ends: 91 [2020-11-07 00:44:11,930 INFO L226 Difference]: Without dead ends: 84 [2020-11-07 00:44:11,932 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=268, Invalid=544, Unknown=0, NotChecked=0, Total=812 [2020-11-07 00:44:11,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-07 00:44:11,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-11-07 00:44:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-07 00:44:11,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2020-11-07 00:44:11,956 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 117 [2020-11-07 00:44:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:11,957 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2020-11-07 00:44:11,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 00:44:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2020-11-07 00:44:11,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-11-07 00:44:11,958 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:11,959 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-11-07 00:44:11,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:44:11,959 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:11,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:11,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1671901298, now seen corresponding path program 11 times [2020-11-07 00:44:11,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:11,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [918227451] [2020-11-07 00:44:11,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:11,963 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:12,697 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-11-07 00:44:12,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [918227451] [2020-11-07 00:44:12,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:12,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-07 00:44:12,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432983086] [2020-11-07 00:44:12,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 00:44:12,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:12,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 00:44:12,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:44:12,701 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 17 states. [2020-11-07 00:44:13,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:13,656 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2020-11-07 00:44:13,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 00:44:13,656 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2020-11-07 00:44:13,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:13,658 INFO L225 Difference]: With dead ends: 96 [2020-11-07 00:44:13,658 INFO L226 Difference]: Without dead ends: 89 [2020-11-07 00:44:13,659 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2020-11-07 00:44:13,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-07 00:44:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-11-07 00:44:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-11-07 00:44:13,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2020-11-07 00:44:13,674 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 126 [2020-11-07 00:44:13,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:13,675 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2020-11-07 00:44:13,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 00:44:13,675 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2020-11-07 00:44:13,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-11-07 00:44:13,677 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:13,677 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-11-07 00:44:13,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 00:44:13,677 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:13,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:13,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1502940223, now seen corresponding path program 12 times [2020-11-07 00:44:13,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:13,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1500915841] [2020-11-07 00:44:13,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:13,681 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:13,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:13,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:13,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:13,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:13,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:13,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:13,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:13,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:14,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:14,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:14,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:14,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:14,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:14,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:14,317 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-11-07 00:44:14,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1500915841] [2020-11-07 00:44:14,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:14,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-11-07 00:44:14,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244451044] [2020-11-07 00:44:14,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 00:44:14,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:14,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 00:44:14,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-11-07 00:44:14,320 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 18 states. [2020-11-07 00:44:15,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:15,280 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2020-11-07 00:44:15,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 00:44:15,281 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2020-11-07 00:44:15,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:15,283 INFO L225 Difference]: With dead ends: 101 [2020-11-07 00:44:15,284 INFO L226 Difference]: Without dead ends: 94 [2020-11-07 00:44:15,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2020-11-07 00:44:15,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-11-07 00:44:15,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-11-07 00:44:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-11-07 00:44:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2020-11-07 00:44:15,305 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 135 [2020-11-07 00:44:15,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:15,306 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2020-11-07 00:44:15,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 00:44:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2020-11-07 00:44:15,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-11-07 00:44:15,308 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:15,308 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-11-07 00:44:15,308 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 00:44:15,309 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:15,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:15,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1695288856, now seen corresponding path program 13 times [2020-11-07 00:44:15,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:15,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [950721383] [2020-11-07 00:44:15,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:15,312 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:15,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-11-07 00:44:16,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [950721383] [2020-11-07 00:44:16,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:16,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-07 00:44:16,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521426134] [2020-11-07 00:44:16,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 00:44:16,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:16,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 00:44:16,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-11-07 00:44:16,147 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 19 states. [2020-11-07 00:44:17,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:17,131 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2020-11-07 00:44:17,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 00:44:17,132 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2020-11-07 00:44:17,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:17,134 INFO L225 Difference]: With dead ends: 106 [2020-11-07 00:44:17,136 INFO L226 Difference]: Without dead ends: 99 [2020-11-07 00:44:17,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-11-07 00:44:17,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-11-07 00:44:17,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2020-11-07 00:44:17,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-11-07 00:44:17,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2020-11-07 00:44:17,169 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 144 [2020-11-07 00:44:17,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:17,170 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2020-11-07 00:44:17,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 00:44:17,170 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2020-11-07 00:44:17,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-11-07 00:44:17,172 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:17,173 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-11-07 00:44:17,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 00:44:17,173 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:17,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:17,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1916345015, now seen corresponding path program 14 times [2020-11-07 00:44:17,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:17,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1715670378] [2020-11-07 00:44:17,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:17,179 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:17,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-11-07 00:44:18,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1715670378] [2020-11-07 00:44:18,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:18,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-11-07 00:44:18,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305816259] [2020-11-07 00:44:18,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 00:44:18,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:18,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 00:44:18,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-11-07 00:44:18,249 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 20 states. [2020-11-07 00:44:19,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:19,356 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2020-11-07 00:44:19,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 00:44:19,359 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 153 [2020-11-07 00:44:19,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:19,361 INFO L225 Difference]: With dead ends: 111 [2020-11-07 00:44:19,361 INFO L226 Difference]: Without dead ends: 104 [2020-11-07 00:44:19,365 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=450, Invalid=882, Unknown=0, NotChecked=0, Total=1332 [2020-11-07 00:44:19,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-11-07 00:44:19,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-11-07 00:44:19,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-11-07 00:44:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2020-11-07 00:44:19,384 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 153 [2020-11-07 00:44:19,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:19,388 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2020-11-07 00:44:19,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 00:44:19,388 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2020-11-07 00:44:19,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-11-07 00:44:19,390 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:19,390 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-11-07 00:44:19,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 00:44:19,391 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:19,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:19,391 INFO L82 PathProgramCache]: Analyzing trace with hash -540599902, now seen corresponding path program 15 times [2020-11-07 00:44:19,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:19,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [828208502] [2020-11-07 00:44:19,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:19,400 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:19,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:19,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:19,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:19,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:19,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:19,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:19,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:19,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:19,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:19,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:19,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:20,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:20,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:20,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:20,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:20,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:20,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:20,455 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-11-07 00:44:20,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [828208502] [2020-11-07 00:44:20,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:20,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-11-07 00:44:20,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484184655] [2020-11-07 00:44:20,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-07 00:44:20,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:20,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-07 00:44:20,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2020-11-07 00:44:20,461 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 21 states. [2020-11-07 00:44:21,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:21,531 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2020-11-07 00:44:21,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 00:44:21,532 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 162 [2020-11-07 00:44:21,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:21,534 INFO L225 Difference]: With dead ends: 116 [2020-11-07 00:44:21,534 INFO L226 Difference]: Without dead ends: 109 [2020-11-07 00:44:21,535 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-11-07 00:44:21,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-11-07 00:44:21,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-11-07 00:44:21,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-11-07 00:44:21,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2020-11-07 00:44:21,551 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 162 [2020-11-07 00:44:21,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:21,552 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2020-11-07 00:44:21,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-07 00:44:21,552 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2020-11-07 00:44:21,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-11-07 00:44:21,554 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:21,554 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-11-07 00:44:21,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 00:44:21,555 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:21,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:21,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1851147437, now seen corresponding path program 16 times [2020-11-07 00:44:21,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:21,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2034808105] [2020-11-07 00:44:21,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:21,558 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:21,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:21,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:21,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:21,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:21,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:21,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:21,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:21,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:21,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-11-07 00:44:22,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2034808105] [2020-11-07 00:44:22,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:22,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-11-07 00:44:22,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861227731] [2020-11-07 00:44:22,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 00:44:22,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:22,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 00:44:22,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2020-11-07 00:44:22,671 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 22 states. [2020-11-07 00:44:23,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:23,919 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2020-11-07 00:44:23,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 00:44:23,920 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 171 [2020-11-07 00:44:23,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:23,923 INFO L225 Difference]: With dead ends: 121 [2020-11-07 00:44:23,923 INFO L226 Difference]: Without dead ends: 114 [2020-11-07 00:44:23,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=559, Invalid=1081, Unknown=0, NotChecked=0, Total=1640 [2020-11-07 00:44:23,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-11-07 00:44:23,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-11-07 00:44:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-11-07 00:44:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2020-11-07 00:44:23,939 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 171 [2020-11-07 00:44:23,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:23,940 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2020-11-07 00:44:23,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 00:44:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2020-11-07 00:44:23,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-11-07 00:44:23,943 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:23,943 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-11-07 00:44:23,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 00:44:23,943 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:23,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:23,944 INFO L82 PathProgramCache]: Analyzing trace with hash -383495636, now seen corresponding path program 17 times [2020-11-07 00:44:23,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:23,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1547385691] [2020-11-07 00:44:23,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:23,947 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:24,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-11-07 00:44:25,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1547385691] [2020-11-07 00:44:25,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:25,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-11-07 00:44:25,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316680505] [2020-11-07 00:44:25,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 00:44:25,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:25,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 00:44:25,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2020-11-07 00:44:25,124 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 23 states. [2020-11-07 00:44:26,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:26,373 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2020-11-07 00:44:26,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 00:44:26,374 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 180 [2020-11-07 00:44:26,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:26,375 INFO L225 Difference]: With dead ends: 126 [2020-11-07 00:44:26,375 INFO L226 Difference]: Without dead ends: 119 [2020-11-07 00:44:26,377 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=618, Invalid=1188, Unknown=0, NotChecked=0, Total=1806 [2020-11-07 00:44:26,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-11-07 00:44:26,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2020-11-07 00:44:26,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-11-07 00:44:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2020-11-07 00:44:26,400 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 180 [2020-11-07 00:44:26,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:26,401 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2020-11-07 00:44:26,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 00:44:26,401 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2020-11-07 00:44:26,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-11-07 00:44:26,403 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:26,404 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-11-07 00:44:26,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 00:44:26,404 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:26,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:26,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1621618269, now seen corresponding path program 18 times [2020-11-07 00:44:26,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:26,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1525558660] [2020-11-07 00:44:26,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:26,409 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:26,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:26,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:26,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:26,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:26,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:26,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:26,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:26,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:26,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:26,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:26,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:26,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:26,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:26,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:27,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:27,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:27,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:27,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:27,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:27,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:27,478 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-11-07 00:44:27,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1525558660] [2020-11-07 00:44:27,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:27,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-11-07 00:44:27,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945308085] [2020-11-07 00:44:27,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 00:44:27,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:27,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 00:44:27,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2020-11-07 00:44:27,480 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 24 states. [2020-11-07 00:44:28,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:28,873 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2020-11-07 00:44:28,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 00:44:28,875 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 189 [2020-11-07 00:44:28,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:28,876 INFO L225 Difference]: With dead ends: 131 [2020-11-07 00:44:28,876 INFO L226 Difference]: Without dead ends: 124 [2020-11-07 00:44:28,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=680, Invalid=1300, Unknown=0, NotChecked=0, Total=1980 [2020-11-07 00:44:28,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-11-07 00:44:28,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2020-11-07 00:44:28,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-11-07 00:44:28,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2020-11-07 00:44:28,901 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 189 [2020-11-07 00:44:28,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:28,904 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2020-11-07 00:44:28,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 00:44:28,904 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2020-11-07 00:44:28,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-11-07 00:44:28,907 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:28,908 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-11-07 00:44:28,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-07 00:44:28,908 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:28,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:28,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1138628534, now seen corresponding path program 19 times [2020-11-07 00:44:28,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:28,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1599706147] [2020-11-07 00:44:28,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:28,912 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:28,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:28,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:29,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:30,093 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-11-07 00:44:30,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1599706147] [2020-11-07 00:44:30,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:30,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-11-07 00:44:30,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083982348] [2020-11-07 00:44:30,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-07 00:44:30,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:30,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-07 00:44:30,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=363, Unknown=0, NotChecked=0, Total=600 [2020-11-07 00:44:30,095 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 25 states. [2020-11-07 00:44:31,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:31,529 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2020-11-07 00:44:31,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 00:44:31,530 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 198 [2020-11-07 00:44:31,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:31,532 INFO L225 Difference]: With dead ends: 136 [2020-11-07 00:44:31,532 INFO L226 Difference]: Without dead ends: 129 [2020-11-07 00:44:31,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=745, Invalid=1417, Unknown=0, NotChecked=0, Total=2162 [2020-11-07 00:44:31,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-11-07 00:44:31,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2020-11-07 00:44:31,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-11-07 00:44:31,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2020-11-07 00:44:31,548 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 198 [2020-11-07 00:44:31,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:31,549 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2020-11-07 00:44:31,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-07 00:44:31,549 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2020-11-07 00:44:31,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-11-07 00:44:31,552 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:31,552 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-11-07 00:44:31,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-07 00:44:31,552 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:31,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:31,553 INFO L82 PathProgramCache]: Analyzing trace with hash -223075943, now seen corresponding path program 20 times [2020-11-07 00:44:31,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:31,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1632344958] [2020-11-07 00:44:31,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:31,555 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:31,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:31,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:31,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:31,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:31,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:31,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:31,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:31,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:32,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:32,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:32,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:32,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:32,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:32,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:32,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:32,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:32,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:32,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:32,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:32,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:32,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:32,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-11-07 00:44:32,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1632344958] [2020-11-07 00:44:32,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:32,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2020-11-07 00:44:32,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648605921] [2020-11-07 00:44:32,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-07 00:44:32,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:32,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-07 00:44:32,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2020-11-07 00:44:32,789 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 26 states. [2020-11-07 00:44:34,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:34,307 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2020-11-07 00:44:34,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-11-07 00:44:34,308 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 207 [2020-11-07 00:44:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:34,310 INFO L225 Difference]: With dead ends: 141 [2020-11-07 00:44:34,310 INFO L226 Difference]: Without dead ends: 134 [2020-11-07 00:44:34,312 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-11-07 00:44:34,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-11-07 00:44:34,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2020-11-07 00:44:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-11-07 00:44:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2020-11-07 00:44:34,328 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 207 [2020-11-07 00:44:34,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:34,329 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2020-11-07 00:44:34,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-07 00:44:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2020-11-07 00:44:34,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-11-07 00:44:34,330 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:34,330 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-11-07 00:44:34,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-07 00:44:34,331 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:34,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:34,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1160852928, now seen corresponding path program 21 times [2020-11-07 00:44:34,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:34,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [569972406] [2020-11-07 00:44:34,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:34,334 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:34,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:34,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:34,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:34,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:34,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:34,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:34,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:34,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:34,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:34,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:34,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:34,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:35,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:35,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:35,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:35,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:35,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:35,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:35,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:35,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:35,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:35,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:35,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:35,780 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2020-11-07 00:44:35,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [569972406] [2020-11-07 00:44:35,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:35,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2020-11-07 00:44:35,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767221368] [2020-11-07 00:44:35,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-11-07 00:44:35,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:35,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-11-07 00:44:35,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=420, Unknown=0, NotChecked=0, Total=702 [2020-11-07 00:44:35,782 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 27 states. [2020-11-07 00:44:37,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:37,371 INFO L93 Difference]: Finished difference Result 146 states and 147 transitions. [2020-11-07 00:44:37,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 00:44:37,375 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 216 [2020-11-07 00:44:37,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:37,376 INFO L225 Difference]: With dead ends: 146 [2020-11-07 00:44:37,376 INFO L226 Difference]: Without dead ends: 139 [2020-11-07 00:44:37,378 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=884, Invalid=1666, Unknown=0, NotChecked=0, Total=2550 [2020-11-07 00:44:37,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-11-07 00:44:37,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-11-07 00:44:37,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-11-07 00:44:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2020-11-07 00:44:37,395 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 216 [2020-11-07 00:44:37,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:37,395 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2020-11-07 00:44:37,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-11-07 00:44:37,395 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2020-11-07 00:44:37,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-11-07 00:44:37,397 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:37,397 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-11-07 00:44:37,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-07 00:44:37,398 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:37,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:37,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1665133425, now seen corresponding path program 22 times [2020-11-07 00:44:37,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:37,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [573680285] [2020-11-07 00:44:37,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:37,401 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:37,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:37,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:37,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:37,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:37,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:37,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:37,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:37,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:37,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:38,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:38,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:38,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:38,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:38,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:38,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:38,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:38,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:38,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:38,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:38,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:38,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:38,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:38,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:38,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2020-11-07 00:44:38,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [573680285] [2020-11-07 00:44:38,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:38,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2020-11-07 00:44:38,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777145703] [2020-11-07 00:44:38,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-11-07 00:44:38,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:38,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-11-07 00:44:38,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=450, Unknown=0, NotChecked=0, Total=756 [2020-11-07 00:44:38,945 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 28 states. [2020-11-07 00:44:40,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:40,590 INFO L93 Difference]: Finished difference Result 151 states and 152 transitions. [2020-11-07 00:44:40,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-11-07 00:44:40,593 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 225 [2020-11-07 00:44:40,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:40,595 INFO L225 Difference]: With dead ends: 151 [2020-11-07 00:44:40,595 INFO L226 Difference]: Without dead ends: 144 [2020-11-07 00:44:40,598 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=958, Invalid=1798, Unknown=0, NotChecked=0, Total=2756 [2020-11-07 00:44:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-11-07 00:44:40,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2020-11-07 00:44:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-11-07 00:44:40,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2020-11-07 00:44:40,615 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 225 [2020-11-07 00:44:40,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:40,615 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2020-11-07 00:44:40,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-11-07 00:44:40,616 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2020-11-07 00:44:40,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-11-07 00:44:40,617 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:40,617 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-11-07 00:44:40,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-07 00:44:40,618 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:40,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:40,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1123076554, now seen corresponding path program 23 times [2020-11-07 00:44:40,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:40,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2017186492] [2020-11-07 00:44:40,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:40,621 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:40,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:40,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:40,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:40,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:40,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:40,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:41,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:41,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:41,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:41,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:41,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:41,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:41,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:41,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:41,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:41,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:41,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:41,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:41,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:41,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:41,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:41,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:41,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:41,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:41,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:42,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2020-11-07 00:44:42,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2017186492] [2020-11-07 00:44:42,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:42,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2020-11-07 00:44:42,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93101331] [2020-11-07 00:44:42,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-11-07 00:44:42,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:42,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-11-07 00:44:42,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=481, Unknown=0, NotChecked=0, Total=812 [2020-11-07 00:44:42,259 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 29 states. [2020-11-07 00:44:44,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:44,005 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2020-11-07 00:44:44,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-07 00:44:44,006 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 234 [2020-11-07 00:44:44,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:44,008 INFO L225 Difference]: With dead ends: 156 [2020-11-07 00:44:44,008 INFO L226 Difference]: Without dead ends: 149 [2020-11-07 00:44:44,011 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1935, Unknown=0, NotChecked=0, Total=2970 [2020-11-07 00:44:44,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-11-07 00:44:44,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2020-11-07 00:44:44,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2020-11-07 00:44:44,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2020-11-07 00:44:44,029 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 234 [2020-11-07 00:44:44,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:44,029 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2020-11-07 00:44:44,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-11-07 00:44:44,029 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2020-11-07 00:44:44,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2020-11-07 00:44:44,031 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:44,031 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-11-07 00:44:44,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-07 00:44:44,031 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:44,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:44,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1991346821, now seen corresponding path program 24 times [2020-11-07 00:44:44,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:44,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2063544507] [2020-11-07 00:44:44,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:44,035 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:44,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:44,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:44,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:44,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:44,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:44,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:44,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:44,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:44,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:44,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:44,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:44,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:44,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:44,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:44,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:45,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:45,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:45,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:45,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:45,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:45,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:45,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:45,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:45,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:45,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:45,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:46,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2020-11-07 00:44:46,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2063544507] [2020-11-07 00:44:46,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:46,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2020-11-07 00:44:46,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168970764] [2020-11-07 00:44:46,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-11-07 00:44:46,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:46,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-11-07 00:44:46,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=513, Unknown=0, NotChecked=0, Total=870 [2020-11-07 00:44:46,210 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 30 states. [2020-11-07 00:44:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:44:48,067 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2020-11-07 00:44:48,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-07 00:44:48,067 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 243 [2020-11-07 00:44:48,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:44:48,070 INFO L225 Difference]: With dead ends: 161 [2020-11-07 00:44:48,070 INFO L226 Difference]: Without dead ends: 154 [2020-11-07 00:44:48,072 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1115, Invalid=2077, Unknown=0, NotChecked=0, Total=3192 [2020-11-07 00:44:48,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-11-07 00:44:48,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2020-11-07 00:44:48,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-11-07 00:44:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2020-11-07 00:44:48,088 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 243 [2020-11-07 00:44:48,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:44:48,089 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2020-11-07 00:44:48,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-11-07 00:44:48,089 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2020-11-07 00:44:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2020-11-07 00:44:48,091 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:44:48,091 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-11-07 00:44:48,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-07 00:44:48,091 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:44:48,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:44:48,092 INFO L82 PathProgramCache]: Analyzing trace with hash 492729940, now seen corresponding path program 25 times [2020-11-07 00:44:48,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:44:48,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [494450933] [2020-11-07 00:44:48,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:44:48,095 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:44:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:48,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:44:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:48,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:44:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:48,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:48,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:48,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:49,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:49,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:49,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:49,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:49,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:49,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:49,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:50,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:50,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:50,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:50,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:50,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:50,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:50,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:51,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:51,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:51,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:51,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:51,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:51,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:52,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:52,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:44:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:44:53,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2020-11-07 00:44:53,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [494450933] [2020-11-07 00:44:53,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:44:53,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2020-11-07 00:44:53,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500185333] [2020-11-07 00:44:53,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 62 states [2020-11-07 00:44:53,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:44:53,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2020-11-07 00:44:53,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=727, Invalid=3055, Unknown=0, NotChecked=0, Total=3782 [2020-11-07 00:44:53,520 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 62 states. [2020-11-07 00:44:58,791 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-11-07 00:45:09,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:45:09,016 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2020-11-07 00:45:09,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2020-11-07 00:45:09,016 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 252 [2020-11-07 00:45:09,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:45:09,017 INFO L225 Difference]: With dead ends: 154 [2020-11-07 00:45:09,017 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:45:09,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3032 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=4325, Invalid=17137, Unknown=0, NotChecked=0, Total=21462 [2020-11-07 00:45:09,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:45:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:45:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:45:09,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:45:09,024 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 252 [2020-11-07 00:45:09,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:45:09,024 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:45:09,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2020-11-07 00:45:09,025 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:45:09,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:45:09,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-07 00:45:09,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:45:09,213 WARN L194 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 122 [2020-11-07 00:45:09,426 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 119 [2020-11-07 00:45:09,609 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 119 [2020-11-07 00:45:09,811 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 122 [2020-11-07 00:45:09,991 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 122 [2020-11-07 00:45:11,944 WARN L194 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 208 DAG size of output: 164 [2020-11-07 00:45:13,533 WARN L194 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 181 DAG size of output: 134 [2020-11-07 00:45:15,092 WARN L194 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 181 DAG size of output: 134 [2020-11-07 00:45:16,691 WARN L194 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 187 DAG size of output: 140 [2020-11-07 00:45:18,221 WARN L194 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 187 DAG size of output: 140 [2020-11-07 00:45:18,398 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 00:45:18,399 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 00:45:18,399 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:45:18,399 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 00:45:18,399 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 00:45:18,399 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 00:45:18,399 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:45:18,400 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 00:45:18,400 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:45:18,400 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:45:18,400 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 00:45:18,400 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 00:45:18,400 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 00:45:18,400 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:45:18,401 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:45:18,401 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:45:18,401 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:45:18,401 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:45:18,402 INFO L262 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-11-07 00:45:18,402 INFO L262 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-11-07 00:45:18,402 INFO L262 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-11-07 00:45:18,403 INFO L262 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-11-07 00:45:18,403 INFO L262 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-11-07 00:45:18,403 INFO L262 CegarLoopResult]: At program point L6(lines 6 10) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|)) [2020-11-07 00:45:18,404 INFO L262 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-11-07 00:45:18,404 INFO L262 CegarLoopResult]: At program point L5(lines 5 11) the Hoare annotation is: (= sum_~n |sum_#in~n|) [2020-11-07 00:45:18,404 INFO L262 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-11-07 00:45:18,404 INFO L269 CegarLoopResult]: At program point sumENTRY(lines 5 11) the Hoare annotation is: true [2020-11-07 00:45:18,404 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 13 20) the Hoare annotation is: true [2020-11-07 00:45:18,404 INFO L262 CegarLoopResult]: At program point mainEXIT(lines 13 20) the Hoare annotation is: (<= 25 main_~a~0) [2020-11-07 00:45:18,405 INFO L262 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: false [2020-11-07 00:45:18,405 INFO L262 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-11-07 00:45:18,405 INFO L262 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: false [2020-11-07 00:45:18,405 INFO L262 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-11-07 00:45:18,405 INFO L262 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (<= main_~a~0 25) (<= 25 main_~a~0)) [2020-11-07 00:45:18,405 INFO L262 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-11-07 00:45:18,405 INFO L262 CegarLoopResult]: At program point L17-2(lines 13 20) the Hoare annotation is: (<= 25 main_~a~0) [2020-11-07 00:45:18,405 INFO L262 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-11-07 00:45:18,406 INFO L262 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-11-07 00:45:18,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:45:18 BoogieIcfgContainer [2020-11-07 00:45:18,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:45:18,437 INFO L168 Benchmark]: Toolchain (without parser) took 78220.48 ms. Allocated memory was 154.1 MB in the beginning and 671.1 MB in the end (delta: 516.9 MB). Free memory was 131.0 MB in the beginning and 459.4 MB in the end (delta: -328.4 MB). Peak memory consumption was 401.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:45:18,437 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 154.1 MB. Free memory is still 129.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:45:18,438 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.71 ms. Allocated memory is still 154.1 MB. Free memory was 130.3 MB in the beginning and 120.8 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:45:18,438 INFO L168 Benchmark]: Boogie Preprocessor took 54.35 ms. Allocated memory is still 154.1 MB. Free memory was 120.8 MB in the beginning and 119.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 00:45:18,439 INFO L168 Benchmark]: RCFGBuilder took 597.57 ms. Allocated memory is still 154.1 MB. Free memory was 119.4 MB in the beginning and 106.2 MB in the end (delta: 13.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:45:18,443 INFO L168 Benchmark]: TraceAbstraction took 77283.94 ms. Allocated memory was 154.1 MB in the beginning and 671.1 MB in the end (delta: 516.9 MB). Free memory was 105.6 MB in the beginning and 459.4 MB in the end (delta: -353.8 MB). Peak memory consumption was 376.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:45:18,445 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.29 ms. Allocated memory is still 154.1 MB. Free memory is still 129.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 265.71 ms. Allocated memory is still 154.1 MB. Free memory was 130.3 MB in the beginning and 120.8 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 54.35 ms. Allocated memory is still 154.1 MB. Free memory was 120.8 MB in the beginning and 119.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 597.57 ms. Allocated memory is still 154.1 MB. Free memory was 119.4 MB in the beginning and 106.2 MB in the end (delta: 13.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 77283.94 ms. Allocated memory was 154.1 MB in the beginning and 671.1 MB in the end (delta: 516.9 MB). Free memory was 105.6 MB in the beginning and 459.4 MB in the end (delta: -353.8 MB). Peak memory consumption was 376.4 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: 67.7s, OverallIterations: 26, TraceHistogramMax: 26, AutomataDifference: 40.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 748 SDtfs, 3235 SDslu, 1858 SDs, 0 SdLazy, 5624 SolverSat, 933 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1699 GetRequests, 779 SyntacticMatches, 0 SemanticMatches, 920 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8882 ImplicationChecksByTransitivity, 39.1s 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.2s 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...