/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_i20_o20-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:42:06,611 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:42:06,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:42:06,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:42:06,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:42:06,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:42:06,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:42:06,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:42:06,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:42:06,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:42:06,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:42:06,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:42:06,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:42:06,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:42:06,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:42:06,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:42:06,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:42:06,713 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:42:06,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:42:06,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:42:06,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:42:06,743 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:42:06,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:42:06,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:42:06,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:42:06,749 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:42:06,749 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:42:06,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:42:06,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:42:06,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:42:06,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:42:06,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:42:06,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:42:06,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:42:06,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:42:06,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:42:06,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:42:06,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:42:06,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:42:06,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:42:06,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:42:06,762 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 00:42:06,776 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:42:06,776 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:42:06,778 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:42:06,779 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:42:06,779 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:42:06,779 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:42:06,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:42:06,780 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:42:06,780 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:42:06,780 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:42:06,781 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:42:06,781 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:42:06,781 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:42:06,782 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:42:06,782 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:42:06,782 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:42:06,783 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:42:06,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:42:06,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:42:06,783 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:42:06,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:42:06,784 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:42:06,784 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-07 00:42:07,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:42:07,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:42:07,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:42:07,180 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:42:07,181 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:42:07,182 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i20_o20-2.c [2020-11-07 00:42:07,279 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b376d6f53/48587892cc18496d9ee255204496053f/FLAG9c416ee2c [2020-11-07 00:42:07,932 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:42:07,933 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i20_o20-2.c [2020-11-07 00:42:07,940 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b376d6f53/48587892cc18496d9ee255204496053f/FLAG9c416ee2c [2020-11-07 00:42:08,333 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b376d6f53/48587892cc18496d9ee255204496053f [2020-11-07 00:42:08,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:42:08,344 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:42:08,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:42:08,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:42:08,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:42:08,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:42:08" (1/1) ... [2020-11-07 00:42:08,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2acbae04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:08, skipping insertion in model container [2020-11-07 00:42:08,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:42:08" (1/1) ... [2020-11-07 00:42:08,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:42:08,379 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:42:08,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:42:08,574 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:42:08,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:42:08,607 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:42:08,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:08 WrapperNode [2020-11-07 00:42:08,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:42:08,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:42:08,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:42:08,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:42:08,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:08" (1/1) ... [2020-11-07 00:42:08,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:08" (1/1) ... [2020-11-07 00:42:08,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:08" (1/1) ... [2020-11-07 00:42:08,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:08" (1/1) ... [2020-11-07 00:42:08,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:08" (1/1) ... [2020-11-07 00:42:08,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:08" (1/1) ... [2020-11-07 00:42:08,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:08" (1/1) ... [2020-11-07 00:42:08,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:42:08,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:42:08,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:42:08,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:42:08,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:42:08,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:42:08,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:42:08,739 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:42:08,739 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-11-07 00:42:08,740 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:42:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:42:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:42:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:42:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:42:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:42:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-11-07 00:42:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:42:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:42:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:42:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:42:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:42:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:42:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:42:09,167 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:42:09,168 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:42:09,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:42:09 BoogieIcfgContainer [2020-11-07 00:42:09,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:42:09,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:42:09,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:42:09,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:42:09,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:42:08" (1/3) ... [2020-11-07 00:42:09,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400406fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:42:09, skipping insertion in model container [2020-11-07 00:42:09,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:08" (2/3) ... [2020-11-07 00:42:09,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400406fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:42:09, skipping insertion in model container [2020-11-07 00:42:09,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:42:09" (3/3) ... [2020-11-07 00:42:09,181 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i20_o20-2.c [2020-11-07 00:42:09,216 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:42:09,221 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:42:09,237 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:42:09,281 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:42:09,281 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:42:09,281 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:42:09,281 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:42:09,281 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:42:09,282 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:42:09,282 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:42:09,282 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:42:09,308 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-11-07 00:42:09,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 00:42:09,326 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:09,328 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-11-07 00:42:09,329 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:09,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:09,345 INFO L82 PathProgramCache]: Analyzing trace with hash -742560695, now seen corresponding path program 1 times [2020-11-07 00:42:09,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:09,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [125570416] [2020-11-07 00:42:09,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:09,477 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:09,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:09,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:09,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:42:09,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [125570416] [2020-11-07 00:42:09,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:09,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:42:09,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249564130] [2020-11-07 00:42:09,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:42:09,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:09,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:42:09,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:42:09,963 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2020-11-07 00:42:10,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:10,361 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-11-07 00:42:10,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:42:10,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 00:42:10,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:10,395 INFO L225 Difference]: With dead ends: 52 [2020-11-07 00:42:10,395 INFO L226 Difference]: Without dead ends: 32 [2020-11-07 00:42:10,410 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:42:10,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-11-07 00:42:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-11-07 00:42:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-07 00:42:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-11-07 00:42:10,510 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-11-07 00:42:10,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:10,512 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-11-07 00:42:10,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:42:10,513 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-11-07 00:42:10,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-07 00:42:10,517 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:10,518 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-11-07 00:42:10,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:42:10,518 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:10,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:10,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1024612499, now seen corresponding path program 1 times [2020-11-07 00:42:10,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:10,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [5649227] [2020-11-07 00:42:10,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:10,534 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:10,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:10,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:10,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:10,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 00:42:10,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [5649227] [2020-11-07 00:42:10,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:10,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:42:10,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456457728] [2020-11-07 00:42:10,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:42:10,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:10,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:42:10,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:42:10,770 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2020-11-07 00:42:11,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:11,030 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-11-07 00:42:11,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:42:11,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-11-07 00:42:11,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:11,033 INFO L225 Difference]: With dead ends: 44 [2020-11-07 00:42:11,033 INFO L226 Difference]: Without dead ends: 37 [2020-11-07 00:42:11,035 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:42:11,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-07 00:42:11,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-07 00:42:11,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 00:42:11,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-11-07 00:42:11,049 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2020-11-07 00:42:11,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:11,050 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-11-07 00:42:11,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:42:11,050 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-11-07 00:42:11,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-07 00:42:11,052 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:11,052 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-11-07 00:42:11,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:42:11,053 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:11,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:11,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1157111945, now seen corresponding path program 2 times [2020-11-07 00:42:11,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:11,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1706035926] [2020-11-07 00:42:11,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:11,057 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:11,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:11,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:11,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:11,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:11,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-07 00:42:11,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1706035926] [2020-11-07 00:42:11,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:11,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:42:11,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128856218] [2020-11-07 00:42:11,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:42:11,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:11,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:42:11,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:42:11,271 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-11-07 00:42:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:11,598 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-11-07 00:42:11,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:42:11,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-11-07 00:42:11,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:11,601 INFO L225 Difference]: With dead ends: 49 [2020-11-07 00:42:11,601 INFO L226 Difference]: Without dead ends: 42 [2020-11-07 00:42:11,602 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:42:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-07 00:42:11,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-07 00:42:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-07 00:42:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-11-07 00:42:11,616 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2020-11-07 00:42:11,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:11,617 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-11-07 00:42:11,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:42:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-11-07 00:42:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-07 00:42:11,619 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:11,619 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-11-07 00:42:11,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:42:11,619 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:11,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:11,620 INFO L82 PathProgramCache]: Analyzing trace with hash 2083092563, now seen corresponding path program 3 times [2020-11-07 00:42:11,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:11,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1552176490] [2020-11-07 00:42:11,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:11,623 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:11,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:11,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:11,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:11,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:11,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:11,823 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-07 00:42:11,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1552176490] [2020-11-07 00:42:11,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:11,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:42:11,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658753792] [2020-11-07 00:42:11,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:42:11,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:11,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:42:11,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:42:11,826 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-11-07 00:42:12,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:12,210 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-11-07 00:42:12,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:42:12,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-11-07 00:42:12,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:12,213 INFO L225 Difference]: With dead ends: 54 [2020-11-07 00:42:12,213 INFO L226 Difference]: Without dead ends: 47 [2020-11-07 00:42:12,214 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:42:12,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-07 00:42:12,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-11-07 00:42:12,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-07 00:42:12,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-11-07 00:42:12,229 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 49 [2020-11-07 00:42:12,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:12,229 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-11-07 00:42:12,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:42:12,229 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-11-07 00:42:12,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-07 00:42:12,231 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:12,232 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-11-07 00:42:12,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:42:12,232 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:12,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:12,233 INFO L82 PathProgramCache]: Analyzing trace with hash 2025718985, now seen corresponding path program 4 times [2020-11-07 00:42:12,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:12,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [311375818] [2020-11-07 00:42:12,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:12,236 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:12,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:12,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:12,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:12,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:12,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:12,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:12,539 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-07 00:42:12,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [311375818] [2020-11-07 00:42:12,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:12,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:42:12,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740408582] [2020-11-07 00:42:12,541 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:42:12,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:12,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:42:12,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:42:12,543 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2020-11-07 00:42:13,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:13,052 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-11-07 00:42:13,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:42:13,053 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-11-07 00:42:13,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:13,055 INFO L225 Difference]: With dead ends: 59 [2020-11-07 00:42:13,055 INFO L226 Difference]: Without dead ends: 52 [2020-11-07 00:42:13,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:42:13,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-07 00:42:13,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-11-07 00:42:13,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-11-07 00:42:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-11-07 00:42:13,075 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 57 [2020-11-07 00:42:13,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:13,075 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-11-07 00:42:13,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:42:13,076 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-11-07 00:42:13,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 00:42:13,077 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:13,077 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-11-07 00:42:13,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:42:13,078 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:13,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:13,078 INFO L82 PathProgramCache]: Analyzing trace with hash 2086365203, now seen corresponding path program 5 times [2020-11-07 00:42:13,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:13,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [790030323] [2020-11-07 00:42:13,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:13,081 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:13,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:13,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:13,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:13,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:13,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:13,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:13,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:13,378 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 00:42:13,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [790030323] [2020-11-07 00:42:13,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:13,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:42:13,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129644909] [2020-11-07 00:42:13,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:42:13,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:13,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:42:13,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:42:13,381 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 11 states. [2020-11-07 00:42:13,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:13,869 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-11-07 00:42:13,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:42:13,869 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2020-11-07 00:42:13,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:13,872 INFO L225 Difference]: With dead ends: 64 [2020-11-07 00:42:13,872 INFO L226 Difference]: Without dead ends: 57 [2020-11-07 00:42:13,874 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-11-07 00:42:13,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-07 00:42:13,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-11-07 00:42:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-07 00:42:13,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-11-07 00:42:13,911 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 65 [2020-11-07 00:42:13,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:13,911 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-11-07 00:42:13,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:42:13,912 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-11-07 00:42:13,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 00:42:13,913 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:13,913 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-11-07 00:42:13,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:42:13,914 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:13,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:13,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1881990903, now seen corresponding path program 6 times [2020-11-07 00:42:13,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:13,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1326696001] [2020-11-07 00:42:13,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:13,918 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:13,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:13,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:14,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:14,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:14,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:14,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:14,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:14,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:14,185 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-11-07 00:42:14,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1326696001] [2020-11-07 00:42:14,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:14,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:42:14,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101957837] [2020-11-07 00:42:14,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:42:14,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:14,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:42:14,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:42:14,188 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2020-11-07 00:42:14,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:14,762 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-11-07 00:42:14,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 00:42:14,763 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-11-07 00:42:14,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:14,765 INFO L225 Difference]: With dead ends: 69 [2020-11-07 00:42:14,765 INFO L226 Difference]: Without dead ends: 62 [2020-11-07 00:42:14,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-11-07 00:42:14,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-07 00:42:14,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-11-07 00:42:14,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-07 00:42:14,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2020-11-07 00:42:14,785 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 73 [2020-11-07 00:42:14,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:14,786 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2020-11-07 00:42:14,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:42:14,786 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2020-11-07 00:42:14,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 00:42:14,788 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:14,788 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-11-07 00:42:14,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:42:14,788 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:14,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:14,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1486608429, now seen corresponding path program 7 times [2020-11-07 00:42:14,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:14,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1654542523] [2020-11-07 00:42:14,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:14,793 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:14,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:14,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:14,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:14,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:15,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:15,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:15,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:15,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:15,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:15,169 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-11-07 00:42:15,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1654542523] [2020-11-07 00:42:15,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:15,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 00:42:15,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432279404] [2020-11-07 00:42:15,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 00:42:15,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:15,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 00:42:15,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:42:15,172 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 13 states. [2020-11-07 00:42:15,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:15,810 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-11-07 00:42:15,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 00:42:15,811 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2020-11-07 00:42:15,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:15,813 INFO L225 Difference]: With dead ends: 74 [2020-11-07 00:42:15,813 INFO L226 Difference]: Without dead ends: 67 [2020-11-07 00:42:15,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-11-07 00:42:15,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-11-07 00:42:15,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-11-07 00:42:15,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-07 00:42:15,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-11-07 00:42:15,832 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 81 [2020-11-07 00:42:15,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:15,832 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-11-07 00:42:15,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 00:42:15,833 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-11-07 00:42:15,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-07 00:42:15,834 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:15,835 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-11-07 00:42:15,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:42:15,835 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:15,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:15,836 INFO L82 PathProgramCache]: Analyzing trace with hash -2047124151, now seen corresponding path program 8 times [2020-11-07 00:42:15,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:15,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1752966507] [2020-11-07 00:42:15,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:15,839 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:15,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:15,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:15,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:15,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:16,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:16,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:16,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:16,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:16,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:16,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:16,185 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-07 00:42:16,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1752966507] [2020-11-07 00:42:16,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:16,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-07 00:42:16,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866661760] [2020-11-07 00:42:16,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 00:42:16,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:16,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 00:42:16,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:42:16,189 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 14 states. [2020-11-07 00:42:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:16,872 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-11-07 00:42:16,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 00:42:16,873 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2020-11-07 00:42:16,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:16,876 INFO L225 Difference]: With dead ends: 79 [2020-11-07 00:42:16,878 INFO L226 Difference]: Without dead ends: 72 [2020-11-07 00:42:16,879 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-11-07 00:42:16,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-11-07 00:42:16,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-11-07 00:42:16,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-07 00:42:16,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-11-07 00:42:16,905 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 89 [2020-11-07 00:42:16,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:16,906 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-11-07 00:42:16,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 00:42:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-11-07 00:42:16,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-07 00:42:16,908 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:16,908 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-11-07 00:42:16,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:42:16,908 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:16,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:16,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1811920787, now seen corresponding path program 9 times [2020-11-07 00:42:16,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:16,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [523545202] [2020-11-07 00:42:16,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:16,912 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:16,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:16,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:17,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:17,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:17,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:17,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:17,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:17,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:17,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:17,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:17,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-11-07 00:42:17,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [523545202] [2020-11-07 00:42:17,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:17,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:42:17,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837139228] [2020-11-07 00:42:17,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:42:17,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:17,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:42:17,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:42:17,319 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2020-11-07 00:42:18,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:18,080 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-11-07 00:42:18,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:42:18,081 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2020-11-07 00:42:18,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:18,082 INFO L225 Difference]: With dead ends: 84 [2020-11-07 00:42:18,083 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 00:42:18,084 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-11-07 00:42:18,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 00:42:18,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-11-07 00:42:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-07 00:42:18,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2020-11-07 00:42:18,114 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 97 [2020-11-07 00:42:18,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:18,115 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2020-11-07 00:42:18,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:42:18,115 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2020-11-07 00:42:18,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-11-07 00:42:18,117 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:18,117 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-11-07 00:42:18,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:42:18,118 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:18,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:18,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1912263049, now seen corresponding path program 10 times [2020-11-07 00:42:18,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:18,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [465198986] [2020-11-07 00:42:18,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:18,124 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:18,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:18,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:18,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:18,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:18,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:18,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:18,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:18,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:18,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:18,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:18,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:18,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:18,623 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-11-07 00:42:18,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [465198986] [2020-11-07 00:42:18,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:18,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-07 00:42:18,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553264993] [2020-11-07 00:42:18,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 00:42:18,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:18,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 00:42:18,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-11-07 00:42:18,628 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 16 states. [2020-11-07 00:42:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:19,410 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-11-07 00:42:19,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 00:42:19,411 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-11-07 00:42:19,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:19,412 INFO L225 Difference]: With dead ends: 89 [2020-11-07 00:42:19,412 INFO L226 Difference]: Without dead ends: 82 [2020-11-07 00:42:19,414 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-11-07 00:42:19,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-11-07 00:42:19,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-11-07 00:42:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-07 00:42:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2020-11-07 00:42:19,437 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 105 [2020-11-07 00:42:19,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:19,437 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2020-11-07 00:42:19,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 00:42:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2020-11-07 00:42:19,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-07 00:42:19,439 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:19,439 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-11-07 00:42:19,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:42:19,439 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:19,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:19,440 INFO L82 PathProgramCache]: Analyzing trace with hash -34990253, now seen corresponding path program 11 times [2020-11-07 00:42:19,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:19,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [269212951] [2020-11-07 00:42:19,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:19,445 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:19,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:19,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:19,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:19,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:19,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:19,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:19,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:19,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:19,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:19,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:19,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:19,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:19,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-11-07 00:42:20,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [269212951] [2020-11-07 00:42:20,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:20,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-07 00:42:20,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628869464] [2020-11-07 00:42:20,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 00:42:20,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:20,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 00:42:20,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:42:20,025 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 17 states. [2020-11-07 00:42:20,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:20,925 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-11-07 00:42:20,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 00:42:20,928 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 113 [2020-11-07 00:42:20,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:20,930 INFO L225 Difference]: With dead ends: 94 [2020-11-07 00:42:20,930 INFO L226 Difference]: Without dead ends: 87 [2020-11-07 00:42:20,932 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-11-07 00:42:20,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-07 00:42:20,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-11-07 00:42:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-11-07 00:42:20,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2020-11-07 00:42:20,947 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 113 [2020-11-07 00:42:20,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:20,948 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2020-11-07 00:42:20,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 00:42:20,948 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2020-11-07 00:42:20,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-11-07 00:42:20,949 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:20,950 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-11-07 00:42:20,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 00:42:20,950 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:20,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:20,951 INFO L82 PathProgramCache]: Analyzing trace with hash -980060727, now seen corresponding path program 12 times [2020-11-07 00:42:20,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:20,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1127080322] [2020-11-07 00:42:20,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:20,954 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-11-07 00:42:21,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1127080322] [2020-11-07 00:42:21,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:21,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-11-07 00:42:21,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402230099] [2020-11-07 00:42:21,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 00:42:21,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:21,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 00:42:21,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-11-07 00:42:21,646 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 18 states. [2020-11-07 00:42:22,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:22,557 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-11-07 00:42:22,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 00:42:22,558 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2020-11-07 00:42:22,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:22,560 INFO L225 Difference]: With dead ends: 99 [2020-11-07 00:42:22,560 INFO L226 Difference]: Without dead ends: 92 [2020-11-07 00:42:22,561 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2020-11-07 00:42:22,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-07 00:42:22,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-11-07 00:42:22,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-07 00:42:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2020-11-07 00:42:22,575 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 121 [2020-11-07 00:42:22,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:22,575 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2020-11-07 00:42:22,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 00:42:22,576 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2020-11-07 00:42:22,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-11-07 00:42:22,577 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:22,577 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-11-07 00:42:22,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 00:42:22,578 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:22,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:22,578 INFO L82 PathProgramCache]: Analyzing trace with hash 366954259, now seen corresponding path program 13 times [2020-11-07 00:42:22,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:22,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1463687551] [2020-11-07 00:42:22,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:22,581 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:22,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:22,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:22,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:22,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:22,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:22,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:22,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:22,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:22,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:23,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:23,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:23,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:23,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:23,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:23,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:23,318 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-11-07 00:42:23,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1463687551] [2020-11-07 00:42:23,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:23,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-07 00:42:23,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296223364] [2020-11-07 00:42:23,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 00:42:23,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:23,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 00:42:23,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-11-07 00:42:23,321 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 19 states. [2020-11-07 00:42:24,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:24,327 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-11-07 00:42:24,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 00:42:24,327 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2020-11-07 00:42:24,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:24,329 INFO L225 Difference]: With dead ends: 104 [2020-11-07 00:42:24,329 INFO L226 Difference]: Without dead ends: 97 [2020-11-07 00:42:24,331 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-11-07 00:42:24,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-11-07 00:42:24,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-11-07 00:42:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-07 00:42:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2020-11-07 00:42:24,346 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 129 [2020-11-07 00:42:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:24,346 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2020-11-07 00:42:24,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 00:42:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2020-11-07 00:42:24,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-07 00:42:24,348 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:24,349 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-11-07 00:42:24,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 00:42:24,349 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:24,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:24,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1919989239, now seen corresponding path program 14 times [2020-11-07 00:42:24,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:24,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [731215358] [2020-11-07 00:42:24,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:24,353 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:24,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-11-07 00:42:25,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [731215358] [2020-11-07 00:42:25,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:25,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-11-07 00:42:25,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393312246] [2020-11-07 00:42:25,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 00:42:25,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:25,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 00:42:25,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-11-07 00:42:25,155 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 20 states. [2020-11-07 00:42:26,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:26,266 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2020-11-07 00:42:26,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 00:42:26,267 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 137 [2020-11-07 00:42:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:26,269 INFO L225 Difference]: With dead ends: 109 [2020-11-07 00:42:26,269 INFO L226 Difference]: Without dead ends: 102 [2020-11-07 00:42:26,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=450, Invalid=882, Unknown=0, NotChecked=0, Total=1332 [2020-11-07 00:42:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-11-07 00:42:26,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-11-07 00:42:26,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-11-07 00:42:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2020-11-07 00:42:26,287 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 137 [2020-11-07 00:42:26,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:26,288 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2020-11-07 00:42:26,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 00:42:26,288 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2020-11-07 00:42:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-11-07 00:42:26,290 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:26,290 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-11-07 00:42:26,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 00:42:26,291 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:26,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:26,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1315223853, now seen corresponding path program 15 times [2020-11-07 00:42:26,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:26,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1051656799] [2020-11-07 00:42:26,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:26,294 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:26,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-11-07 00:42:27,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1051656799] [2020-11-07 00:42:27,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:27,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-11-07 00:42:27,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910576643] [2020-11-07 00:42:27,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-07 00:42:27,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:27,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-07 00:42:27,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2020-11-07 00:42:27,091 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 21 states. [2020-11-07 00:42:28,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:28,208 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2020-11-07 00:42:28,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 00:42:28,209 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 145 [2020-11-07 00:42:28,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:28,215 INFO L225 Difference]: With dead ends: 114 [2020-11-07 00:42:28,215 INFO L226 Difference]: Without dead ends: 107 [2020-11-07 00:42:28,216 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=503, Invalid=979, Unknown=0, NotChecked=0, Total=1482 [2020-11-07 00:42:28,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-11-07 00:42:28,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-11-07 00:42:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-11-07 00:42:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2020-11-07 00:42:28,238 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 145 [2020-11-07 00:42:28,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:28,238 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2020-11-07 00:42:28,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-07 00:42:28,239 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2020-11-07 00:42:28,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-11-07 00:42:28,241 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:28,241 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:42:28,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 00:42:28,241 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:28,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:28,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1314107831, now seen corresponding path program 16 times [2020-11-07 00:42:28,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:28,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [754367718] [2020-11-07 00:42:28,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:28,246 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:28,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-11-07 00:42:29,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [754367718] [2020-11-07 00:42:29,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:29,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-11-07 00:42:29,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879584290] [2020-11-07 00:42:29,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 00:42:29,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:29,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 00:42:29,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2020-11-07 00:42:29,117 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 22 states. [2020-11-07 00:42:30,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:30,328 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2020-11-07 00:42:30,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 00:42:30,336 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 153 [2020-11-07 00:42:30,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:30,338 INFO L225 Difference]: With dead ends: 119 [2020-11-07 00:42:30,338 INFO L226 Difference]: Without dead ends: 112 [2020-11-07 00:42:30,339 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=559, Invalid=1081, Unknown=0, NotChecked=0, Total=1640 [2020-11-07 00:42:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-07 00:42:30,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-11-07 00:42:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-07 00:42:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2020-11-07 00:42:30,355 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 153 [2020-11-07 00:42:30,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:30,356 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2020-11-07 00:42:30,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 00:42:30,356 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2020-11-07 00:42:30,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-11-07 00:42:30,358 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:30,358 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:42:30,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 00:42:30,359 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:30,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:30,359 INFO L82 PathProgramCache]: Analyzing trace with hash -740682093, now seen corresponding path program 17 times [2020-11-07 00:42:30,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:30,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [995654111] [2020-11-07 00:42:30,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:30,362 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:30,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:31,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:31,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:31,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:31,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:31,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:31,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-11-07 00:42:31,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [995654111] [2020-11-07 00:42:31,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:31,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-11-07 00:42:31,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620290385] [2020-11-07 00:42:31,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 00:42:31,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:31,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 00:42:31,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2020-11-07 00:42:31,422 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 23 states. [2020-11-07 00:42:32,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:32,636 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2020-11-07 00:42:32,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 00:42:32,641 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 161 [2020-11-07 00:42:32,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:32,642 INFO L225 Difference]: With dead ends: 124 [2020-11-07 00:42:32,643 INFO L226 Difference]: Without dead ends: 117 [2020-11-07 00:42:32,644 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=618, Invalid=1188, Unknown=0, NotChecked=0, Total=1806 [2020-11-07 00:42:32,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-11-07 00:42:32,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2020-11-07 00:42:32,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-11-07 00:42:32,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2020-11-07 00:42:32,661 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 161 [2020-11-07 00:42:32,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:32,662 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2020-11-07 00:42:32,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 00:42:32,662 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2020-11-07 00:42:32,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-11-07 00:42:32,664 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:32,664 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:42:32,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 00:42:32,665 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:32,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:32,665 INFO L82 PathProgramCache]: Analyzing trace with hash 883982985, now seen corresponding path program 18 times [2020-11-07 00:42:32,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:32,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2077299521] [2020-11-07 00:42:32,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:32,668 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:32,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:33,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:33,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:33,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:33,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:33,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:33,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:33,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:33,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:33,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:33,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:33,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:33,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:33,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:33,730 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-11-07 00:42:33,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2077299521] [2020-11-07 00:42:33,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:33,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-11-07 00:42:33,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863285538] [2020-11-07 00:42:33,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 00:42:33,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:33,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 00:42:33,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2020-11-07 00:42:33,733 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 24 states. [2020-11-07 00:42:35,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:35,072 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2020-11-07 00:42:35,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 00:42:35,072 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 169 [2020-11-07 00:42:35,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:35,075 INFO L225 Difference]: With dead ends: 129 [2020-11-07 00:42:35,075 INFO L226 Difference]: Without dead ends: 122 [2020-11-07 00:42:35,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=680, Invalid=1300, Unknown=0, NotChecked=0, Total=1980 [2020-11-07 00:42:35,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-11-07 00:42:35,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-11-07 00:42:35,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-11-07 00:42:35,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2020-11-07 00:42:35,097 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 169 [2020-11-07 00:42:35,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:35,097 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2020-11-07 00:42:35,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 00:42:35,098 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2020-11-07 00:42:35,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-11-07 00:42:35,100 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:35,100 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:42:35,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-07 00:42:35,101 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:35,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:35,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1146598995, now seen corresponding path program 19 times [2020-11-07 00:42:35,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:35,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [245070685] [2020-11-07 00:42:35,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:35,104 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:35,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-11-07 00:42:36,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [245070685] [2020-11-07 00:42:36,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:36,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-11-07 00:42:36,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932357142] [2020-11-07 00:42:36,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-07 00:42:36,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:36,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-07 00:42:36,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=363, Unknown=0, NotChecked=0, Total=600 [2020-11-07 00:42:36,133 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 25 states. [2020-11-07 00:42:37,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:37,510 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2020-11-07 00:42:37,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 00:42:37,511 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 177 [2020-11-07 00:42:37,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:37,513 INFO L225 Difference]: With dead ends: 134 [2020-11-07 00:42:37,513 INFO L226 Difference]: Without dead ends: 127 [2020-11-07 00:42:37,515 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=745, Invalid=1417, Unknown=0, NotChecked=0, Total=2162 [2020-11-07 00:42:37,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-11-07 00:42:37,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-11-07 00:42:37,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-07 00:42:37,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2020-11-07 00:42:37,532 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 177 [2020-11-07 00:42:37,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:37,532 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2020-11-07 00:42:37,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-07 00:42:37,533 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2020-11-07 00:42:37,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-11-07 00:42:37,535 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:37,535 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:42:37,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-07 00:42:37,536 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:37,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:37,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1952442057, now seen corresponding path program 20 times [2020-11-07 00:42:37,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:37,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [527208826] [2020-11-07 00:42:37,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:37,539 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:42:37,569 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:42:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 00:42:37,612 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 00:42:37,670 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 00:42:37,670 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 00:42:37,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-07 00:42:37,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:42:37 BoogieIcfgContainer [2020-11-07 00:42:37,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:42:37,703 INFO L168 Benchmark]: Toolchain (without parser) took 29362.97 ms. Allocated memory was 157.3 MB in the beginning and 393.2 MB in the end (delta: 235.9 MB). Free memory was 134.5 MB in the beginning and 248.4 MB in the end (delta: -113.9 MB). Peak memory consumption was 122.9 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:37,703 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 157.3 MB. Free memory was 131.9 MB in the beginning and 131.8 MB in the end (delta: 80.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:42:37,704 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.23 ms. Allocated memory is still 157.3 MB. Free memory was 133.9 MB in the beginning and 124.9 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:37,704 INFO L168 Benchmark]: Boogie Preprocessor took 35.18 ms. Allocated memory is still 157.3 MB. Free memory was 124.9 MB in the beginning and 123.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:37,705 INFO L168 Benchmark]: RCFGBuilder took 525.10 ms. Allocated memory is still 157.3 MB. Free memory was 123.5 MB in the beginning and 110.8 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:37,705 INFO L168 Benchmark]: TraceAbstraction took 28527.31 ms. Allocated memory was 157.3 MB in the beginning and 393.2 MB in the end (delta: 235.9 MB). Free memory was 110.3 MB in the beginning and 248.4 MB in the end (delta: -138.0 MB). Peak memory consumption was 98.8 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:37,708 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 157.3 MB. Free memory was 131.9 MB in the beginning and 131.8 MB in the end (delta: 80.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 262.23 ms. Allocated memory is still 157.3 MB. Free memory was 133.9 MB in the beginning and 124.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 35.18 ms. Allocated memory is still 157.3 MB. Free memory was 124.9 MB in the beginning and 123.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 525.10 ms. Allocated memory is still 157.3 MB. Free memory was 123.5 MB in the beginning and 110.8 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 28527.31 ms. Allocated memory was 157.3 MB in the beginning and 393.2 MB in the end (delta: 235.9 MB). Free memory was 110.3 MB in the beginning and 248.4 MB in the end (delta: -138.0 MB). Peak memory consumption was 98.8 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 = 20; [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 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; [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 == 20 [L15] CALL reach_error() [L4] __assert_fail("0", "id_i20_o20-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: 28.3s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 543 SDtfs, 2095 SDslu, 1236 SDs, 0 SdLazy, 2217 SolverSat, 630 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 982 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 521 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3083 ImplicationChecksByTransitivity, 14.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 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...