/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_15x0-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 20:28:10,976 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 20:28:10,979 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 20:28:11,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 20:28:11,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 20:28:11,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 20:28:11,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 20:28:11,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 20:28:11,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 20:28:11,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 20:28:11,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 20:28:11,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 20:28:11,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 20:28:11,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 20:28:11,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 20:28:11,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 20:28:11,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 20:28:11,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 20:28:11,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 20:28:11,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 20:28:11,106 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 20:28:11,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 20:28:11,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 20:28:11,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 20:28:11,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 20:28:11,120 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 20:28:11,120 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 20:28:11,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 20:28:11,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 20:28:11,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 20:28:11,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 20:28:11,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 20:28:11,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 20:28:11,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 20:28:11,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 20:28:11,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 20:28:11,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 20:28:11,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 20:28:11,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 20:28:11,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 20:28:11,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 20:28:11,136 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:11,161 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 20:28:11,161 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 20:28:11,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 20:28:11,167 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 20:28:11,167 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 20:28:11,167 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 20:28:11,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 20:28:11,167 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 20:28:11,168 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 20:28:11,168 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 20:28:11,169 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 20:28:11,169 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 20:28:11,170 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 20:28:11,170 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 20:28:11,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 20:28:11,171 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-23 20:28:11,171 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 20:28:11,171 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 20:28:11,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 20:28:11,171 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 20:28:11,172 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-23 20:28:11,172 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 20:28:11,172 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:11,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 20:28:11,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 20:28:11,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 20:28:11,672 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 20:28:11,673 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 20:28:11,674 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_15x0-1.c [2020-10-23 20:28:11,759 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/126f0c9a6/477fb93ee1164a08a644f8833561d42c/FLAGc4aafecac [2020-10-23 20:28:12,472 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 20:28:12,473 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_15x0-1.c [2020-10-23 20:28:12,480 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/126f0c9a6/477fb93ee1164a08a644f8833561d42c/FLAGc4aafecac [2020-10-23 20:28:12,848 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/126f0c9a6/477fb93ee1164a08a644f8833561d42c [2020-10-23 20:28:12,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 20:28:12,860 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 20:28:12,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 20:28:12,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 20:28:12,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 20:28:12,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:28:12" (1/1) ... [2020-10-23 20:28:12,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a320c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:12, skipping insertion in model container [2020-10-23 20:28:12,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:28:12" (1/1) ... [2020-10-23 20:28:12,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 20:28:12,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 20:28:13,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:28:13,063 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 20:28:13,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:28:13,097 INFO L208 MainTranslator]: Completed translation [2020-10-23 20:28:13,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:13 WrapperNode [2020-10-23 20:28:13,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 20:28:13,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 20:28:13,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 20:28:13,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 20:28:13,114 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:13" (1/1) ... [2020-10-23 20:28:13,115 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:13" (1/1) ... [2020-10-23 20:28:13,123 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:13" (1/1) ... [2020-10-23 20:28:13,123 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:13" (1/1) ... [2020-10-23 20:28:13,129 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:13" (1/1) ... [2020-10-23 20:28:13,131 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:13" (1/1) ... [2020-10-23 20:28:13,133 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:13" (1/1) ... [2020-10-23 20:28:13,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 20:28:13,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 20:28:13,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 20:28:13,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 20:28:13,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:13" (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:13,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 20:28:13,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 20:28:13,222 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 20:28:13,222 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-10-23 20:28:13,222 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 20:28:13,222 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 20:28:13,223 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 20:28:13,223 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 20:28:13,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 20:28:13,223 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-10-23 20:28:13,224 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 20:28:13,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 20:28:13,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 20:28:13,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 20:28:13,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 20:28:13,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 20:28:13,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 20:28:13,613 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 20:28:13,613 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-23 20:28:13,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:28:13 BoogieIcfgContainer [2020-10-23 20:28:13,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 20:28:13,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 20:28:13,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 20:28:13,622 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 20:28:13,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:28:12" (1/3) ... [2020-10-23 20:28:13,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56243281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:28:13, skipping insertion in model container [2020-10-23 20:28:13,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:28:13" (2/3) ... [2020-10-23 20:28:13,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56243281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:28:13, skipping insertion in model container [2020-10-23 20:28:13,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:28:13" (3/3) ... [2020-10-23 20:28:13,626 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_15x0-1.c [2020-10-23 20:28:13,641 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-23 20:28:13,649 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 20:28:13,676 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 20:28:13,743 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 20:28:13,743 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 20:28:13,743 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-10-23 20:28:13,743 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 20:28:13,744 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 20:28:13,744 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 20:28:13,744 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 20:28:13,744 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 20:28:13,761 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-10-23 20:28:13,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-23 20:28:13,771 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:13,772 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:13,773 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:13,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:13,780 INFO L82 PathProgramCache]: Analyzing trace with hash -342472451, now seen corresponding path program 1 times [2020-10-23 20:28:13,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:13,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1351670034] [2020-10-23 20:28:13,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:13,876 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:14,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:14,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:14,306 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:14,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1351670034] [2020-10-23 20:28:14,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:14,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 20:28:14,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708537078] [2020-10-23 20:28:14,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 20:28:14,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:14,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 20:28:14,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-23 20:28:14,340 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 6 states. [2020-10-23 20:28:14,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:14,628 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-10-23 20:28:14,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 20:28:14,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-10-23 20:28:14,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:14,641 INFO L225 Difference]: With dead ends: 52 [2020-10-23 20:28:14,642 INFO L226 Difference]: Without dead ends: 34 [2020-10-23 20:28:14,646 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:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-23 20:28:14,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-10-23 20:28:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-23 20:28:14,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2020-10-23 20:28:14,706 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 27 [2020-10-23 20:28:14,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:14,707 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2020-10-23 20:28:14,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 20:28:14,707 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-10-23 20:28:14,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-23 20:28:14,709 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:14,710 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:14,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 20:28:14,710 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:14,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:14,711 INFO L82 PathProgramCache]: Analyzing trace with hash 653425116, now seen corresponding path program 1 times [2020-10-23 20:28:14,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:14,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1764345464] [2020-10-23 20:28:14,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:14,716 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:14,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:14,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:14,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:15,035 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:15,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1764345464] [2020-10-23 20:28:15,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:15,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 20:28:15,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115440808] [2020-10-23 20:28:15,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 20:28:15,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:15,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 20:28:15,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-23 20:28:15,039 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 7 states. [2020-10-23 20:28:15,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:15,292 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-10-23 20:28:15,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-23 20:28:15,293 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-10-23 20:28:15,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:15,296 INFO L225 Difference]: With dead ends: 46 [2020-10-23 20:28:15,296 INFO L226 Difference]: Without dead ends: 39 [2020-10-23 20:28:15,298 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:28:15,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-23 20:28:15,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-10-23 20:28:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-23 20:28:15,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-10-23 20:28:15,320 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2020-10-23 20:28:15,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:15,321 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-10-23 20:28:15,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 20:28:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-10-23 20:28:15,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-23 20:28:15,325 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:15,325 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:15,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 20:28:15,326 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:15,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:15,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1221623283, now seen corresponding path program 2 times [2020-10-23 20:28:15,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:15,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1534345812] [2020-10-23 20:28:15,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:15,338 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:15,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:15,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:15,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:15,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:15,521 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:15,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1534345812] [2020-10-23 20:28:15,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:15,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 20:28:15,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464351683] [2020-10-23 20:28:15,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 20:28:15,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:15,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 20:28:15,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-23 20:28:15,524 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 8 states. [2020-10-23 20:28:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:15,827 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-10-23 20:28:15,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 20:28:15,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-10-23 20:28:15,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:15,830 INFO L225 Difference]: With dead ends: 51 [2020-10-23 20:28:15,830 INFO L226 Difference]: Without dead ends: 44 [2020-10-23 20:28:15,831 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:15,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-10-23 20:28:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-10-23 20:28:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-23 20:28:15,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2020-10-23 20:28:15,845 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 45 [2020-10-23 20:28:15,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:15,846 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2020-10-23 20:28:15,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 20:28:15,846 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-10-23 20:28:15,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-10-23 20:28:15,848 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:15,848 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:15,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 20:28:15,849 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:15,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:15,849 INFO L82 PathProgramCache]: Analyzing trace with hash 942298982, now seen corresponding path program 3 times [2020-10-23 20:28:15,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:15,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1069199927] [2020-10-23 20:28:15,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:15,853 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:15,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:15,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:15,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:16,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:16,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:16,061 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:16,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1069199927] [2020-10-23 20:28:16,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:16,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 20:28:16,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533774052] [2020-10-23 20:28:16,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 20:28:16,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:16,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 20:28:16,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:28:16,064 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 9 states. [2020-10-23 20:28:16,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:16,437 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-10-23 20:28:16,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 20:28:16,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-10-23 20:28:16,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:16,439 INFO L225 Difference]: With dead ends: 56 [2020-10-23 20:28:16,439 INFO L226 Difference]: Without dead ends: 49 [2020-10-23 20:28:16,440 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:16,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-10-23 20:28:16,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-10-23 20:28:16,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-10-23 20:28:16,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2020-10-23 20:28:16,455 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 54 [2020-10-23 20:28:16,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:16,456 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2020-10-23 20:28:16,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 20:28:16,456 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2020-10-23 20:28:16,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-23 20:28:16,458 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:16,458 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:16,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 20:28:16,458 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:16,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:16,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1161295337, now seen corresponding path program 4 times [2020-10-23 20:28:16,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:16,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [843374469] [2020-10-23 20:28:16,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:16,463 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:16,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:16,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:16,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:16,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:16,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:16,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:16,702 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:16,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [843374469] [2020-10-23 20:28:16,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:16,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 20:28:16,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112672208] [2020-10-23 20:28:16,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 20:28:16,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:16,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 20:28:16,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-23 20:28:16,705 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 10 states. [2020-10-23 20:28:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:17,173 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-10-23 20:28:17,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-23 20:28:17,174 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-10-23 20:28:17,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:17,176 INFO L225 Difference]: With dead ends: 61 [2020-10-23 20:28:17,176 INFO L226 Difference]: Without dead ends: 54 [2020-10-23 20:28:17,178 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:17,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-10-23 20:28:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-10-23 20:28:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-23 20:28:17,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-10-23 20:28:17,202 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 63 [2020-10-23 20:28:17,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:17,204 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-10-23 20:28:17,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 20:28:17,205 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-10-23 20:28:17,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-23 20:28:17,207 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:17,207 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:17,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 20:28:17,207 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:17,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:17,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2109333008, now seen corresponding path program 5 times [2020-10-23 20:28:17,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:17,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1629425257] [2020-10-23 20:28:17,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:17,216 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:17,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:17,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:17,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:17,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:17,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:17,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:17,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:17,471 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:17,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1629425257] [2020-10-23 20:28:17,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:17,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-23 20:28:17,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986244379] [2020-10-23 20:28:17,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 20:28:17,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:17,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 20:28:17,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:28:17,474 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 11 states. [2020-10-23 20:28:18,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:18,014 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-10-23 20:28:18,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-23 20:28:18,015 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-10-23 20:28:18,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:18,017 INFO L225 Difference]: With dead ends: 66 [2020-10-23 20:28:18,017 INFO L226 Difference]: Without dead ends: 59 [2020-10-23 20:28:18,021 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-10-23 20:28:18,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-23 20:28:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-23 20:28:18,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-23 20:28:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-10-23 20:28:18,050 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 72 [2020-10-23 20:28:18,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:18,051 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-10-23 20:28:18,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 20:28:18,051 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-10-23 20:28:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-23 20:28:18,061 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:18,061 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:18,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 20:28:18,062 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:18,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:18,062 INFO L82 PathProgramCache]: Analyzing trace with hash 639783135, now seen corresponding path program 6 times [2020-10-23 20:28:18,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:18,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [610626868] [2020-10-23 20:28:18,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:18,068 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:18,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:18,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:18,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:18,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:18,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:18,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:18,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:18,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:18,455 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:18,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [610626868] [2020-10-23 20:28:18,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:18,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 20:28:18,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736842558] [2020-10-23 20:28:18,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 20:28:18,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:18,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 20:28:18,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-23 20:28:18,458 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 12 states. [2020-10-23 20:28:19,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:19,088 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-10-23 20:28:19,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 20:28:19,089 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-10-23 20:28:19,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:19,093 INFO L225 Difference]: With dead ends: 71 [2020-10-23 20:28:19,093 INFO L226 Difference]: Without dead ends: 64 [2020-10-23 20:28:19,094 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-10-23 20:28:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-23 20:28:19,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-10-23 20:28:19,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-23 20:28:19,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2020-10-23 20:28:19,109 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 81 [2020-10-23 20:28:19,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:19,110 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2020-10-23 20:28:19,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 20:28:19,110 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2020-10-23 20:28:19,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-10-23 20:28:19,112 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:19,112 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:19,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 20:28:19,112 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:19,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:19,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1631598970, now seen corresponding path program 7 times [2020-10-23 20:28:19,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:19,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1772983367] [2020-10-23 20:28:19,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:19,118 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:19,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:19,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:19,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:19,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:19,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:19,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:19,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:19,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:19,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:19,458 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:19,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1772983367] [2020-10-23 20:28:19,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:19,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-23 20:28:19,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548158626] [2020-10-23 20:28:19,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-23 20:28:19,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:19,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-23 20:28:19,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-10-23 20:28:19,461 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 13 states. [2020-10-23 20:28:20,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:20,023 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-10-23 20:28:20,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 20:28:20,024 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-10-23 20:28:20,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:20,026 INFO L225 Difference]: With dead ends: 76 [2020-10-23 20:28:20,026 INFO L226 Difference]: Without dead ends: 69 [2020-10-23 20:28:20,030 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-10-23 20:28:20,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-10-23 20:28:20,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-10-23 20:28:20,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-23 20:28:20,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-10-23 20:28:20,056 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 90 [2020-10-23 20:28:20,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:20,058 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-10-23 20:28:20,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-23 20:28:20,058 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-10-23 20:28:20,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-10-23 20:28:20,066 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:20,066 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:20,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-23 20:28:20,066 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:20,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:20,068 INFO L82 PathProgramCache]: Analyzing trace with hash -440062251, now seen corresponding path program 8 times [2020-10-23 20:28:20,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:20,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [374535997] [2020-10-23 20:28:20,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:20,076 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:20,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:20,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:20,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:20,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:20,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:20,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:20,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:20,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:20,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:20,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:20,491 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:20,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [374535997] [2020-10-23 20:28:20,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:20,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-23 20:28:20,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094860303] [2020-10-23 20:28:20,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-23 20:28:20,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:20,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-23 20:28:20,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-10-23 20:28:20,504 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 14 states. [2020-10-23 20:28:21,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:21,133 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-10-23 20:28:21,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-23 20:28:21,133 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-10-23 20:28:21,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:21,135 INFO L225 Difference]: With dead ends: 81 [2020-10-23 20:28:21,135 INFO L226 Difference]: Without dead ends: 74 [2020-10-23 20:28:21,137 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:21,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-23 20:28:21,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-23 20:28:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-23 20:28:21,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2020-10-23 20:28:21,162 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 99 [2020-10-23 20:28:21,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:21,164 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2020-10-23 20:28:21,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-23 20:28:21,164 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2020-10-23 20:28:21,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-10-23 20:28:21,165 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:21,165 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:21,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 20:28:21,166 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:21,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:21,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1832058372, now seen corresponding path program 9 times [2020-10-23 20:28:21,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:21,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [414022164] [2020-10-23 20:28:21,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:21,176 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:21,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:21,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:21,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:21,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:21,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:21,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:21,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:21,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:21,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:21,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:21,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:21,645 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:21,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [414022164] [2020-10-23 20:28:21,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:21,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-23 20:28:21,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626398428] [2020-10-23 20:28:21,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-23 20:28:21,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:21,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-23 20:28:21,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-23 20:28:21,648 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 15 states. [2020-10-23 20:28:22,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:22,293 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-10-23 20:28:22,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 20:28:22,294 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-10-23 20:28:22,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:22,296 INFO L225 Difference]: With dead ends: 86 [2020-10-23 20:28:22,296 INFO L226 Difference]: Without dead ends: 79 [2020-10-23 20:28:22,298 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-10-23 20:28:22,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-23 20:28:22,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-23 20:28:22,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-23 20:28:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2020-10-23 20:28:22,341 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 108 [2020-10-23 20:28:22,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:22,342 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2020-10-23 20:28:22,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-23 20:28:22,342 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2020-10-23 20:28:22,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-10-23 20:28:22,344 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:22,344 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:22,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 20:28:22,345 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:22,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:22,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1858719797, now seen corresponding path program 10 times [2020-10-23 20:28:22,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:22,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [389308782] [2020-10-23 20:28:22,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:22,356 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:22,935 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:22,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [389308782] [2020-10-23 20:28:22,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:22,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-10-23 20:28:22,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870834663] [2020-10-23 20:28:22,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-23 20:28:22,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:22,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-23 20:28:22,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-10-23 20:28:22,940 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 16 states. [2020-10-23 20:28:23,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:23,697 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-10-23 20:28:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-23 20:28:23,697 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2020-10-23 20:28:23,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:23,699 INFO L225 Difference]: With dead ends: 91 [2020-10-23 20:28:23,699 INFO L226 Difference]: Without dead ends: 84 [2020-10-23 20:28:23,700 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:23,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-23 20:28:23,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-10-23 20:28:23,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-23 20:28:23,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2020-10-23 20:28:23,715 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 117 [2020-10-23 20:28:23,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:23,716 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2020-10-23 20:28:23,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-23 20:28:23,716 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2020-10-23 20:28:23,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-10-23 20:28:23,717 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:23,718 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:23,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-23 20:28:23,718 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:23,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:23,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1671901298, now seen corresponding path program 11 times [2020-10-23 20:28:23,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:23,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1674507289] [2020-10-23 20:28:23,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:23,726 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:23,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:23,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:23,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:23,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:23,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:23,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:23,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:23,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:24,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:24,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:24,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:24,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:24,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:24,218 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:24,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1674507289] [2020-10-23 20:28:24,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:24,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-10-23 20:28:24,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064256417] [2020-10-23 20:28:24,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-23 20:28:24,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:24,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-23 20:28:24,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-10-23 20:28:24,221 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 17 states. [2020-10-23 20:28:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:25,103 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2020-10-23 20:28:25,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-23 20:28:25,103 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2020-10-23 20:28:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:25,105 INFO L225 Difference]: With dead ends: 96 [2020-10-23 20:28:25,105 INFO L226 Difference]: Without dead ends: 89 [2020-10-23 20:28:25,106 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:25,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-23 20:28:25,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-10-23 20:28:25,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-23 20:28:25,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2020-10-23 20:28:25,127 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 126 [2020-10-23 20:28:25,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:25,127 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2020-10-23 20:28:25,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-23 20:28:25,128 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2020-10-23 20:28:25,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-10-23 20:28:25,130 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:25,131 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:25,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-23 20:28:25,131 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:25,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:25,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1502940223, now seen corresponding path program 12 times [2020-10-23 20:28:25,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:25,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1804661970] [2020-10-23 20:28:25,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:25,140 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:25,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:25,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:25,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:25,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:25,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:25,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:25,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:25,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:25,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:25,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:25,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:25,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:25,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:25,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:25,779 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:25,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1804661970] [2020-10-23 20:28:25,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:25,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-10-23 20:28:25,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435364389] [2020-10-23 20:28:25,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-23 20:28:25,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:25,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-23 20:28:25,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-10-23 20:28:25,782 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 18 states. [2020-10-23 20:28:26,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:26,763 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2020-10-23 20:28:26,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-23 20:28:26,764 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2020-10-23 20:28:26,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:26,765 INFO L225 Difference]: With dead ends: 101 [2020-10-23 20:28:26,765 INFO L226 Difference]: Without dead ends: 94 [2020-10-23 20:28:26,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2020-10-23 20:28:26,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-10-23 20:28:26,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-10-23 20:28:26,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-23 20:28:26,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2020-10-23 20:28:26,783 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 135 [2020-10-23 20:28:26,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:26,784 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2020-10-23 20:28:26,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-23 20:28:26,784 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2020-10-23 20:28:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-10-23 20:28:26,786 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:26,786 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:26,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-23 20:28:26,787 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:26,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:26,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1695288856, now seen corresponding path program 13 times [2020-10-23 20:28:26,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:26,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1976954827] [2020-10-23 20:28:26,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:26,797 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:26,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:26,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:26,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:26,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:26,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:27,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:27,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:27,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:27,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:27,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:27,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:27,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:27,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:27,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:27,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:27,431 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:27,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1976954827] [2020-10-23 20:28:27,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:27,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-10-23 20:28:27,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293055020] [2020-10-23 20:28:27,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-23 20:28:27,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:27,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-23 20:28:27,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-10-23 20:28:27,434 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 19 states. [2020-10-23 20:28:28,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:28,440 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2020-10-23 20:28:28,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-23 20:28:28,440 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2020-10-23 20:28:28,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:28,442 INFO L225 Difference]: With dead ends: 106 [2020-10-23 20:28:28,442 INFO L226 Difference]: Without dead ends: 99 [2020-10-23 20:28:28,443 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-10-23 20:28:28,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-10-23 20:28:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2020-10-23 20:28:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-10-23 20:28:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2020-10-23 20:28:28,457 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 144 [2020-10-23 20:28:28,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:28,458 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2020-10-23 20:28:28,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-23 20:28:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2020-10-23 20:28:28,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-10-23 20:28:28,460 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:28,460 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:28,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-23 20:28:28,461 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:28,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:28,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1916345015, now seen corresponding path program 14 times [2020-10-23 20:28:28,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:28,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1567834645] [2020-10-23 20:28:28,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:28,466 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:28,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:28,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:28,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:28,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:28,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:28,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:28,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:28,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:28,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:28,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:28,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:28,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:28,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:28,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:28,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:28,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:29,162 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:29,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1567834645] [2020-10-23 20:28:29,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:29,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-10-23 20:28:29,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312707472] [2020-10-23 20:28:29,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-23 20:28:29,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:29,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-23 20:28:29,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-10-23 20:28:29,165 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 20 states. [2020-10-23 20:28:30,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:30,173 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2020-10-23 20:28:30,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-23 20:28:30,174 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 153 [2020-10-23 20:28:30,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:30,176 INFO L225 Difference]: With dead ends: 111 [2020-10-23 20:28:30,176 INFO L226 Difference]: Without dead ends: 104 [2020-10-23 20:28:30,177 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:30,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-23 20:28:30,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-10-23 20:28:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-23 20:28:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2020-10-23 20:28:30,192 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 153 [2020-10-23 20:28:30,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:30,192 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2020-10-23 20:28:30,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-23 20:28:30,193 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2020-10-23 20:28:30,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-10-23 20:28:30,194 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:28:30,195 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:30,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-23 20:28:30,195 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:28:30,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:28:30,196 INFO L82 PathProgramCache]: Analyzing trace with hash -540599902, now seen corresponding path program 15 times [2020-10-23 20:28:30,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:28:30,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [916811025] [2020-10-23 20:28:30,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:28:30,201 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:28:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:30,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:28:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:30,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-10-23 20:28:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:30,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:30,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:30,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:30,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:30,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:30,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:30,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:31,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:31,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:31,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:31,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:31,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:31,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:31,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:31,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 20:28:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:28:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2020-10-23 20:28:32,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [916811025] [2020-10-23 20:28:32,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:28:32,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2020-10-23 20:28:32,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490032707] [2020-10-23 20:28:32,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 42 states [2020-10-23 20:28:32,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:28:32,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2020-10-23 20:28:32,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1425, Unknown=0, NotChecked=0, Total=1722 [2020-10-23 20:28:32,192 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 42 states. [2020-10-23 20:28:39,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:28:39,565 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-10-23 20:28:39,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2020-10-23 20:28:39,565 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 162 [2020-10-23 20:28:39,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:28:39,566 INFO L225 Difference]: With dead ends: 104 [2020-10-23 20:28:39,566 INFO L226 Difference]: Without dead ends: 0 [2020-10-23 20:28:39,570 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1317 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1810, Invalid=7502, Unknown=0, NotChecked=0, Total=9312 [2020-10-23 20:28:39,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-23 20:28:39,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-23 20:28:39,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-23 20:28:39,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-23 20:28:39,571 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 162 [2020-10-23 20:28:39,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:28:39,571 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-23 20:28:39,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2020-10-23 20:28:39,571 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-23 20:28:39,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-23 20:28:39,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-23 20:28:39,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-23 20:28:41,303 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 138 DAG size of output: 104 [2020-10-23 20:28:42,225 WARN L193 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 84 [2020-10-23 20:28:43,058 WARN L193 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 84 [2020-10-23 20:28:44,238 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 127 DAG size of output: 90 [2020-10-23 20:28:45,405 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 127 DAG size of output: 90 [2020-10-23 20:28:45,588 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-23 20:28:45,588 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-23 20:28:45,588 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-23 20:28:45,588 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-23 20:28:45,588 INFO L277 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-10-23 20:28:45,588 INFO L277 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-10-23 20:28:45,588 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:28:45,588 INFO L277 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-10-23 20:28:45,589 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-23 20:28:45,589 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-10-23 20:28:45,589 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:28:45,589 INFO L277 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-10-23 20:28:45,589 INFO L277 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-10-23 20:28:45,589 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:28:45,589 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-23 20:28:45,589 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-23 20:28:45,589 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-23 20:28:45,589 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-23 20:28:45,590 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 (<= (+ |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 .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#res|) (<= |sum_#in~n| 9)) (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| 14) |sum_#res|) .cse0 .cse1) (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| 14)) (and .cse3 (<= (+ |sum_#in~m| 15) |sum_#res|))))) [2020-10-23 20:28:45,590 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:28:45,591 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 (<= |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 .cse1 (<= (+ |sum_#in~m| 10) |sum_#t~ret7|) .cse2 (<= |sum_#in~n| 10)) (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 15) |sum_#t~ret7|)) (and .cse0 (<= (+ |sum_#in~m| 4) |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse1 .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~m| 14) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 14) .cse2))) [2020-10-23 20:28:45,591 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:28:45,591 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 (<= |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 .cse1 (<= (+ |sum_#in~m| 10) |sum_#t~ret7|) .cse2 (<= |sum_#in~n| 10)) (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 15) |sum_#t~ret7|)) (and .cse0 (<= (+ |sum_#in~m| 4) |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse1 .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~m| 14) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 14) .cse2))) [2020-10-23 20:28:45,591 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:28:45,592 INFO L270 CegarLoopResult]: At program point L9-3(line 9) the Hoare annotation is: (and (let ((.cse17 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (<= |sum_#res| .cse17)) (.cse3 (<= |sum_#t~ret7| .cse17))) (or (let ((.cse2 (+ |sum_#in~m| 12))) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= .cse2 |sum_#t~ret7|) .cse3 (<= .cse2 |sum_#res|))) (let ((.cse4 (+ |sum_#in~m| 10))) (and (<= .cse4 |sum_#res|) .cse0 .cse1 (<= .cse4 |sum_#t~ret7|) .cse3 (<= |sum_#in~n| 10))) (let ((.cse5 (+ |sum_#in~m| 5))) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= .cse5 |sum_#t~ret7|) (<= .cse5 |sum_#res|) .cse3)) (let ((.cse6 (+ |sum_#in~m| 6))) (and (<= .cse6 |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6) (<= .cse6 |sum_#t~ret7|) .cse3)) (let ((.cse7 (+ |sum_#in~m| 14))) (and (<= .cse7 |sum_#t~ret7|) (<= .cse7 |sum_#res|) .cse0 .cse1 .cse3)) (let ((.cse8 (+ |sum_#in~m| 13))) (and .cse0 (<= .cse8 |sum_#t~ret7|) (<= |sum_#in~n| 13) .cse1 (<= .cse8 |sum_#res|) .cse3)) (let ((.cse9 (+ |sum_#in~m| 11))) (and (<= .cse9 |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 11) .cse3 (<= .cse9 |sum_#t~ret7|))) (let ((.cse10 (+ |sum_#in~m| 3))) (and (<= .cse10 |sum_#t~ret7|) .cse0 (<= |sum_#in~n| 3) .cse1 (<= .cse10 |sum_#res|) .cse3)) (let ((.cse11 (+ |sum_#in~m| 9))) (and .cse0 .cse1 (<= .cse11 |sum_#res|) (<= .cse11 |sum_#t~ret7|) (<= |sum_#in~n| 9) .cse3)) (let ((.cse12 (+ |sum_#in~m| 8))) (and .cse0 (<= |sum_#in~n| 8) .cse1 (<= .cse12 |sum_#res|) (<= .cse12 |sum_#t~ret7|) .cse3)) (let ((.cse13 (+ |sum_#in~m| 7))) (and .cse0 (<= .cse13 |sum_#res|) (<= |sum_#in~n| 7) .cse1 (<= .cse13 |sum_#t~ret7|) .cse3)) (let ((.cse14 (+ |sum_#in~m| 4))) (and (<= .cse14 |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse0 .cse1 (<= .cse14 |sum_#res|) .cse3)) (let ((.cse15 (+ |sum_#in~m| 1))) (and (<= .cse15 |sum_#t~ret7|) (<= .cse15 |sum_#res|) .cse0 (<= |sum_#in~n| 1) .cse1 .cse3)) (let ((.cse16 (+ |sum_#in~m| 2))) (and (<= .cse16 |sum_#res|) (<= |sum_#in~n| 2) .cse0 .cse1 .cse3 (<= .cse16 |sum_#t~ret7|)))))) (let ((.cse18 (= sum_~n |sum_#in~n|))) (or (and .cse18 (<= |sum_#in~n| 14)) (let ((.cse19 (+ |sum_#in~m| 15))) (and .cse18 (<= .cse19 |sum_#res|) (<= .cse19 |sum_#t~ret7|)))))) [2020-10-23 20:28:45,592 INFO L270 CegarLoopResult]: At program point L5(lines 5 11) the Hoare annotation is: (= sum_~n |sum_#in~n|) [2020-10-23 20:28:45,593 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 (<= (+ |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 .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#res|) (<= |sum_#in~n| 9)) (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| 14) |sum_#res|) .cse0 .cse1) (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| 14)) (and .cse3 (<= (+ |sum_#in~m| 15) |sum_#res|))))) [2020-10-23 20:28:45,593 INFO L277 CegarLoopResult]: At program point sumENTRY(lines 5 11) the Hoare annotation is: true [2020-10-23 20:28:45,593 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 13 20) the Hoare annotation is: true [2020-10-23 20:28:45,593 INFO L270 CegarLoopResult]: At program point mainEXIT(lines 13 20) the Hoare annotation is: (<= 15 main_~a~0) [2020-10-23 20:28:45,593 INFO L270 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: false [2020-10-23 20:28:45,593 INFO L270 CegarLoopResult]: At program point L17(lines 17 19) the Hoare annotation is: (and (<= main_~a~0 main_~result~0) (<= 15 main_~a~0) (<= main_~result~0 main_~a~0) (= main_~b~0 0) (<= main_~a~0 15)) [2020-10-23 20:28:45,593 INFO L270 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: false [2020-10-23 20:28:45,593 INFO L270 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= 15 main_~a~0) (= main_~b~0 0) (<= main_~a~0 15)) [2020-10-23 20:28:45,594 INFO L270 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (<= 15 main_~a~0) (<= main_~a~0 15)) [2020-10-23 20:28:45,594 INFO L270 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (and (<= |main_#t~ret8| main_~a~0) (<= 15 main_~a~0) (<= main_~a~0 |main_#t~ret8|) (= main_~b~0 0) (<= main_~a~0 15)) [2020-10-23 20:28:45,594 INFO L270 CegarLoopResult]: At program point L17-2(lines 13 20) the Hoare annotation is: (<= 15 main_~a~0) [2020-10-23 20:28:45,594 INFO L270 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (and (<= |main_#t~ret8| main_~a~0) (<= 15 main_~a~0) (<= main_~a~0 |main_#t~ret8|) (= main_~b~0 0) (<= main_~a~0 15)) [2020-10-23 20:28:45,594 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) (<= 15 main_~a~0) (<= main_~a~0 |main_#t~ret8|) (<= main_~result~0 main_~a~0) (= main_~b~0 0) (<= main_~a~0 15)) [2020-10-23 20:28:45,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:28:45 BoogieIcfgContainer [2020-10-23 20:28:45,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 20:28:45,623 INFO L168 Benchmark]: Toolchain (without parser) took 32768.32 ms. Allocated memory was 151.0 MB in the beginning and 377.5 MB in the end (delta: 226.5 MB). Free memory was 127.5 MB in the beginning and 248.8 MB in the end (delta: -121.3 MB). Peak memory consumption was 222.3 MB. Max. memory is 8.0 GB. [2020-10-23 20:28:45,623 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory is still 125.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 20:28:45,624 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.76 ms. Allocated memory is still 151.0 MB. Free memory was 126.9 MB in the beginning and 117.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-23 20:28:45,625 INFO L168 Benchmark]: Boogie Preprocessor took 35.72 ms. Allocated memory is still 151.0 MB. Free memory was 117.5 MB in the beginning and 116.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-23 20:28:45,626 INFO L168 Benchmark]: RCFGBuilder took 480.14 ms. Allocated memory is still 151.0 MB. Free memory was 116.0 MB in the beginning and 102.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-10-23 20:28:45,626 INFO L168 Benchmark]: TraceAbstraction took 32003.09 ms. Allocated memory was 151.0 MB in the beginning and 377.5 MB in the end (delta: 226.5 MB). Free memory was 102.3 MB in the beginning and 248.8 MB in the end (delta: -146.5 MB). Peak memory consumption was 197.1 MB. Max. memory is 8.0 GB. [2020-10-23 20:28:45,629 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 151.0 MB. Free memory is still 125.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 231.76 ms. Allocated memory is still 151.0 MB. Free memory was 126.9 MB in the beginning and 117.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 35.72 ms. Allocated memory is still 151.0 MB. Free memory was 117.5 MB in the beginning and 116.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 480.14 ms. Allocated memory is still 151.0 MB. Free memory was 116.0 MB in the beginning and 102.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 32003.09 ms. Allocated memory was 151.0 MB in the beginning and 377.5 MB in the end (delta: 226.5 MB). Free memory was 102.3 MB in the beginning and 248.8 MB in the end (delta: -146.5 MB). Peak memory consumption was 197.1 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) && \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))) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(m) + 9 <= \result) && \old(n) <= 9)) || (((\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) + 14 <= \result && m == \old(m)) && \result <= \old(n) + \old(m))) || (((\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) <= 14) || (n == \old(n) && \old(m) + 15 <= \result)) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 15 <= a - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 25.8s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 458 SDtfs, 1346 SDslu, 1037 SDs, 0 SdLazy, 2444 SolverSat, 404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 729 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2677 ImplicationChecksByTransitivity, 15.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 109 PreInvPairs, 334 NumberOfFragments, 1702 HoareAnnotationTreeSize, 109 FomulaSimplifications, 4473 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 39 FomulaSimplificationsInter, 6506 FormulaSimplificationTreeSizeReductionInter, 5.4s 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...