/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_20x0-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 20:28:38,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 20:28:38,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 20:28:38,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 20:28:38,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 20:28:38,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 20:28:38,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 20:28:38,551 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 20:28:38,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 20:28:38,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 20:28:38,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 20:28:38,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 20:28:38,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 20:28:38,559 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 20:28:38,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 20:28:38,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 20:28:38,563 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 20:28:38,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 20:28:38,566 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 20:28:38,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 20:28:38,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 20:28:38,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 20:28:38,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 20:28:38,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 20:28:38,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 20:28:38,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 20:28:38,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 20:28:38,606 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 20:28:38,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 20:28:38,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 20:28:38,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 20:28:38,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 20:28:38,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 20:28:38,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 20:28:38,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 20:28:38,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 20:28:38,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 20:28:38,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 20:28:38,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 20:28:38,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 20:28:38,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 20:28:38,619 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-23 20:28:38,642 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 20:28:38,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 20:28:38,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 20:28:38,648 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 20:28:38,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 20:28:38,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 20:28:38,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 20:28:38,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 20:28:38,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 20:28:38,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 20:28:38,651 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 20:28:38,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 20:28:38,651 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 20:28:38,652 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 20:28:38,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 20:28:38,652 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-23 20:28:38,652 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 20:28:38,653 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 20:28:38,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 20:28:38,653 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 20:28:38,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-23 20:28:38,654 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 20:28:38,654 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-10-23 20:28:39,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 20:28:39,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 20:28:39,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 20:28:39,154 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 20:28:39,155 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 20:28:39,156 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_20x0-2.c [2020-10-23 20:28:39,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99c9cafc9/00f86b6d5935406aacb9fbb0c80ff507/FLAG959b86f17 [2020-10-23 20:28:39,846 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 20:28:39,846 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_20x0-2.c [2020-10-23 20:28:39,855 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99c9cafc9/00f86b6d5935406aacb9fbb0c80ff507/FLAG959b86f17 [2020-10-23 20:28:40,213 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99c9cafc9/00f86b6d5935406aacb9fbb0c80ff507 [2020-10-23 20:28:40,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 20:28:40,224 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 20:28:40,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 20:28:40,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 20:28:40,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 20:28:40,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:28:40" (1/1) ... [2020-10-23 20:28:40,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d4bca81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:40, skipping insertion in model container [2020-10-23 20:28:40,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:28:40" (1/1) ... [2020-10-23 20:28:40,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 20:28:40,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 20:28:40,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:28:40,425 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 20:28:40,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:28:40,456 INFO L208 MainTranslator]: Completed translation [2020-10-23 20:28:40,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:40 WrapperNode [2020-10-23 20:28:40,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 20:28:40,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 20:28:40,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 20:28:40,458 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 20:28:40,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:40" (1/1) ... [2020-10-23 20:28:40,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:40" (1/1) ... [2020-10-23 20:28:40,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:40" (1/1) ... [2020-10-23 20:28:40,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:40" (1/1) ... [2020-10-23 20:28:40,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:40" (1/1) ... [2020-10-23 20:28:40,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:40" (1/1) ... [2020-10-23 20:28:40,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:40" (1/1) ... [2020-10-23 20:28:40,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 20:28:40,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 20:28:40,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 20:28:40,491 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 20:28:40,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 20:28:40,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 20:28:40,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 20:28:40,577 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 20:28:40,577 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-10-23 20:28:40,577 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 20:28:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 20:28:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 20:28:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 20:28:40,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 20:28:40,579 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-10-23 20:28:40,579 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 20:28:40,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 20:28:40,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 20:28:40,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 20:28:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 20:28:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 20:28:40,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 20:28:40,813 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 20:28:40,813 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-23 20:28:40,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:28:40 BoogieIcfgContainer [2020-10-23 20:28:40,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 20:28:40,817 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 20:28:40,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 20:28:40,821 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 20:28:40,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:28:40" (1/3) ... [2020-10-23 20:28:40,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@705face3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:28:40, skipping insertion in model container [2020-10-23 20:28:40,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:40" (2/3) ... [2020-10-23 20:28:40,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@705face3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:28:40, skipping insertion in model container [2020-10-23 20:28:40,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:28:40" (3/3) ... [2020-10-23 20:28:40,836 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_20x0-2.c [2020-10-23 20:28:40,850 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-23 20:28:40,856 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 20:28:40,905 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 20:28:40,966 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 20:28:40,971 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 20:28:40,971 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-10-23 20:28:40,972 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 20:28:40,972 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 20:28:40,972 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 20:28:40,972 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 20:28:40,972 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 20:28:40,998 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-10-23 20:28:41,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-23 20:28:41,009 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:41,010 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:41,010 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:41,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:41,018 INFO L82 PathProgramCache]: Analyzing trace with hash -342472451, now seen corresponding path program 1 times [2020-10-23 20:28:41,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:41,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1324463999] [2020-10-23 20:28:41,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:41,117 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:41,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:41,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 20:28:41,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1324463999] [2020-10-23 20:28:41,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:41,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 20:28:41,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707281570] [2020-10-23 20:28:41,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 20:28:41,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:41,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 20:28:41,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-23 20:28:41,624 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 6 states. [2020-10-23 20:28:41,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:41,969 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-10-23 20:28:41,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 20:28:41,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-10-23 20:28:41,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:41,983 INFO L225 Difference]: With dead ends: 52 [2020-10-23 20:28:41,983 INFO L226 Difference]: Without dead ends: 34 [2020-10-23 20:28:41,987 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:28:42,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-23 20:28:42,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-10-23 20:28:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-23 20:28:42,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2020-10-23 20:28:42,049 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 27 [2020-10-23 20:28:42,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:42,050 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2020-10-23 20:28:42,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 20:28:42,050 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-10-23 20:28:42,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-23 20:28:42,053 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:42,053 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:42,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 20:28:42,054 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:42,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:42,055 INFO L82 PathProgramCache]: Analyzing trace with hash 653425116, now seen corresponding path program 1 times [2020-10-23 20:28:42,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:42,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1956529809] [2020-10-23 20:28:42,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:42,059 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:42,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:42,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:42,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:42,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-23 20:28:42,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1956529809] [2020-10-23 20:28:42,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:42,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 20:28:42,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396631943] [2020-10-23 20:28:42,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 20:28:42,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:42,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 20:28:42,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-23 20:28:42,250 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 7 states. [2020-10-23 20:28:42,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:42,540 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-10-23 20:28:42,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-23 20:28:42,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-10-23 20:28:42,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:42,543 INFO L225 Difference]: With dead ends: 46 [2020-10-23 20:28:42,543 INFO L226 Difference]: Without dead ends: 39 [2020-10-23 20:28:42,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:28:42,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-23 20:28:42,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-10-23 20:28:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-23 20:28:42,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-10-23 20:28:42,559 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2020-10-23 20:28:42,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:42,560 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-10-23 20:28:42,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 20:28:42,560 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-10-23 20:28:42,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-23 20:28:42,562 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:42,562 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:42,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 20:28:42,563 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:42,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:42,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1221623283, now seen corresponding path program 2 times [2020-10-23 20:28:42,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:42,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [770173434] [2020-10-23 20:28:42,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:42,567 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:42,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:42,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:42,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:42,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-23 20:28:42,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [770173434] [2020-10-23 20:28:42,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:42,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 20:28:42,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087792141] [2020-10-23 20:28:42,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 20:28:42,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:42,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 20:28:42,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-23 20:28:42,741 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 8 states. [2020-10-23 20:28:43,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:43,021 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-10-23 20:28:43,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 20:28:43,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-10-23 20:28:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:43,024 INFO L225 Difference]: With dead ends: 51 [2020-10-23 20:28:43,024 INFO L226 Difference]: Without dead ends: 44 [2020-10-23 20:28:43,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-23 20:28:43,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-10-23 20:28:43,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-10-23 20:28:43,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-23 20:28:43,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2020-10-23 20:28:43,039 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 45 [2020-10-23 20:28:43,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:43,039 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2020-10-23 20:28:43,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 20:28:43,040 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-10-23 20:28:43,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-10-23 20:28:43,042 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:43,042 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:43,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 20:28:43,043 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:43,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:43,043 INFO L82 PathProgramCache]: Analyzing trace with hash 942298982, now seen corresponding path program 3 times [2020-10-23 20:28:43,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:43,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1048160159] [2020-10-23 20:28:43,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:43,047 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-10-23 20:28:43,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1048160159] [2020-10-23 20:28:43,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:43,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 20:28:43,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70126099] [2020-10-23 20:28:43,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 20:28:43,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:43,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 20:28:43,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:28:43,264 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 9 states. [2020-10-23 20:28:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:43,596 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-10-23 20:28:43,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 20:28:43,596 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-10-23 20:28:43,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:43,598 INFO L225 Difference]: With dead ends: 56 [2020-10-23 20:28:43,598 INFO L226 Difference]: Without dead ends: 49 [2020-10-23 20:28:43,599 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-10-23 20:28:43,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-10-23 20:28:43,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-10-23 20:28:43,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-10-23 20:28:43,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2020-10-23 20:28:43,613 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 54 [2020-10-23 20:28:43,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:43,613 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2020-10-23 20:28:43,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 20:28:43,614 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2020-10-23 20:28:43,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-23 20:28:43,615 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:43,615 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:43,616 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 20:28:43,616 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:43,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:43,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1161295337, now seen corresponding path program 4 times [2020-10-23 20:28:43,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:43,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1416363117] [2020-10-23 20:28:43,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:43,620 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:43,831 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-10-23 20:28:43,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1416363117] [2020-10-23 20:28:43,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:43,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 20:28:43,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282623799] [2020-10-23 20:28:43,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 20:28:43,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:43,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 20:28:43,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-23 20:28:43,834 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 10 states. [2020-10-23 20:28:44,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:44,333 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-10-23 20:28:44,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-23 20:28:44,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-10-23 20:28:44,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:44,336 INFO L225 Difference]: With dead ends: 61 [2020-10-23 20:28:44,336 INFO L226 Difference]: Without dead ends: 54 [2020-10-23 20:28:44,337 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-10-23 20:28:44,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-10-23 20:28:44,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-10-23 20:28:44,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-23 20:28:44,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-10-23 20:28:44,352 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 63 [2020-10-23 20:28:44,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:44,352 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-10-23 20:28:44,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 20:28:44,353 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-10-23 20:28:44,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-23 20:28:44,354 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:44,354 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:44,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 20:28:44,355 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:44,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:44,355 INFO L82 PathProgramCache]: Analyzing trace with hash -2109333008, now seen corresponding path program 5 times [2020-10-23 20:28:44,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:44,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [628456238] [2020-10-23 20:28:44,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:44,360 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:44,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:44,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:44,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:44,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:44,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:44,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:44,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-23 20:28:44,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [628456238] [2020-10-23 20:28:44,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:44,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-23 20:28:44,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082379625] [2020-10-23 20:28:44,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 20:28:44,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:44,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 20:28:44,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:28:44,618 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 11 states. [2020-10-23 20:28:45,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:45,163 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-10-23 20:28:45,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-23 20:28:45,164 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-10-23 20:28:45,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:45,165 INFO L225 Difference]: With dead ends: 66 [2020-10-23 20:28:45,166 INFO L226 Difference]: Without dead ends: 59 [2020-10-23 20:28:45,167 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-10-23 20:28:45,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-23 20:28:45,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-23 20:28:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-23 20:28:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-10-23 20:28:45,183 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 72 [2020-10-23 20:28:45,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:45,183 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-10-23 20:28:45,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 20:28:45,183 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-10-23 20:28:45,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-23 20:28:45,185 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:45,185 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:45,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 20:28:45,186 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:45,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:45,186 INFO L82 PathProgramCache]: Analyzing trace with hash 639783135, now seen corresponding path program 6 times [2020-10-23 20:28:45,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:45,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1052913441] [2020-10-23 20:28:45,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:45,191 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:45,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:45,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:45,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:45,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:45,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:45,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:45,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:45,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:45,494 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-10-23 20:28:45,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1052913441] [2020-10-23 20:28:45,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:45,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 20:28:45,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864681100] [2020-10-23 20:28:45,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 20:28:45,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:45,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 20:28:45,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-23 20:28:45,497 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 12 states. [2020-10-23 20:28:46,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:46,101 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-10-23 20:28:46,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 20:28:46,102 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-10-23 20:28:46,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:46,105 INFO L225 Difference]: With dead ends: 71 [2020-10-23 20:28:46,105 INFO L226 Difference]: Without dead ends: 64 [2020-10-23 20:28:46,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-10-23 20:28:46,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-23 20:28:46,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-10-23 20:28:46,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-23 20:28:46,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2020-10-23 20:28:46,126 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 81 [2020-10-23 20:28:46,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:46,126 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2020-10-23 20:28:46,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 20:28:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2020-10-23 20:28:46,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-10-23 20:28:46,128 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:46,128 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:46,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 20:28:46,129 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:46,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:46,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1631598970, now seen corresponding path program 7 times [2020-10-23 20:28:46,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:46,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [594923860] [2020-10-23 20:28:46,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:46,135 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:46,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:46,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:46,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:46,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:46,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:46,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:46,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:46,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:46,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:46,503 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-10-23 20:28:46,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [594923860] [2020-10-23 20:28:46,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:46,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-23 20:28:46,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601652107] [2020-10-23 20:28:46,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-23 20:28:46,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:46,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-23 20:28:46,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-10-23 20:28:46,506 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 13 states. [2020-10-23 20:28:47,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:47,153 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-10-23 20:28:47,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 20:28:47,154 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-10-23 20:28:47,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:47,155 INFO L225 Difference]: With dead ends: 76 [2020-10-23 20:28:47,156 INFO L226 Difference]: Without dead ends: 69 [2020-10-23 20:28:47,157 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-10-23 20:28:47,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-10-23 20:28:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-10-23 20:28:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-23 20:28:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-10-23 20:28:47,174 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 90 [2020-10-23 20:28:47,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:47,174 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-10-23 20:28:47,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-23 20:28:47,174 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-10-23 20:28:47,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-10-23 20:28:47,176 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:47,177 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:47,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-23 20:28:47,177 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:47,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:47,178 INFO L82 PathProgramCache]: Analyzing trace with hash -440062251, now seen corresponding path program 8 times [2020-10-23 20:28:47,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:47,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [291790068] [2020-10-23 20:28:47,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:47,184 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:47,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:47,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:47,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:47,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:47,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:47,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:47,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:47,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:47,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:47,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-10-23 20:28:47,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [291790068] [2020-10-23 20:28:47,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:47,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-23 20:28:47,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811063098] [2020-10-23 20:28:47,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-23 20:28:47,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:47,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-23 20:28:47,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-10-23 20:28:47,664 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 14 states. [2020-10-23 20:28:48,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:48,385 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-10-23 20:28:48,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-23 20:28:48,385 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-10-23 20:28:48,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:48,387 INFO L225 Difference]: With dead ends: 81 [2020-10-23 20:28:48,387 INFO L226 Difference]: Without dead ends: 74 [2020-10-23 20:28:48,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-10-23 20:28:48,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-23 20:28:48,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-23 20:28:48,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-23 20:28:48,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2020-10-23 20:28:48,422 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 99 [2020-10-23 20:28:48,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:48,424 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2020-10-23 20:28:48,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-23 20:28:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2020-10-23 20:28:48,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-10-23 20:28:48,427 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:48,428 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:48,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 20:28:48,428 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:48,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:48,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1832058372, now seen corresponding path program 9 times [2020-10-23 20:28:48,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:48,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [620818742] [2020-10-23 20:28:48,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:48,438 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-23 20:28:48,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [620818742] [2020-10-23 20:28:48,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:48,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-23 20:28:48,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798549745] [2020-10-23 20:28:48,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-23 20:28:48,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:48,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-23 20:28:48,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-23 20:28:48,924 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 15 states. [2020-10-23 20:28:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:49,659 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-10-23 20:28:49,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 20:28:49,660 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-10-23 20:28:49,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:49,662 INFO L225 Difference]: With dead ends: 86 [2020-10-23 20:28:49,662 INFO L226 Difference]: Without dead ends: 79 [2020-10-23 20:28:49,663 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-10-23 20:28:49,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-23 20:28:49,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-23 20:28:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-23 20:28:49,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2020-10-23 20:28:49,695 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 108 [2020-10-23 20:28:49,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:49,695 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2020-10-23 20:28:49,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-23 20:28:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2020-10-23 20:28:49,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-10-23 20:28:49,697 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:49,697 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:49,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 20:28:49,697 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:49,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:49,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1858719797, now seen corresponding path program 10 times [2020-10-23 20:28:49,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:49,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1644448175] [2020-10-23 20:28:49,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:49,704 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:49,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:49,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:49,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:49,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:49,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:49,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:49,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:49,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-10-23 20:28:50,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1644448175] [2020-10-23 20:28:50,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:50,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-10-23 20:28:50,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058822408] [2020-10-23 20:28:50,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-23 20:28:50,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:50,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-23 20:28:50,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-10-23 20:28:50,198 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 16 states. [2020-10-23 20:28:50,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:50,965 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-10-23 20:28:50,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-23 20:28:50,966 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2020-10-23 20:28:50,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:50,968 INFO L225 Difference]: With dead ends: 91 [2020-10-23 20:28:50,968 INFO L226 Difference]: Without dead ends: 84 [2020-10-23 20:28:50,970 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=268, Invalid=544, Unknown=0, NotChecked=0, Total=812 [2020-10-23 20:28:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-23 20:28:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-10-23 20:28:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-23 20:28:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2020-10-23 20:28:51,005 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 117 [2020-10-23 20:28:51,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:51,005 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2020-10-23 20:28:51,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-23 20:28:51,006 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2020-10-23 20:28:51,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-10-23 20:28:51,007 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:51,007 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:51,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-23 20:28:51,008 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:51,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:51,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1671901298, now seen corresponding path program 11 times [2020-10-23 20:28:51,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:51,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1426344558] [2020-10-23 20:28:51,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:51,016 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:51,683 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-10-23 20:28:51,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1426344558] [2020-10-23 20:28:51,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:51,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-10-23 20:28:51,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094798235] [2020-10-23 20:28:51,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-23 20:28:51,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:51,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-23 20:28:51,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-10-23 20:28:51,687 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 17 states. [2020-10-23 20:28:52,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:52,543 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2020-10-23 20:28:52,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-23 20:28:52,544 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2020-10-23 20:28:52,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:52,546 INFO L225 Difference]: With dead ends: 96 [2020-10-23 20:28:52,546 INFO L226 Difference]: Without dead ends: 89 [2020-10-23 20:28:52,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2020-10-23 20:28:52,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-23 20:28:52,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-10-23 20:28:52,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-23 20:28:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2020-10-23 20:28:52,562 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 126 [2020-10-23 20:28:52,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:52,563 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2020-10-23 20:28:52,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-23 20:28:52,563 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2020-10-23 20:28:52,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-10-23 20:28:52,564 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:52,565 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:52,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-23 20:28:52,565 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:52,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:52,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1502940223, now seen corresponding path program 12 times [2020-10-23 20:28:52,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:52,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [729597783] [2020-10-23 20:28:52,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:52,574 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:52,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-10-23 20:28:53,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [729597783] [2020-10-23 20:28:53,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:53,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-10-23 20:28:53,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769964977] [2020-10-23 20:28:53,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-23 20:28:53,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:53,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-23 20:28:53,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-10-23 20:28:53,292 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 18 states. [2020-10-23 20:28:54,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:54,224 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2020-10-23 20:28:54,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-23 20:28:54,226 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2020-10-23 20:28:54,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:54,228 INFO L225 Difference]: With dead ends: 101 [2020-10-23 20:28:54,228 INFO L226 Difference]: Without dead ends: 94 [2020-10-23 20:28:54,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2020-10-23 20:28:54,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-10-23 20:28:54,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-10-23 20:28:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-23 20:28:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2020-10-23 20:28:54,244 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 135 [2020-10-23 20:28:54,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:54,245 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2020-10-23 20:28:54,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-23 20:28:54,245 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2020-10-23 20:28:54,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-10-23 20:28:54,247 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:54,247 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:54,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-23 20:28:54,248 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:54,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:54,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1695288856, now seen corresponding path program 13 times [2020-10-23 20:28:54,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:54,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1125431362] [2020-10-23 20:28:54,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:54,260 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:54,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-10-23 20:28:55,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1125431362] [2020-10-23 20:28:55,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:55,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-10-23 20:28:55,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767590482] [2020-10-23 20:28:55,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-23 20:28:55,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:55,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-23 20:28:55,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-10-23 20:28:55,044 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 19 states. [2020-10-23 20:28:56,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:56,050 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2020-10-23 20:28:56,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-23 20:28:56,050 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2020-10-23 20:28:56,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:56,052 INFO L225 Difference]: With dead ends: 106 [2020-10-23 20:28:56,052 INFO L226 Difference]: Without dead ends: 99 [2020-10-23 20:28:56,053 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-10-23 20:28:56,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-10-23 20:28:56,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2020-10-23 20:28:56,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-10-23 20:28:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2020-10-23 20:28:56,081 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 144 [2020-10-23 20:28:56,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:56,082 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2020-10-23 20:28:56,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-23 20:28:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2020-10-23 20:28:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-10-23 20:28:56,084 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:56,084 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:56,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-23 20:28:56,085 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:56,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:56,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1916345015, now seen corresponding path program 14 times [2020-10-23 20:28:56,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:56,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [873237005] [2020-10-23 20:28:56,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:56,109 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:56,915 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-10-23 20:28:56,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [873237005] [2020-10-23 20:28:56,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:56,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-10-23 20:28:56,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836565736] [2020-10-23 20:28:56,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-23 20:28:56,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:56,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-23 20:28:56,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-10-23 20:28:56,918 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 20 states. [2020-10-23 20:28:57,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:57,959 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2020-10-23 20:28:57,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-23 20:28:57,960 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 153 [2020-10-23 20:28:57,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:57,962 INFO L225 Difference]: With dead ends: 111 [2020-10-23 20:28:57,962 INFO L226 Difference]: Without dead ends: 104 [2020-10-23 20:28:57,964 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=450, Invalid=882, Unknown=0, NotChecked=0, Total=1332 [2020-10-23 20:28:57,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-23 20:28:57,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-10-23 20:28:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-23 20:28:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2020-10-23 20:28:57,991 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 153 [2020-10-23 20:28:57,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:57,995 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2020-10-23 20:28:57,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-23 20:28:57,995 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2020-10-23 20:28:57,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-10-23 20:28:57,997 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:57,998 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:28:57,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-23 20:28:57,998 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:57,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:57,999 INFO L82 PathProgramCache]: Analyzing trace with hash -540599902, now seen corresponding path program 15 times [2020-10-23 20:28:57,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:57,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [265501433] [2020-10-23 20:28:57,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:58,011 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:58,893 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-10-23 20:28:58,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [265501433] [2020-10-23 20:28:58,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:58,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-10-23 20:28:58,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853809558] [2020-10-23 20:28:58,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-23 20:28:58,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:58,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-23 20:28:58,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2020-10-23 20:28:58,896 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 21 states. [2020-10-23 20:29:00,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:29:00,004 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2020-10-23 20:29:00,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-23 20:29:00,005 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 162 [2020-10-23 20:29:00,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:29:00,006 INFO L225 Difference]: With dead ends: 116 [2020-10-23 20:29:00,006 INFO L226 Difference]: Without dead ends: 109 [2020-10-23 20:29:00,008 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=503, Invalid=979, Unknown=0, NotChecked=0, Total=1482 [2020-10-23 20:29:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-23 20:29:00,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-10-23 20:29:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-23 20:29:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2020-10-23 20:29:00,022 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 162 [2020-10-23 20:29:00,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:29:00,022 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2020-10-23 20:29:00,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-23 20:29:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2020-10-23 20:29:00,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-10-23 20:29:00,025 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:29:00,025 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:29:00,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-23 20:29:00,025 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:29:00,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:29:00,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1851147437, now seen corresponding path program 16 times [2020-10-23 20:29:00,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:29:00,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1517064938] [2020-10-23 20:29:00,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:29:00,031 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:29:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:29:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:29:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:00,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:01,032 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-10-23 20:29:01,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1517064938] [2020-10-23 20:29:01,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:29:01,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-10-23 20:29:01,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927644049] [2020-10-23 20:29:01,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-23 20:29:01,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:29:01,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-23 20:29:01,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2020-10-23 20:29:01,035 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 22 states. [2020-10-23 20:29:02,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:29:02,165 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2020-10-23 20:29:02,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-23 20:29:02,166 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 171 [2020-10-23 20:29:02,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:29:02,168 INFO L225 Difference]: With dead ends: 121 [2020-10-23 20:29:02,168 INFO L226 Difference]: Without dead ends: 114 [2020-10-23 20:29:02,169 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=559, Invalid=1081, Unknown=0, NotChecked=0, Total=1640 [2020-10-23 20:29:02,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-10-23 20:29:02,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2020-10-23 20:29:02,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-23 20:29:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2020-10-23 20:29:02,184 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 171 [2020-10-23 20:29:02,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:29:02,184 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2020-10-23 20:29:02,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-23 20:29:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2020-10-23 20:29:02,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-10-23 20:29:02,186 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:29:02,187 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:29:02,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-23 20:29:02,187 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:29:02,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:29:02,188 INFO L82 PathProgramCache]: Analyzing trace with hash -383495636, now seen corresponding path program 17 times [2020-10-23 20:29:02,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:29:02,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [785958625] [2020-10-23 20:29:02,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:29:02,193 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:29:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:29:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:29:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:02,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-10-23 20:29:03,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [785958625] [2020-10-23 20:29:03,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:29:03,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-10-23 20:29:03,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626057848] [2020-10-23 20:29:03,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-23 20:29:03,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:29:03,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-23 20:29:03,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2020-10-23 20:29:03,186 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 23 states. [2020-10-23 20:29:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:29:04,377 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2020-10-23 20:29:04,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-23 20:29:04,377 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 180 [2020-10-23 20:29:04,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:29:04,379 INFO L225 Difference]: With dead ends: 126 [2020-10-23 20:29:04,379 INFO L226 Difference]: Without dead ends: 119 [2020-10-23 20:29:04,380 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=618, Invalid=1188, Unknown=0, NotChecked=0, Total=1806 [2020-10-23 20:29:04,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-10-23 20:29:04,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2020-10-23 20:29:04,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-23 20:29:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2020-10-23 20:29:04,399 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 180 [2020-10-23 20:29:04,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:29:04,400 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2020-10-23 20:29:04,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-23 20:29:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2020-10-23 20:29:04,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-10-23 20:29:04,403 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:29:04,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-10-23 20:29:04,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-23 20:29:04,404 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:29:04,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:29:04,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1621618269, now seen corresponding path program 18 times [2020-10-23 20:29:04,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:29:04,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1183122739] [2020-10-23 20:29:04,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:29:04,413 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:29:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:04,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:29:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:04,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:29:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:04,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:04,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:04,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:04,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:04,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:04,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:04,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:04,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:04,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:04,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:04,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-10-23 20:29:05,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1183122739] [2020-10-23 20:29:05,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:29:05,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-10-23 20:29:05,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496373971] [2020-10-23 20:29:05,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-23 20:29:05,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:29:05,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-23 20:29:05,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2020-10-23 20:29:05,443 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 24 states. [2020-10-23 20:29:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:29:06,822 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2020-10-23 20:29:06,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-23 20:29:06,823 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 189 [2020-10-23 20:29:06,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:29:06,825 INFO L225 Difference]: With dead ends: 131 [2020-10-23 20:29:06,826 INFO L226 Difference]: Without dead ends: 124 [2020-10-23 20:29:06,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=680, Invalid=1300, Unknown=0, NotChecked=0, Total=1980 [2020-10-23 20:29:06,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-10-23 20:29:06,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2020-10-23 20:29:06,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-10-23 20:29:06,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2020-10-23 20:29:06,842 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 189 [2020-10-23 20:29:06,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:29:06,842 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2020-10-23 20:29:06,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-23 20:29:06,843 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2020-10-23 20:29:06,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-10-23 20:29:06,845 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:29:06,845 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:29:06,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-23 20:29:06,846 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:29:06,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:29:06,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1138628534, now seen corresponding path program 19 times [2020-10-23 20:29:06,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:29:06,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [478549863] [2020-10-23 20:29:06,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:29:06,852 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:29:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:06,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:29:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:06,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:29:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:07,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:08,033 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-10-23 20:29:08,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [478549863] [2020-10-23 20:29:08,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:29:08,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-10-23 20:29:08,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298662385] [2020-10-23 20:29:08,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-23 20:29:08,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:29:08,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-23 20:29:08,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=363, Unknown=0, NotChecked=0, Total=600 [2020-10-23 20:29:08,036 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 25 states. [2020-10-23 20:29:09,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:29:09,466 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2020-10-23 20:29:09,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-23 20:29:09,467 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 198 [2020-10-23 20:29:09,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:29:09,469 INFO L225 Difference]: With dead ends: 136 [2020-10-23 20:29:09,469 INFO L226 Difference]: Without dead ends: 129 [2020-10-23 20:29:09,471 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-10-23 20:29:09,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-10-23 20:29:09,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2020-10-23 20:29:09,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-10-23 20:29:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2020-10-23 20:29:09,487 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 198 [2020-10-23 20:29:09,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:29:09,487 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2020-10-23 20:29:09,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-23 20:29:09,488 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2020-10-23 20:29:09,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-10-23 20:29:09,490 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:29:09,490 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:29:09,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-23 20:29:09,491 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:29:09,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:29:09,491 INFO L82 PathProgramCache]: Analyzing trace with hash -223075943, now seen corresponding path program 20 times [2020-10-23 20:29:09,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:29:09,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1404351710] [2020-10-23 20:29:09,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:29:09,496 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:29:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:09,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:29:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:09,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:29:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:09,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:09,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:10,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:10,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:10,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:10,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:10,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:10,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:10,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:10,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:11,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:11,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:11,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:11,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:11,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:11,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:11,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:11,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:12,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:12,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:29:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:29:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2020-10-23 20:29:12,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1404351710] [2020-10-23 20:29:12,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:29:12,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2020-10-23 20:29:12,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912507142] [2020-10-23 20:29:12,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 52 states [2020-10-23 20:29:12,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:29:12,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2020-10-23 20:29:12,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=2165, Unknown=0, NotChecked=0, Total=2652 [2020-10-23 20:29:12,991 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 52 states. [2020-10-23 20:29:18,983 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-10-23 20:29:24,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:29:24,034 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2020-10-23 20:29:24,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2020-10-23 20:29:24,034 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 207 [2020-10-23 20:29:24,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:29:24,035 INFO L225 Difference]: With dead ends: 129 [2020-10-23 20:29:24,036 INFO L226 Difference]: Without dead ends: 0 [2020-10-23 20:29:24,041 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2087 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=2930, Invalid=11832, Unknown=0, NotChecked=0, Total=14762 [2020-10-23 20:29:24,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-23 20:29:24,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-23 20:29:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-23 20:29:24,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-23 20:29:24,042 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2020-10-23 20:29:24,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:29:24,042 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-23 20:29:24,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2020-10-23 20:29:24,042 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-23 20:29:24,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-23 20:29:24,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-23 20:29:24,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-23 20:29:26,217 WARN L193 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 173 DAG size of output: 131 [2020-10-23 20:29:27,555 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 151 DAG size of output: 109 [2020-10-23 20:29:28,805 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 151 DAG size of output: 109 [2020-10-23 20:29:30,453 WARN L193 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 157 DAG size of output: 115 [2020-10-23 20:29:31,941 WARN L193 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 157 DAG size of output: 115 [2020-10-23 20:29:32,126 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-23 20:29:32,126 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-23 20:29:32,126 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-23 20:29:32,126 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-23 20:29:32,127 INFO L277 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-10-23 20:29:32,127 INFO L277 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-10-23 20:29:32,127 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:29:32,127 INFO L277 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-10-23 20:29:32,127 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-23 20:29:32,128 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-10-23 20:29:32,128 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-23 20:29:32,130 INFO L277 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-10-23 20:29:32,130 INFO L277 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-10-23 20:29:32,130 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:29:32,130 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:29:32,130 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:29:32,130 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-23 20:29:32,130 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-23 20:29:32,131 INFO L270 CegarLoopResult]: At program point sumEXIT(lines 5 11) the Hoare annotation is: (and (let ((.cse2 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse1 (<= |sum_#res| .cse2)) (.cse0 (= sum_~m |sum_#in~m|))) (or (and .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| 2) |sum_#res|) (<= |sum_#in~n| 2) .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 (<= (+ |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~m| 6) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6)) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= (+ |sum_#in~m| 5) |sum_#res|)) (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 .cse0 (<= |sum_#in~n| 3) .cse1 (<= (+ |sum_#in~m| 3) |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_#res| |sum_#in~m|) .cse0 (<= .cse2 |sum_#res|))))) (let ((.cse3 (= sum_~n |sum_#in~n|))) (or (and .cse3 (<= |sum_#in~n| 19)) (and .cse3 (<= (+ |sum_#in~m| 20) |sum_#res|))))) [2020-10-23 20:29:32,131 INFO L270 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (<= 1 sum_~n) (= sum_~m |sum_#in~m|)) [2020-10-23 20:29:32,132 INFO L270 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (let ((.cse0 (= sum_~n |sum_#in~n|)) (.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (<= |sum_#t~ret7| (+ |sum_#in~n| |sum_#in~m|)))) (or (and .cse0 .cse1 (<= |sum_#in~n| 6) (<= (+ |sum_#in~m| 6) |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~m| 16) |sum_#t~ret7|) (<= |sum_#in~n| 16) .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 (<= (+ |sum_#in~m| 3) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 3) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 8) (<= (+ |sum_#in~m| 8) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 11) .cse2 (<= (+ |sum_#in~m| 11) |sum_#t~ret7|)) (and .cse0 (<= |sum_#in~n| 17) .cse1 (<= (+ |sum_#in~m| 17) |sum_#t~ret7|) .cse2) (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 .cse1 (<= (+ |sum_#in~m| 20) |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~n| 12) (<= (+ |sum_#in~m| 12) |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~n| 19) .cse1 (<= (+ |sum_#in~m| 19) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 14) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 14) .cse2))) [2020-10-23 20:29:32,132 INFO L270 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|) (<= sum_~n 0)) [2020-10-23 20:29:32,132 INFO L270 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: (let ((.cse0 (= sum_~n |sum_#in~n|)) (.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (<= |sum_#t~ret7| (+ |sum_#in~n| |sum_#in~m|)))) (or (and .cse0 .cse1 (<= |sum_#in~n| 6) (<= (+ |sum_#in~m| 6) |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~m| 16) |sum_#t~ret7|) (<= |sum_#in~n| 16) .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 (<= (+ |sum_#in~m| 3) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 3) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 8) (<= (+ |sum_#in~m| 8) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 11) .cse2 (<= (+ |sum_#in~m| 11) |sum_#t~ret7|)) (and .cse0 (<= |sum_#in~n| 17) .cse1 (<= (+ |sum_#in~m| 17) |sum_#t~ret7|) .cse2) (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 .cse1 (<= (+ |sum_#in~m| 20) |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~n| 12) (<= (+ |sum_#in~m| 12) |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~n| 19) .cse1 (<= (+ |sum_#in~m| 19) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 14) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 14) .cse2))) [2020-10-23 20:29:32,133 INFO L270 CegarLoopResult]: At program point L6(lines 6 10) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|)) [2020-10-23 20:29:32,133 INFO L270 CegarLoopResult]: At program point L9-3(line 9) the Hoare annotation is: (let ((.cse24 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~n |sum_#in~n|)) (.cse2 (= sum_~m |sum_#in~m|)) (.cse3 (<= |sum_#res| .cse24)) (.cse4 (<= |sum_#t~ret7| .cse24))) (or (let ((.cse1 (+ |sum_#in~m| 1))) (and .cse0 (<= .cse1 |sum_#t~ret7|) (<= .cse1 |sum_#res|) .cse2 (<= |sum_#in~n| 1) .cse3 .cse4)) (let ((.cse5 (+ |sum_#in~m| 3))) (and .cse0 (<= .cse5 |sum_#t~ret7|) .cse2 (<= |sum_#in~n| 3) .cse3 (<= .cse5 |sum_#res|) .cse4)) (let ((.cse6 (+ |sum_#in~m| 18))) (and .cse0 (<= .cse6 |sum_#res|) (<= .cse6 |sum_#t~ret7|) .cse2 .cse3 (<= |sum_#in~n| 18) .cse4)) (let ((.cse7 (+ |sum_#in~m| 16))) (and .cse0 (<= .cse7 |sum_#res|) .cse2 .cse3 (<= .cse7 |sum_#t~ret7|) (<= |sum_#in~n| 16) .cse4)) (let ((.cse8 (+ |sum_#in~m| 17))) (and .cse0 (<= |sum_#in~n| 17) .cse2 .cse3 (<= .cse8 |sum_#t~ret7|) .cse4 (<= .cse8 |sum_#res|))) (let ((.cse9 (+ |sum_#in~m| 7))) (and .cse0 .cse2 (<= .cse9 |sum_#res|) (<= |sum_#in~n| 7) .cse3 (<= .cse9 |sum_#t~ret7|) .cse4)) (let ((.cse10 (+ |sum_#in~m| 11))) (and .cse0 (<= .cse10 |sum_#res|) .cse2 .cse3 (<= |sum_#in~n| 11) .cse4 (<= .cse10 |sum_#t~ret7|))) (let ((.cse11 (+ |sum_#in~m| 13))) (and .cse0 .cse2 (<= .cse11 |sum_#t~ret7|) (<= |sum_#in~n| 13) .cse3 (<= .cse11 |sum_#res|) .cse4)) (let ((.cse12 (+ |sum_#in~m| 19))) (and .cse0 (<= |sum_#in~n| 19) .cse2 (<= .cse12 |sum_#t~ret7|) .cse3 (<= .cse12 |sum_#res|) .cse4)) (let ((.cse13 (+ |sum_#in~m| 4))) (and .cse0 (<= .cse13 |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse2 .cse3 (<= .cse13 |sum_#res|) .cse4)) (let ((.cse14 (+ |sum_#in~m| 8))) (and .cse0 .cse2 (<= |sum_#in~n| 8) .cse3 (<= .cse14 |sum_#res|) (<= .cse14 |sum_#t~ret7|) .cse4)) (let ((.cse15 (+ |sum_#in~m| 12))) (and .cse0 .cse2 .cse3 (<= |sum_#in~n| 12) (<= .cse15 |sum_#t~ret7|) .cse4 (<= .cse15 |sum_#res|))) (let ((.cse16 (+ |sum_#in~m| 6))) (and .cse0 (<= .cse16 |sum_#res|) .cse2 .cse3 (<= |sum_#in~n| 6) (<= .cse16 |sum_#t~ret7|) .cse4)) (let ((.cse17 (+ |sum_#in~m| 14))) (and .cse0 (<= .cse17 |sum_#t~ret7|) (<= .cse17 |sum_#res|) .cse2 (<= |sum_#in~n| 14) .cse3 .cse4)) (let ((.cse18 (+ |sum_#in~m| 10))) (and .cse0 (<= .cse18 |sum_#res|) .cse2 .cse3 (<= .cse18 |sum_#t~ret7|) .cse4 (<= |sum_#in~n| 10))) (let ((.cse19 (+ |sum_#in~m| 5))) (and .cse0 (<= |sum_#in~n| 5) .cse2 .cse3 (<= .cse19 |sum_#t~ret7|) (<= .cse19 |sum_#res|) .cse4)) (let ((.cse20 (+ |sum_#in~m| 20))) (and .cse0 .cse2 .cse3 (<= .cse20 |sum_#t~ret7|) (<= .cse20 |sum_#res|) .cse4)) (let ((.cse21 (+ |sum_#in~m| 2))) (and .cse0 (<= .cse21 |sum_#res|) (<= |sum_#in~n| 2) .cse2 .cse3 .cse4 (<= .cse21 |sum_#t~ret7|))) (let ((.cse22 (+ |sum_#in~m| 9))) (and .cse0 .cse2 .cse3 (<= .cse22 |sum_#res|) (<= .cse22 |sum_#t~ret7|) (<= |sum_#in~n| 9) .cse4)) (let ((.cse23 (+ |sum_#in~m| 15))) (and .cse0 (<= .cse23 |sum_#res|) .cse2 .cse3 (<= |sum_#in~n| 15) .cse4 (<= .cse23 |sum_#t~ret7|)))))) [2020-10-23 20:29:32,134 INFO L270 CegarLoopResult]: At program point L5(lines 5 11) the Hoare annotation is: (= sum_~n |sum_#in~n|) [2020-10-23 20:29:32,134 INFO L270 CegarLoopResult]: At program point sumFINAL(lines 5 11) the Hoare annotation is: (and (let ((.cse2 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse1 (<= |sum_#res| .cse2)) (.cse0 (= sum_~m |sum_#in~m|))) (or (and .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| 2) |sum_#res|) (<= |sum_#in~n| 2) .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 (<= (+ |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~m| 6) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6)) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= (+ |sum_#in~m| 5) |sum_#res|)) (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 .cse0 (<= |sum_#in~n| 3) .cse1 (<= (+ |sum_#in~m| 3) |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_#res| |sum_#in~m|) .cse0 (<= .cse2 |sum_#res|))))) (let ((.cse3 (= sum_~n |sum_#in~n|))) (or (and .cse3 (<= |sum_#in~n| 19)) (and .cse3 (<= (+ |sum_#in~m| 20) |sum_#res|))))) [2020-10-23 20:29:32,134 INFO L277 CegarLoopResult]: At program point sumENTRY(lines 5 11) the Hoare annotation is: true [2020-10-23 20:29:32,134 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 13 20) the Hoare annotation is: true [2020-10-23 20:29:32,135 INFO L270 CegarLoopResult]: At program point mainEXIT(lines 13 20) the Hoare annotation is: (<= 20 main_~a~0) [2020-10-23 20:29:32,135 INFO L270 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: false [2020-10-23 20:29:32,135 INFO L270 CegarLoopResult]: At program point L17(lines 17 19) the Hoare annotation is: (and (<= main_~a~0 main_~result~0) (<= main_~a~0 20) (<= 20 main_~a~0) (<= main_~result~0 main_~a~0) (= main_~b~0 0)) [2020-10-23 20:29:32,135 INFO L270 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: false [2020-10-23 20:29:32,135 INFO L270 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= main_~a~0 20) (<= 20 main_~a~0) (= main_~b~0 0)) [2020-10-23 20:29:32,136 INFO L270 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (<= main_~a~0 20) (<= 20 main_~a~0)) [2020-10-23 20:29:32,136 INFO L270 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (and (<= |main_#t~ret8| main_~a~0) (<= main_~a~0 20) (<= main_~a~0 |main_#t~ret8|) (<= 20 main_~a~0) (= main_~b~0 0)) [2020-10-23 20:29:32,136 INFO L270 CegarLoopResult]: At program point L17-2(lines 13 20) the Hoare annotation is: (<= 20 main_~a~0) [2020-10-23 20:29:32,136 INFO L270 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (and (<= |main_#t~ret8| main_~a~0) (<= main_~a~0 20) (<= main_~a~0 |main_#t~ret8|) (<= 20 main_~a~0) (= main_~b~0 0)) [2020-10-23 20:29:32,136 INFO L270 CegarLoopResult]: At program point L16-3(line 16) the Hoare annotation is: (and (<= |main_#t~ret8| main_~a~0) (<= main_~a~0 main_~result~0) (<= main_~a~0 20) (<= main_~a~0 |main_#t~ret8|) (<= 20 main_~a~0) (<= main_~result~0 main_~a~0) (= main_~b~0 0)) [2020-10-23 20:29:32,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:29:32 BoogieIcfgContainer [2020-10-23 20:29:32,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 20:29:32,176 INFO L168 Benchmark]: Toolchain (without parser) took 51956.32 ms. Allocated memory was 158.3 MB in the beginning and 574.6 MB in the end (delta: 416.3 MB). Free memory was 135.5 MB in the beginning and 421.6 MB in the end (delta: -286.1 MB). Peak memory consumption was 341.9 MB. Max. memory is 8.0 GB. [2020-10-23 20:29:32,177 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 158.3 MB. Free memory was 132.9 MB in the beginning and 132.9 MB in the end (delta: 80.1 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 20:29:32,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.61 ms. Allocated memory is still 158.3 MB. Free memory was 134.9 MB in the beginning and 125.9 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-23 20:29:32,178 INFO L168 Benchmark]: Boogie Preprocessor took 31.75 ms. Allocated memory is still 158.3 MB. Free memory was 125.9 MB in the beginning and 124.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-23 20:29:32,178 INFO L168 Benchmark]: RCFGBuilder took 325.13 ms. Allocated memory is still 158.3 MB. Free memory was 124.5 MB in the beginning and 111.5 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-10-23 20:29:32,179 INFO L168 Benchmark]: TraceAbstraction took 51356.82 ms. Allocated memory was 158.3 MB in the beginning and 574.6 MB in the end (delta: 416.3 MB). Free memory was 111.1 MB in the beginning and 421.6 MB in the end (delta: -310.5 MB). Peak memory consumption was 317.8 MB. Max. memory is 8.0 GB. [2020-10-23 20:29:32,182 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.24 ms. Allocated memory is still 158.3 MB. Free memory was 132.9 MB in the beginning and 132.9 MB in the end (delta: 80.1 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 231.61 ms. Allocated memory is still 158.3 MB. Free memory was 134.9 MB in the beginning and 125.9 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 31.75 ms. Allocated memory is still 158.3 MB. Free memory was 125.9 MB in the beginning and 124.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 325.13 ms. Allocated memory is still 158.3 MB. Free memory was 124.5 MB in the beginning and 111.5 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 51356.82 ms. Allocated memory was 158.3 MB in the beginning and 574.6 MB in the end (delta: 416.3 MB). Free memory was 111.1 MB in the beginning and 421.6 MB in the end (delta: -310.5 MB). Peak memory consumption was 317.8 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: (((((((((((((((((((((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) + 2 <= \result && \old(n) <= 2) && 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)) || (((\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(m) + 6 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 6)) || (((\old(n) <= 5 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 5 <= \result)) || (((\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)) || (((m == \old(m) && \old(n) <= 3) && \result <= \old(n) + \old(m)) && \old(m) + 3 <= \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)) || ((\result <= \old(m) && m == \old(m)) && \old(n) + \old(m) <= \result)) && ((n == \old(n) && \old(n) <= 19) || (n == \old(n) && \old(m) + 20 <= \result)) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 20 <= a - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 43.0s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 27.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 603 SDtfs, 2190 SDslu, 1356 SDs, 0 SdLazy, 3538 SolverSat, 643 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1164 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 640 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5167 ImplicationChecksByTransitivity, 25.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 129 PreInvPairs, 429 NumberOfFragments, 2271 HoareAnnotationTreeSize, 129 FomulaSimplifications, 5998 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 39 FomulaSimplificationsInter, 8387 FormulaSimplificationTreeSizeReductionInter, 7.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...