/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/id_i15_o15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 20:27:13,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 20:27:13,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 20:27:13,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 20:27:13,273 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 20:27:13,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 20:27:13,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 20:27:13,290 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 20:27:13,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 20:27:13,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 20:27:13,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 20:27:13,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 20:27:13,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 20:27:13,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 20:27:13,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 20:27:13,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 20:27:13,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 20:27:13,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 20:27:13,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 20:27:13,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 20:27:13,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 20:27:13,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 20:27:13,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 20:27:13,337 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 20:27:13,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 20:27:13,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 20:27:13,346 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 20:27:13,348 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 20:27:13,348 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 20:27:13,349 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 20:27:13,350 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 20:27:13,350 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 20:27:13,352 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 20:27:13,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 20:27:13,354 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 20:27:13,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 20:27:13,355 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 20:27:13,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 20:27:13,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 20:27:13,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 20:27:13,357 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 20:27:13,358 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:27:13,380 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 20:27:13,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 20:27:13,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 20:27:13,395 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 20:27:13,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 20:27:13,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 20:27:13,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 20:27:13,396 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 20:27:13,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 20:27:13,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 20:27:13,397 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 20:27:13,398 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 20:27:13,398 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 20:27:13,398 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 20:27:13,399 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 20:27:13,399 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-23 20:27:13,399 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 20:27:13,399 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 20:27:13,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 20:27:13,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 20:27:13,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-23 20:27:13,400 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 20:27:13,400 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:27:13,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 20:27:13,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 20:27:13,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 20:27:13,864 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 20:27:13,865 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 20:27:13,866 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i15_o15-2.c [2020-10-23 20:27:13,933 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6ba082a3/71bb1d3a4d3b4d3ab30fb12dec025e08/FLAGfe08b6515 [2020-10-23 20:27:14,531 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 20:27:14,532 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i15_o15-2.c [2020-10-23 20:27:14,539 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6ba082a3/71bb1d3a4d3b4d3ab30fb12dec025e08/FLAGfe08b6515 [2020-10-23 20:27:14,894 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6ba082a3/71bb1d3a4d3b4d3ab30fb12dec025e08 [2020-10-23 20:27:14,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 20:27:14,906 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 20:27:14,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 20:27:14,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 20:27:14,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 20:27:14,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:27:14" (1/1) ... [2020-10-23 20:27:14,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@498c12fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:14, skipping insertion in model container [2020-10-23 20:27:14,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:27:14" (1/1) ... [2020-10-23 20:27:14,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 20:27:14,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 20:27:15,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:27:15,107 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 20:27:15,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 20:27:15,139 INFO L208 MainTranslator]: Completed translation [2020-10-23 20:27:15,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:15 WrapperNode [2020-10-23 20:27:15,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 20:27:15,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 20:27:15,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 20:27:15,142 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 20:27:15,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:15" (1/1) ... [2020-10-23 20:27:15,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:15" (1/1) ... [2020-10-23 20:27:15,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:15" (1/1) ... [2020-10-23 20:27:15,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:15" (1/1) ... [2020-10-23 20:27:15,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:15" (1/1) ... [2020-10-23 20:27:15,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:15" (1/1) ... [2020-10-23 20:27:15,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:15" (1/1) ... [2020-10-23 20:27:15,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 20:27:15,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 20:27:15,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 20:27:15,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 20:27:15,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:15" (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:27:15,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 20:27:15,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 20:27:15,254 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 20:27:15,255 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-10-23 20:27:15,255 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 20:27:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 20:27:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 20:27:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 20:27:15,256 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 20:27:15,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 20:27:15,256 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-10-23 20:27:15,256 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 20:27:15,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 20:27:15,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 20:27:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 20:27:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 20:27:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 20:27:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 20:27:15,493 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 20:27:15,493 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-23 20:27:15,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:27:15 BoogieIcfgContainer [2020-10-23 20:27:15,498 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 20:27:15,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 20:27:15,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 20:27:15,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 20:27:15,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:27:14" (1/3) ... [2020-10-23 20:27:15,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292000af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:27:15, skipping insertion in model container [2020-10-23 20:27:15,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:27:15" (2/3) ... [2020-10-23 20:27:15,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292000af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:27:15, skipping insertion in model container [2020-10-23 20:27:15,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:27:15" (3/3) ... [2020-10-23 20:27:15,519 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i15_o15-2.c [2020-10-23 20:27:15,548 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-23 20:27:15,560 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 20:27:15,590 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 20:27:15,621 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 20:27:15,621 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 20:27:15,621 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-10-23 20:27:15,621 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 20:27:15,621 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 20:27:15,622 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 20:27:15,622 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 20:27:15,622 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 20:27:15,690 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-10-23 20:27:15,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-23 20:27:15,721 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:15,722 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] [2020-10-23 20:27:15,722 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:15,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:15,730 INFO L82 PathProgramCache]: Analyzing trace with hash -742560695, now seen corresponding path program 1 times [2020-10-23 20:27:15,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:15,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1836243896] [2020-10-23 20:27:15,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:15,837 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:16,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:16,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:16,122 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:27:16,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1836243896] [2020-10-23 20:27:16,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:16,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 20:27:16,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332720638] [2020-10-23 20:27:16,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 20:27:16,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:16,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 20:27:16,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-23 20:27:16,151 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2020-10-23 20:27:16,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:16,447 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-10-23 20:27:16,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 20:27:16,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-23 20:27:16,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:16,459 INFO L225 Difference]: With dead ends: 50 [2020-10-23 20:27:16,460 INFO L226 Difference]: Without dead ends: 32 [2020-10-23 20:27:16,463 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:27:16,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-10-23 20:27:16,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-10-23 20:27:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-23 20:27:16,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-10-23 20:27:16,519 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-10-23 20:27:16,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:16,520 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-10-23 20:27:16,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 20:27:16,520 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-10-23 20:27:16,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-23 20:27:16,523 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:16,523 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:16,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 20:27:16,524 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:16,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:16,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1024612499, now seen corresponding path program 1 times [2020-10-23 20:27:16,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:16,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [70723543] [2020-10-23 20:27:16,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:16,530 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:16,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:16,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:16,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-23 20:27:16,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [70723543] [2020-10-23 20:27:16,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:16,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-23 20:27:16,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667198116] [2020-10-23 20:27:16,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-23 20:27:16,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:16,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-23 20:27:16,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-23 20:27:16,719 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2020-10-23 20:27:16,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:16,958 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-10-23 20:27:16,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-23 20:27:16,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-10-23 20:27:16,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:16,960 INFO L225 Difference]: With dead ends: 44 [2020-10-23 20:27:16,960 INFO L226 Difference]: Without dead ends: 37 [2020-10-23 20:27:16,962 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:27:16,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-23 20:27:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-23 20:27:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-23 20:27:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-10-23 20:27:16,976 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2020-10-23 20:27:16,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:16,977 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-10-23 20:27:16,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-23 20:27:16,977 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-10-23 20:27:16,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-23 20:27:16,979 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:16,979 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:16,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 20:27:16,979 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:16,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:16,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1157111945, now seen corresponding path program 2 times [2020-10-23 20:27:16,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:16,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [162750817] [2020-10-23 20:27:16,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:16,984 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,237 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-23 20:27:17,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [162750817] [2020-10-23 20:27:17,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:17,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-23 20:27:17,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689387001] [2020-10-23 20:27:17,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 20:27:17,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:17,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 20:27:17,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-23 20:27:17,241 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-10-23 20:27:17,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:17,517 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-10-23 20:27:17,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 20:27:17,517 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-10-23 20:27:17,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:17,519 INFO L225 Difference]: With dead ends: 49 [2020-10-23 20:27:17,519 INFO L226 Difference]: Without dead ends: 42 [2020-10-23 20:27:17,520 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:27:17,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-10-23 20:27:17,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-10-23 20:27:17,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-23 20:27:17,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-10-23 20:27:17,534 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2020-10-23 20:27:17,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:17,535 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-10-23 20:27:17,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 20:27:17,535 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-10-23 20:27:17,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-23 20:27:17,537 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:17,537 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:17,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-23 20:27:17,537 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:17,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:17,538 INFO L82 PathProgramCache]: Analyzing trace with hash 2083092563, now seen corresponding path program 3 times [2020-10-23 20:27:17,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:17,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1372889515] [2020-10-23 20:27:17,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:17,542 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:17,797 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-23 20:27:17,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1372889515] [2020-10-23 20:27:17,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:17,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-23 20:27:17,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496617085] [2020-10-23 20:27:17,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-23 20:27:17,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:17,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-23 20:27:17,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-23 20:27:17,800 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-10-23 20:27:18,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:18,166 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-10-23 20:27:18,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 20:27:18,167 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-10-23 20:27:18,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:18,169 INFO L225 Difference]: With dead ends: 54 [2020-10-23 20:27:18,169 INFO L226 Difference]: Without dead ends: 47 [2020-10-23 20:27:18,170 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:27:18,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-23 20:27:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-23 20:27:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-23 20:27:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-10-23 20:27:18,183 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 49 [2020-10-23 20:27:18,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:18,184 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-10-23 20:27:18,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-23 20:27:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-10-23 20:27:18,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-10-23 20:27:18,186 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:18,186 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:18,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-23 20:27:18,187 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:18,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:18,187 INFO L82 PathProgramCache]: Analyzing trace with hash 2025718985, now seen corresponding path program 4 times [2020-10-23 20:27:18,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:18,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1657211057] [2020-10-23 20:27:18,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:18,191 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-23 20:27:18,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1657211057] [2020-10-23 20:27:18,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:18,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-23 20:27:18,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857559331] [2020-10-23 20:27:18,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 20:27:18,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:18,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 20:27:18,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-23 20:27:18,426 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2020-10-23 20:27:18,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:18,899 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-10-23 20:27:18,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-23 20:27:18,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-10-23 20:27:18,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:18,903 INFO L225 Difference]: With dead ends: 59 [2020-10-23 20:27:18,903 INFO L226 Difference]: Without dead ends: 52 [2020-10-23 20:27:18,904 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:27:18,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-10-23 20:27:18,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-10-23 20:27:18,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-23 20:27:18,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-10-23 20:27:18,918 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 57 [2020-10-23 20:27:18,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:18,919 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-10-23 20:27:18,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 20:27:18,919 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-10-23 20:27:18,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-23 20:27:18,921 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:18,921 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:18,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-23 20:27:18,921 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:18,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:18,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2086365203, now seen corresponding path program 5 times [2020-10-23 20:27:18,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:18,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2011450325] [2020-10-23 20:27:18,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:18,926 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:18,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,141 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-23 20:27:19,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2011450325] [2020-10-23 20:27:19,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:19,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-23 20:27:19,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164498453] [2020-10-23 20:27:19,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 20:27:19,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:19,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 20:27:19,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-23 20:27:19,144 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 11 states. [2020-10-23 20:27:19,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:19,648 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-10-23 20:27:19,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-23 20:27:19,649 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2020-10-23 20:27:19,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:19,650 INFO L225 Difference]: With dead ends: 64 [2020-10-23 20:27:19,650 INFO L226 Difference]: Without dead ends: 57 [2020-10-23 20:27:19,654 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-10-23 20:27:19,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-23 20:27:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-10-23 20:27:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-23 20:27:19,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-10-23 20:27:19,685 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 65 [2020-10-23 20:27:19,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:19,687 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-10-23 20:27:19,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 20:27:19,687 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-10-23 20:27:19,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-23 20:27:19,689 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:19,689 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:19,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-23 20:27:19,690 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:19,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:19,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1881990903, now seen corresponding path program 6 times [2020-10-23 20:27:19,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:19,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1881170620] [2020-10-23 20:27:19,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:19,702 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:19,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,028 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-10-23 20:27:20,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1881170620] [2020-10-23 20:27:20,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:20,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-23 20:27:20,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331593359] [2020-10-23 20:27:20,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 20:27:20,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:20,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 20:27:20,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-23 20:27:20,031 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2020-10-23 20:27:20,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:20,572 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-10-23 20:27:20,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-23 20:27:20,573 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-10-23 20:27:20,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:20,575 INFO L225 Difference]: With dead ends: 69 [2020-10-23 20:27:20,575 INFO L226 Difference]: Without dead ends: 62 [2020-10-23 20:27:20,576 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-10-23 20:27:20,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-23 20:27:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-23 20:27:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-23 20:27:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2020-10-23 20:27:20,593 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 73 [2020-10-23 20:27:20,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:20,594 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2020-10-23 20:27:20,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 20:27:20,594 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2020-10-23 20:27:20,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-23 20:27:20,596 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:20,596 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:20,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-23 20:27:20,596 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:20,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:20,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1486608429, now seen corresponding path program 7 times [2020-10-23 20:27:20,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:20,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [754482485] [2020-10-23 20:27:20,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:20,602 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-10-23 20:27:20,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [754482485] [2020-10-23 20:27:20,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:20,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-23 20:27:20,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348428282] [2020-10-23 20:27:20,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-23 20:27:20,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:20,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-23 20:27:20,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-10-23 20:27:20,975 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 13 states. [2020-10-23 20:27:21,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:21,566 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-10-23 20:27:21,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 20:27:21,567 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2020-10-23 20:27:21,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:21,568 INFO L225 Difference]: With dead ends: 74 [2020-10-23 20:27:21,569 INFO L226 Difference]: Without dead ends: 67 [2020-10-23 20:27:21,570 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:27:21,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-10-23 20:27:21,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-10-23 20:27:21,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-23 20:27:21,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-10-23 20:27:21,587 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 81 [2020-10-23 20:27:21,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:21,587 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-10-23 20:27:21,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-23 20:27:21,587 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-10-23 20:27:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-10-23 20:27:21,589 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:21,589 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:21,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-23 20:27:21,590 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:21,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:21,590 INFO L82 PathProgramCache]: Analyzing trace with hash -2047124151, now seen corresponding path program 8 times [2020-10-23 20:27:21,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:21,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1544874091] [2020-10-23 20:27:21,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:21,596 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:21,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-10-23 20:27:22,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1544874091] [2020-10-23 20:27:22,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:22,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-23 20:27:22,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565023156] [2020-10-23 20:27:22,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-23 20:27:22,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:22,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-23 20:27:22,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-10-23 20:27:22,025 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 14 states. [2020-10-23 20:27:22,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:22,646 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-10-23 20:27:22,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-23 20:27:22,647 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2020-10-23 20:27:22,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:22,649 INFO L225 Difference]: With dead ends: 79 [2020-10-23 20:27:22,649 INFO L226 Difference]: Without dead ends: 72 [2020-10-23 20:27:22,651 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:27:22,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-23 20:27:22,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-10-23 20:27:22,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-23 20:27:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-10-23 20:27:22,681 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 89 [2020-10-23 20:27:22,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:22,686 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-10-23 20:27:22,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-23 20:27:22,686 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-10-23 20:27:22,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-10-23 20:27:22,693 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:22,693 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:22,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 20:27:22,694 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:22,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:22,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1811920787, now seen corresponding path program 9 times [2020-10-23 20:27:22,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:22,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [75017617] [2020-10-23 20:27:22,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:22,702 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:22,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,121 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-10-23 20:27:23,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [75017617] [2020-10-23 20:27:23,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:23,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-23 20:27:23,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332125286] [2020-10-23 20:27:23,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-23 20:27:23,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:23,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-23 20:27:23,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-23 20:27:23,123 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2020-10-23 20:27:23,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:23,831 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-10-23 20:27:23,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 20:27:23,831 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2020-10-23 20:27:23,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:23,834 INFO L225 Difference]: With dead ends: 84 [2020-10-23 20:27:23,834 INFO L226 Difference]: Without dead ends: 77 [2020-10-23 20:27:23,836 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-10-23 20:27:23,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-23 20:27:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-10-23 20:27:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-23 20:27:23,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2020-10-23 20:27:23,867 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 97 [2020-10-23 20:27:23,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:23,868 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2020-10-23 20:27:23,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-23 20:27:23,868 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2020-10-23 20:27:23,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-10-23 20:27:23,873 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:23,873 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:23,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 20:27:23,873 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:23,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:23,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1912263049, now seen corresponding path program 10 times [2020-10-23 20:27:23,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:23,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [862839530] [2020-10-23 20:27:23,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:23,883 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:23,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-10-23 20:27:24,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [862839530] [2020-10-23 20:27:24,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:24,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-10-23 20:27:24,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620833916] [2020-10-23 20:27:24,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-23 20:27:24,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:24,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-23 20:27:24,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-10-23 20:27:24,355 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 16 states. [2020-10-23 20:27:25,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:25,117 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-10-23 20:27:25,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-23 20:27:25,117 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-10-23 20:27:25,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:25,118 INFO L225 Difference]: With dead ends: 89 [2020-10-23 20:27:25,118 INFO L226 Difference]: Without dead ends: 82 [2020-10-23 20:27:25,120 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:27:25,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-23 20:27:25,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-10-23 20:27:25,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-23 20:27:25,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2020-10-23 20:27:25,144 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 105 [2020-10-23 20:27:25,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:25,144 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2020-10-23 20:27:25,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-23 20:27:25,145 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2020-10-23 20:27:25,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-10-23 20:27:25,147 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:25,147 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:25,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-23 20:27:25,147 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:25,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:25,148 INFO L82 PathProgramCache]: Analyzing trace with hash -34990253, now seen corresponding path program 11 times [2020-10-23 20:27:25,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:25,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [348357092] [2020-10-23 20:27:25,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:25,155 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-10-23 20:27:25,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [348357092] [2020-10-23 20:27:25,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:25,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-10-23 20:27:25,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131874500] [2020-10-23 20:27:25,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-23 20:27:25,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:25,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-23 20:27:25,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-10-23 20:27:25,719 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 17 states. [2020-10-23 20:27:26,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:26,496 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-10-23 20:27:26,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-23 20:27:26,497 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 113 [2020-10-23 20:27:26,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:26,498 INFO L225 Difference]: With dead ends: 94 [2020-10-23 20:27:26,499 INFO L226 Difference]: Without dead ends: 87 [2020-10-23 20:27:26,500 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:27:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-23 20:27:26,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-10-23 20:27:26,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-23 20:27:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2020-10-23 20:27:26,520 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 113 [2020-10-23 20:27:26,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:26,521 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2020-10-23 20:27:26,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-23 20:27:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2020-10-23 20:27:26,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-10-23 20:27:26,523 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:26,523 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:26,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-23 20:27:26,524 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:26,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:26,524 INFO L82 PathProgramCache]: Analyzing trace with hash -980060727, now seen corresponding path program 12 times [2020-10-23 20:27:26,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:26,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [807162906] [2020-10-23 20:27:26,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:26,531 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:26,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:27,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-10-23 20:27:27,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [807162906] [2020-10-23 20:27:27,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:27,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-10-23 20:27:27,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236113602] [2020-10-23 20:27:27,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-23 20:27:27,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:27,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-23 20:27:27,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-10-23 20:27:27,137 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 18 states. [2020-10-23 20:27:27,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:27,981 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-10-23 20:27:27,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-23 20:27:27,982 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2020-10-23 20:27:27,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:27,983 INFO L225 Difference]: With dead ends: 99 [2020-10-23 20:27:27,984 INFO L226 Difference]: Without dead ends: 92 [2020-10-23 20:27:27,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2020-10-23 20:27:27,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-23 20:27:27,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-10-23 20:27:27,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-23 20:27:28,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2020-10-23 20:27:28,002 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 121 [2020-10-23 20:27:28,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:28,002 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2020-10-23 20:27:28,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-23 20:27:28,003 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2020-10-23 20:27:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-10-23 20:27:28,004 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:28,004 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:28,005 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-23 20:27:28,005 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:28,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:28,005 INFO L82 PathProgramCache]: Analyzing trace with hash 366954259, now seen corresponding path program 13 times [2020-10-23 20:27:28,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:28,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [202010214] [2020-10-23 20:27:28,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:28,013 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-10-23 20:27:28,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [202010214] [2020-10-23 20:27:28,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:28,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-10-23 20:27:28,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433290358] [2020-10-23 20:27:28,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-23 20:27:28,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:28,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-23 20:27:28,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-10-23 20:27:28,739 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 19 states. [2020-10-23 20:27:29,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:29,717 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-10-23 20:27:29,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-23 20:27:29,718 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2020-10-23 20:27:29,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:29,722 INFO L225 Difference]: With dead ends: 104 [2020-10-23 20:27:29,722 INFO L226 Difference]: Without dead ends: 97 [2020-10-23 20:27:29,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-10-23 20:27:29,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-23 20:27:29,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-10-23 20:27:29,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-23 20:27:29,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2020-10-23 20:27:29,750 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 129 [2020-10-23 20:27:29,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:29,753 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2020-10-23 20:27:29,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-23 20:27:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2020-10-23 20:27:29,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-10-23 20:27:29,757 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:29,757 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:29,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-23 20:27:29,757 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:29,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:29,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1919989239, now seen corresponding path program 14 times [2020-10-23 20:27:29,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:29,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [681121744] [2020-10-23 20:27:29,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:29,767 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 20:27:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-23 20:27:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:29,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-23 20:27:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 20:27:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-10-23 20:27:30,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [681121744] [2020-10-23 20:27:30,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 20:27:30,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-10-23 20:27:30,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076648755] [2020-10-23 20:27:30,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-23 20:27:30,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-23 20:27:30,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-23 20:27:30,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-10-23 20:27:30,524 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 20 states. [2020-10-23 20:27:31,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 20:27:31,520 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2020-10-23 20:27:31,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-23 20:27:31,521 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 137 [2020-10-23 20:27:31,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 20:27:31,522 INFO L225 Difference]: With dead ends: 109 [2020-10-23 20:27:31,522 INFO L226 Difference]: Without dead ends: 102 [2020-10-23 20:27:31,524 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:27:31,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-23 20:27:31,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-10-23 20:27:31,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-23 20:27:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2020-10-23 20:27:31,538 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 137 [2020-10-23 20:27:31,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 20:27:31,539 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2020-10-23 20:27:31,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-23 20:27:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2020-10-23 20:27:31,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-10-23 20:27:31,541 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 20:27:31,541 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 20:27:31,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-23 20:27:31,541 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 20:27:31,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 20:27:31,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1315223853, now seen corresponding path program 15 times [2020-10-23 20:27:31,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-23 20:27:31,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [525999119] [2020-10-23 20:27:31,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 20:27:31,551 INFO L321 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-10-23 20:27:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 20:27:31,573 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 20:27:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 20:27:31,595 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 20:27:31,642 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-23 20:27:31,642 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-23 20:27:31,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-23 20:27:31,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:27:31 BoogieIcfgContainer [2020-10-23 20:27:31,667 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 20:27:31,670 INFO L168 Benchmark]: Toolchain (without parser) took 16767.97 ms. Allocated memory was 153.1 MB in the beginning and 320.9 MB in the end (delta: 167.8 MB). Free memory was 129.6 MB in the beginning and 161.9 MB in the end (delta: -32.3 MB). Peak memory consumption was 135.8 MB. Max. memory is 8.0 GB. [2020-10-23 20:27:31,670 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 125.8 MB. Free memory was 103.2 MB in the beginning and 103.1 MB in the end (delta: 73.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 20:27:31,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.73 ms. Allocated memory is still 153.1 MB. Free memory was 128.9 MB in the beginning and 119.9 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-23 20:27:31,671 INFO L168 Benchmark]: Boogie Preprocessor took 31.14 ms. Allocated memory is still 153.1 MB. Free memory was 119.9 MB in the beginning and 118.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-23 20:27:31,672 INFO L168 Benchmark]: RCFGBuilder took 324.90 ms. Allocated memory is still 153.1 MB. Free memory was 118.6 MB in the beginning and 105.5 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-10-23 20:27:31,673 INFO L168 Benchmark]: TraceAbstraction took 16166.84 ms. Allocated memory was 153.1 MB in the beginning and 320.9 MB in the end (delta: 167.8 MB). Free memory was 105.2 MB in the beginning and 161.9 MB in the end (delta: -56.8 MB). Peak memory consumption was 111.7 MB. Max. memory is 8.0 GB. [2020-10-23 20:27:31,676 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.25 ms. Allocated memory is still 125.8 MB. Free memory was 103.2 MB in the beginning and 103.1 MB in the end (delta: 73.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 232.73 ms. Allocated memory is still 153.1 MB. Free memory was 128.9 MB in the beginning and 119.9 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 31.14 ms. Allocated memory is still 153.1 MB. Free memory was 119.9 MB in the beginning and 118.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 324.90 ms. Allocated memory is still 153.1 MB. Free memory was 118.6 MB in the beginning and 105.5 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 16166.84 ms. Allocated memory was 153.1 MB in the beginning and 320.9 MB in the end (delta: 167.8 MB). Free memory was 105.2 MB in the beginning and 161.9 MB in the end (delta: -56.8 MB). Peak memory consumption was 111.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int input = 15; [L13] CALL, EXPR id(input) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND FALSE !(x==0) [L8] CALL, EXPR id(x-1) [L7] COND TRUE x==0 [L7] return 0; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) [L13] int result = id(input); [L14] COND TRUE result == 15 [L15] CALL reach_error() [L4] __assert_fail("0", "id_i15_o15-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.0s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 409 SDtfs, 1277 SDslu, 925 SDs, 0 SdLazy, 1466 SolverSat, 402 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 585 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred 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, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, 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 incorrect! Received shutdown request...