/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:05:54,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:05:54,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:05:55,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:05:55,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:05:55,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:05:55,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:05:55,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:05:55,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:05:55,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:05:55,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:05:55,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:05:55,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:05:55,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:05:55,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:05:55,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:05:55,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:05:55,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:05:55,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:05:55,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:05:55,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:05:55,113 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:05:55,115 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:05:55,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:05:55,126 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:05:55,126 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:05:55,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:05:55,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:05:55,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:05:55,131 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:05:55,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:05:55,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:05:55,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:05:55,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:05:55,136 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:05:55,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:05:55,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:05:55,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:05:55,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:05:55,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:05:55,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:05:55,142 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 05:05:55,167 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:05:55,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:05:55,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:05:55,173 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:05:55,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:05:55,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:05:55,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:05:55,174 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:05:55,174 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:05:55,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:05:55,176 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:05:55,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:05:55,177 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:05:55,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:05:55,179 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:05:55,179 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:05:55,179 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:05:55,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:05:55,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:05:55,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:05:55,180 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:05:55,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:05:55,181 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 05:05:55,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:05:55,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:05:55,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:05:55,602 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:05:55,603 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:05:55,604 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_5-2.c [2020-11-07 05:05:55,682 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41aa7b9b9/e42f8915eaa34774aa874b954b903d8e/FLAG5280a4ad4 [2020-11-07 05:05:56,286 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:05:56,287 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_5-2.c [2020-11-07 05:05:56,295 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41aa7b9b9/e42f8915eaa34774aa874b954b903d8e/FLAG5280a4ad4 [2020-11-07 05:05:56,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41aa7b9b9/e42f8915eaa34774aa874b954b903d8e [2020-11-07 05:05:56,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:05:56,664 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:05:56,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:05:56,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:05:56,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:05:56,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:05:56" (1/1) ... [2020-11-07 05:05:56,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e1a8fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:56, skipping insertion in model container [2020-11-07 05:05:56,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:05:56" (1/1) ... [2020-11-07 05:05:56,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:05:56,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:05:56,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:05:56,876 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:05:56,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:05:56,911 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:05:56,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:56 WrapperNode [2020-11-07 05:05:56,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:05:56,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:05:56,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:05:56,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:05:56,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:56" (1/1) ... [2020-11-07 05:05:56,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:56" (1/1) ... [2020-11-07 05:05:56,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:56" (1/1) ... [2020-11-07 05:05:56,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:56" (1/1) ... [2020-11-07 05:05:56,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:56" (1/1) ... [2020-11-07 05:05:56,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:56" (1/1) ... [2020-11-07 05:05:56,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:56" (1/1) ... [2020-11-07 05:05:56,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:05:56,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:05:56,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:05:56,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:05:56,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:56" (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 05:05:57,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:05:57,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:05:57,032 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:05:57,032 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-11-07 05:05:57,032 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:05:57,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:05:57,033 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:05:57,033 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:05:57,033 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:05:57,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:05:57,033 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-11-07 05:05:57,034 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:05:57,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:05:57,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:05:57,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:05:57,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:05:57,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:05:57,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:05:57,566 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:05:57,568 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 05:05:57,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:05:57 BoogieIcfgContainer [2020-11-07 05:05:57,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:05:57,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:05:57,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:05:57,580 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:05:57,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:05:56" (1/3) ... [2020-11-07 05:05:57,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b87a75e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:05:57, skipping insertion in model container [2020-11-07 05:05:57,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:56" (2/3) ... [2020-11-07 05:05:57,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b87a75e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:05:57, skipping insertion in model container [2020-11-07 05:05:57,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:05:57" (3/3) ... [2020-11-07 05:05:57,586 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_5-2.c [2020-11-07 05:05:57,604 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:05:57,609 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:05:57,624 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:05:57,662 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:05:57,662 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:05:57,662 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:05:57,662 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:05:57,662 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:05:57,663 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:05:57,663 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:05:57,663 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:05:57,683 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-11-07 05:05:57,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 05:05:57,697 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:57,698 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 05:05:57,699 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:57,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:57,713 INFO L82 PathProgramCache]: Analyzing trace with hash -32329728, now seen corresponding path program 1 times [2020-11-07 05:05:57,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:57,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2003733644] [2020-11-07 05:05:57,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:58,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:58,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:58,123 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 05:05:58,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2003733644] [2020-11-07 05:05:58,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:05:58,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:05:58,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106894634] [2020-11-07 05:05:58,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:05:58,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:58,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:05:58,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:05:58,152 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 6 states. [2020-11-07 05:05:58,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:58,631 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2020-11-07 05:05:58,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:05:58,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 05:05:58,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:58,654 INFO L225 Difference]: With dead ends: 60 [2020-11-07 05:05:58,655 INFO L226 Difference]: Without dead ends: 37 [2020-11-07 05:05:58,666 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 05:05:58,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-07 05:05:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-07 05:05:58,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 05:05:58,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-11-07 05:05:58,736 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 25 [2020-11-07 05:05:58,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:58,737 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-07 05:05:58,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:05:58,737 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-11-07 05:05:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-07 05:05:58,740 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:58,740 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:58,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:05:58,740 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:58,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:58,741 INFO L82 PathProgramCache]: Analyzing trace with hash 950139466, now seen corresponding path program 1 times [2020-11-07 05:05:58,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:58,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1369587146] [2020-11-07 05:05:58,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:58,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:58,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:58,855 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 05:05:58,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1369587146] [2020-11-07 05:05:58,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:05:58,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:05:58,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554052880] [2020-11-07 05:05:58,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:05:58,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:58,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:05:58,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:05:58,860 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2020-11-07 05:05:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:59,145 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2020-11-07 05:05:59,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:05:59,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-11-07 05:05:59,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:59,148 INFO L225 Difference]: With dead ends: 46 [2020-11-07 05:05:59,148 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 05:05:59,149 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:05:59,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 05:05:59,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-11-07 05:05:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 05:05:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-11-07 05:05:59,163 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2020-11-07 05:05:59,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:59,164 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-11-07 05:05:59,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:05:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-11-07 05:05:59,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-07 05:05:59,166 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:59,167 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:59,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:05:59,167 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:59,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:59,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1810718643, now seen corresponding path program 1 times [2020-11-07 05:05:59,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:59,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [280441183] [2020-11-07 05:05:59,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:59,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:59,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:59,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:59,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-07 05:05:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 05:05:59,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [280441183] [2020-11-07 05:05:59,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:59,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:05:59,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096113225] [2020-11-07 05:05:59,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:05:59,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:59,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:05:59,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:05:59,400 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2020-11-07 05:05:59,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:05:59,663 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2020-11-07 05:05:59,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:05:59,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-11-07 05:05:59,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:05:59,667 INFO L225 Difference]: With dead ends: 62 [2020-11-07 05:05:59,667 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 05:05:59,668 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:05:59,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 05:05:59,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-07 05:05:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 05:05:59,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-11-07 05:05:59,683 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 42 [2020-11-07 05:05:59,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:05:59,683 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-11-07 05:05:59,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:05:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-11-07 05:05:59,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 05:05:59,686 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:05:59,686 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:05:59,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:05:59,686 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:05:59,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:05:59,687 INFO L82 PathProgramCache]: Analyzing trace with hash 195045207, now seen corresponding path program 1 times [2020-11-07 05:05:59,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:05:59,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [385060851] [2020-11-07 05:05:59,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:05:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:59,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:05:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:59,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:05:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:59,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:05:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:59,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:05:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:05:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 05:05:59,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [385060851] [2020-11-07 05:05:59,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:05:59,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:05:59,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297345194] [2020-11-07 05:05:59,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:05:59,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:05:59,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:05:59,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:05:59,832 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2020-11-07 05:06:00,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:00,176 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2020-11-07 05:06:00,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:06:00,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-11-07 05:06:00,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:00,179 INFO L225 Difference]: With dead ends: 66 [2020-11-07 05:06:00,180 INFO L226 Difference]: Without dead ends: 59 [2020-11-07 05:06:00,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:06:00,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-07 05:06:00,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-07 05:06:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-07 05:06:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2020-11-07 05:06:00,201 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 43 [2020-11-07 05:06:00,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:00,201 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2020-11-07 05:06:00,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:06:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2020-11-07 05:06:00,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 05:06:00,204 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:00,204 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 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 05:06:00,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:06:00,205 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:00,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:00,206 INFO L82 PathProgramCache]: Analyzing trace with hash -396245802, now seen corresponding path program 2 times [2020-11-07 05:06:00,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:00,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [72439312] [2020-11-07 05:06:00,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:00,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:00,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:00,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:00,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:00,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:00,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:00,433 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-07 05:06:00,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [72439312] [2020-11-07 05:06:00,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:00,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:06:00,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534531810] [2020-11-07 05:06:00,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:06:00,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:00,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:06:00,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:06:00,436 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 8 states. [2020-11-07 05:06:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:00,877 INFO L93 Difference]: Finished difference Result 118 states and 161 transitions. [2020-11-07 05:06:00,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:06:00,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-11-07 05:06:00,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:00,881 INFO L225 Difference]: With dead ends: 118 [2020-11-07 05:06:00,881 INFO L226 Difference]: Without dead ends: 73 [2020-11-07 05:06:00,883 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:06:00,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-07 05:06:00,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2020-11-07 05:06:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-07 05:06:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2020-11-07 05:06:00,904 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 60 [2020-11-07 05:06:00,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:00,905 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2020-11-07 05:06:00,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:06:00,905 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2020-11-07 05:06:00,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 05:06:00,908 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:00,908 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 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 05:06:00,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:06:00,908 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:00,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:00,909 INFO L82 PathProgramCache]: Analyzing trace with hash -13012784, now seen corresponding path program 3 times [2020-11-07 05:06:00,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:00,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [509973452] [2020-11-07 05:06:00,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:00,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:00,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:01,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:01,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:01,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:01,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:01,096 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-07 05:06:01,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [509973452] [2020-11-07 05:06:01,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:01,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:06:01,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886970981] [2020-11-07 05:06:01,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:06:01,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:01,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:06:01,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:06:01,099 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 8 states. [2020-11-07 05:06:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:01,690 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2020-11-07 05:06:01,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 05:06:01,695 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-11-07 05:06:01,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:01,702 INFO L225 Difference]: With dead ends: 96 [2020-11-07 05:06:01,702 INFO L226 Difference]: Without dead ends: 89 [2020-11-07 05:06:01,704 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:06:01,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-07 05:06:01,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2020-11-07 05:06:01,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-11-07 05:06:01,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2020-11-07 05:06:01,737 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 61 [2020-11-07 05:06:01,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:01,737 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2020-11-07 05:06:01,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:06:01,737 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2020-11-07 05:06:01,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-07 05:06:01,741 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:01,741 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:01,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:06:01,742 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:01,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:01,743 INFO L82 PathProgramCache]: Analyzing trace with hash 159854214, now seen corresponding path program 4 times [2020-11-07 05:06:01,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:01,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1066663736] [2020-11-07 05:06:01,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:01,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:01,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:01,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:01,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:01,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:01,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:02,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:02,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:02,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:02,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:02,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:02,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:02,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:02,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 36 proven. 197 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2020-11-07 05:06:02,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1066663736] [2020-11-07 05:06:02,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:02,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:06:02,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499625749] [2020-11-07 05:06:02,086 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:06:02,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:02,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:06:02,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:06:02,087 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand 9 states. [2020-11-07 05:06:02,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:02,821 INFO L93 Difference]: Finished difference Result 146 states and 199 transitions. [2020-11-07 05:06:02,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:06:02,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2020-11-07 05:06:02,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:02,832 INFO L225 Difference]: With dead ends: 146 [2020-11-07 05:06:02,832 INFO L226 Difference]: Without dead ends: 139 [2020-11-07 05:06:02,836 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:06:02,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-11-07 05:06:02,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 127. [2020-11-07 05:06:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-07 05:06:02,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 177 transitions. [2020-11-07 05:06:02,901 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 177 transitions. Word has length 132 [2020-11-07 05:06:02,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:02,902 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 177 transitions. [2020-11-07 05:06:02,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:06:02,902 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 177 transitions. [2020-11-07 05:06:02,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-11-07 05:06:02,909 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:02,909 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:02,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:06:02,909 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:02,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:02,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1497778840, now seen corresponding path program 5 times [2020-11-07 05:06:02,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:02,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [567745081] [2020-11-07 05:06:02,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:06:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:06:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-11-07 05:06:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 05:06:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:06:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:06:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 05:06:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:03,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 375 proven. 413 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2020-11-07 05:06:03,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [567745081] [2020-11-07 05:06:03,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:03,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 05:06:03,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165515489] [2020-11-07 05:06:03,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 05:06:03,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:03,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 05:06:03,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:06:03,558 INFO L87 Difference]: Start difference. First operand 127 states and 177 transitions. Second operand 14 states. [2020-11-07 05:06:05,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:05,249 INFO L93 Difference]: Finished difference Result 213 states and 326 transitions. [2020-11-07 05:06:05,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 05:06:05,250 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 202 [2020-11-07 05:06:05,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:05,252 INFO L225 Difference]: With dead ends: 213 [2020-11-07 05:06:05,256 INFO L226 Difference]: Without dead ends: 99 [2020-11-07 05:06:05,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=255, Invalid=867, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 05:06:05,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-11-07 05:06:05,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2020-11-07 05:06:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-11-07 05:06:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2020-11-07 05:06:05,304 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 202 [2020-11-07 05:06:05,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:05,307 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2020-11-07 05:06:05,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 05:06:05,307 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2020-11-07 05:06:05,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-11-07 05:06:05,311 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:05,311 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:05,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:06:05,312 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:05,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:05,312 INFO L82 PathProgramCache]: Analyzing trace with hash -799639331, now seen corresponding path program 6 times [2020-11-07 05:06:05,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:05,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [752730856] [2020-11-07 05:06:05,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:06:05,346 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:06:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:06:05,376 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:06:05,440 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 05:06:05,440 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 05:06:05,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:06:05,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:06:05 BoogieIcfgContainer [2020-11-07 05:06:05,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:06:05,574 INFO L168 Benchmark]: Toolchain (without parser) took 8911.97 ms. Allocated memory was 151.0 MB in the beginning and 218.1 MB in the end (delta: 67.1 MB). Free memory was 128.1 MB in the beginning and 80.0 MB in the end (delta: 48.1 MB). Peak memory consumption was 116.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:05,578 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 125.8 MB. Free memory was 95.8 MB in the beginning and 95.7 MB in the end (delta: 73.1 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:06:05,578 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.74 ms. Allocated memory is still 151.0 MB. Free memory was 127.5 MB in the beginning and 118.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:05,579 INFO L168 Benchmark]: Boogie Preprocessor took 35.42 ms. Allocated memory is still 151.0 MB. Free memory was 118.4 MB in the beginning and 117.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:05,580 INFO L168 Benchmark]: RCFGBuilder took 624.05 ms. Allocated memory is still 151.0 MB. Free memory was 117.1 MB in the beginning and 131.8 MB in the end (delta: -14.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:05,582 INFO L168 Benchmark]: TraceAbstraction took 7991.22 ms. Allocated memory was 151.0 MB in the beginning and 218.1 MB in the end (delta: 67.1 MB). Free memory was 131.1 MB in the beginning and 80.0 MB in the end (delta: 51.1 MB). Peak memory consumption was 119.7 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:05,592 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 125.8 MB. Free memory was 95.8 MB in the beginning and 95.7 MB in the end (delta: 73.1 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 240.74 ms. Allocated memory is still 151.0 MB. Free memory was 127.5 MB in the beginning and 118.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 35.42 ms. Allocated memory is still 151.0 MB. Free memory was 118.4 MB in the beginning and 117.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 624.05 ms. Allocated memory is still 151.0 MB. Free memory was 117.1 MB in the beginning and 131.8 MB in the end (delta: -14.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7991.22 ms. Allocated memory was 151.0 MB in the beginning and 218.1 MB in the end (delta: 67.1 MB). Free memory was 131.1 MB in the beginning and 80.0 MB in the end (delta: 51.1 MB). Peak memory consumption was 119.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = 5; VAL [x=5] [L27] CALL, EXPR fibo(x) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L27] RET, EXPR fibo(x) VAL [fibo(x)=5, x=5] [L27] int result = fibo(x); VAL [fibo(x)=5, result=5, x=5] [L28] COND TRUE result == 5 VAL [result=5, x=5] [L29] CALL reach_error() [L4] __assert_fail("0", "fibo_5-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.7s, OverallIterations: 9, TraceHistogramMax: 21, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 306 SDtfs, 527 SDslu, 473 SDs, 0 SdLazy, 1074 SolverSat, 276 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 45 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 740 NumberOfCodeBlocks, 740 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 583 ConstructedInterpolants, 0 QuantifiedInterpolants, 138061 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 1277/1932 InterpolantCoveringCapability, 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...