/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-b8ad66e [2020-10-24 00:53:36,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:53:36,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:53:36,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:53:36,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:53:36,236 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:53:36,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:53:36,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:53:36,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:53:36,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:53:36,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:53:36,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:53:36,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:53:36,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:53:36,251 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:53:36,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:53:36,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:53:36,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:53:36,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:53:36,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:53:36,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:53:36,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:53:36,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:53:36,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:53:36,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:53:36,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:53:36,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:53:36,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:53:36,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:53:36,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:53:36,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:53:36,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:53:36,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:53:36,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:53:36,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:53:36,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:53:36,304 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:53:36,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:53:36,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:53:36,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:53:36,307 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:53:36,308 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:53:36,322 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:53:36,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:53:36,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:53:36,325 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:53:36,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:53:36,326 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:53:36,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:53:36,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:53:36,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:53:36,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:53:36,327 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:53:36,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:53:36,328 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:53:36,328 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:53:36,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:53:36,328 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:53:36,329 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:53:36,329 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:53:36,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:53:36,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:53:36,330 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:53:36,330 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:53:36,331 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-10-24 00:53:36,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:53:36,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:53:36,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:53:36,805 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:53:36,806 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:53:36,807 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-10-24 00:53:36,910 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca97358a1/4afc8003018a44e59cbc12e44bed4004/FLAG01d4663c2 [2020-10-24 00:53:37,634 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:53:37,635 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_5-2.c [2020-10-24 00:53:37,644 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca97358a1/4afc8003018a44e59cbc12e44bed4004/FLAG01d4663c2 [2020-10-24 00:53:37,986 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca97358a1/4afc8003018a44e59cbc12e44bed4004 [2020-10-24 00:53:37,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:53:37,997 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:53:38,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:53:38,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:53:38,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:53:38,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:53:37" (1/1) ... [2020-10-24 00:53:38,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296912aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:38, skipping insertion in model container [2020-10-24 00:53:38,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:53:37" (1/1) ... [2020-10-24 00:53:38,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:53:38,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:53:38,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:53:38,212 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:53:38,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:53:38,246 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:53:38,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:38 WrapperNode [2020-10-24 00:53:38,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:53:38,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:53:38,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:53:38,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:53:38,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:38" (1/1) ... [2020-10-24 00:53:38,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:38" (1/1) ... [2020-10-24 00:53:38,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:38" (1/1) ... [2020-10-24 00:53:38,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:38" (1/1) ... [2020-10-24 00:53:38,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:38" (1/1) ... [2020-10-24 00:53:38,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:38" (1/1) ... [2020-10-24 00:53:38,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:38" (1/1) ... [2020-10-24 00:53:38,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:53:38,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:53:38,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:53:38,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:53:38,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:53:38,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:53:38,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:53:38,376 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:53:38,376 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-10-24 00:53:38,376 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:53:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:53:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:53:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:53:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:53:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:53:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-10-24 00:53:38,378 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:53:38,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:53:38,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:53:38,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:53:38,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:53:38,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:53:38,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:53:38,775 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:53:38,775 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:53:38,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:53:38 BoogieIcfgContainer [2020-10-24 00:53:38,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:53:38,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:53:38,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:53:38,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:53:38,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:53:37" (1/3) ... [2020-10-24 00:53:38,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518bd571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:53:38, skipping insertion in model container [2020-10-24 00:53:38,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:38" (2/3) ... [2020-10-24 00:53:38,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518bd571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:53:38, skipping insertion in model container [2020-10-24 00:53:38,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:53:38" (3/3) ... [2020-10-24 00:53:38,809 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_5-2.c [2020-10-24 00:53:38,823 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:53:38,829 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:53:38,845 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:53:38,874 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:53:38,875 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:53:38,875 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:53:38,875 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:53:38,875 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:53:38,875 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:53:38,876 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:53:38,876 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:53:38,894 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-10-24 00:53:38,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 00:53:38,904 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:38,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:53:38,906 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:38,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:38,913 INFO L82 PathProgramCache]: Analyzing trace with hash -32329728, now seen corresponding path program 1 times [2020-10-24 00:53:38,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:38,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1744029006] [2020-10-24 00:53:38,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:39,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:39,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:39,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:53:39,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1744029006] [2020-10-24 00:53:39,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:53:39,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:53:39,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553112434] [2020-10-24 00:53:39,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:53:39,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:39,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:53:39,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:53:39,325 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 6 states. [2020-10-24 00:53:39,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:39,794 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2020-10-24 00:53:39,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:53:39,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-24 00:53:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:39,808 INFO L225 Difference]: With dead ends: 60 [2020-10-24 00:53:39,808 INFO L226 Difference]: Without dead ends: 37 [2020-10-24 00:53:39,812 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-10-24 00:53:39,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-24 00:53:39,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-24 00:53:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-24 00:53:39,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-10-24 00:53:39,873 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 25 [2020-10-24 00:53:39,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:39,874 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-10-24 00:53:39,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:53:39,875 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-10-24 00:53:39,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-24 00:53:39,877 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:39,877 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-10-24 00:53:39,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:53:39,878 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:39,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:39,879 INFO L82 PathProgramCache]: Analyzing trace with hash 950139466, now seen corresponding path program 1 times [2020-10-24 00:53:39,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:39,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [454979587] [2020-10-24 00:53:39,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:39,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:39,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:40,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:53:40,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [454979587] [2020-10-24 00:53:40,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:53:40,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:53:40,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402661821] [2020-10-24 00:53:40,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:53:40,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:40,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:53:40,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:53:40,020 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2020-10-24 00:53:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:40,305 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2020-10-24 00:53:40,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:53:40,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-10-24 00:53:40,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:40,308 INFO L225 Difference]: With dead ends: 46 [2020-10-24 00:53:40,308 INFO L226 Difference]: Without dead ends: 39 [2020-10-24 00:53:40,309 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-10-24 00:53:40,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-24 00:53:40,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-10-24 00:53:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-24 00:53:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-10-24 00:53:40,324 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2020-10-24 00:53:40,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:40,324 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-10-24 00:53:40,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:53:40,325 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-10-24 00:53:40,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-10-24 00:53:40,327 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:40,327 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-10-24 00:53:40,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:53:40,328 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:40,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:40,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1810718643, now seen corresponding path program 1 times [2020-10-24 00:53:40,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:40,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1872734472] [2020-10-24 00:53:40,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:40,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:40,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:40,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:40,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 00:53:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 00:53:40,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1872734472] [2020-10-24 00:53:40,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:40,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:53:40,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039924773] [2020-10-24 00:53:40,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:53:40,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:40,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:53:40,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:53:40,509 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2020-10-24 00:53:40,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:40,788 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2020-10-24 00:53:40,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:53:40,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-10-24 00:53:40,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:40,791 INFO L225 Difference]: With dead ends: 62 [2020-10-24 00:53:40,791 INFO L226 Difference]: Without dead ends: 39 [2020-10-24 00:53:40,792 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:53:40,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-24 00:53:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-10-24 00:53:40,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-24 00:53:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-10-24 00:53:40,806 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 42 [2020-10-24 00:53:40,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:40,806 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-10-24 00:53:40,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:53:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-10-24 00:53:40,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-24 00:53:40,809 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:40,809 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-10-24 00:53:40,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:53:40,809 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:40,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:40,810 INFO L82 PathProgramCache]: Analyzing trace with hash 195045207, now seen corresponding path program 1 times [2020-10-24 00:53:40,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:40,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1110890538] [2020-10-24 00:53:40,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:40,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:40,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:40,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:40,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:40,947 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-24 00:53:40,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1110890538] [2020-10-24 00:53:40,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:40,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:53:40,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363765703] [2020-10-24 00:53:40,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:53:40,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:40,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:53:40,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:53:40,950 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2020-10-24 00:53:41,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:41,361 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2020-10-24 00:53:41,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:53:41,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-10-24 00:53:41,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:41,365 INFO L225 Difference]: With dead ends: 66 [2020-10-24 00:53:41,366 INFO L226 Difference]: Without dead ends: 59 [2020-10-24 00:53:41,371 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:53:41,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-24 00:53:41,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-24 00:53:41,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-24 00:53:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2020-10-24 00:53:41,411 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 43 [2020-10-24 00:53:41,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:41,412 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2020-10-24 00:53:41,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:53:41,412 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2020-10-24 00:53:41,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-24 00:53:41,417 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:41,420 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-10-24 00:53:41,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:53:41,421 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:41,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:41,421 INFO L82 PathProgramCache]: Analyzing trace with hash -396245802, now seen corresponding path program 2 times [2020-10-24 00:53:41,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:41,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [285349589] [2020-10-24 00:53:41,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:41,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:41,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:41,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:41,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:41,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:41,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:41,651 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-10-24 00:53:41,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [285349589] [2020-10-24 00:53:41,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:41,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:53:41,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379754966] [2020-10-24 00:53:41,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:53:41,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:41,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:53:41,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:53:41,654 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 8 states. [2020-10-24 00:53:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:42,027 INFO L93 Difference]: Finished difference Result 118 states and 161 transitions. [2020-10-24 00:53:42,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:53:42,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-10-24 00:53:42,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:42,035 INFO L225 Difference]: With dead ends: 118 [2020-10-24 00:53:42,035 INFO L226 Difference]: Without dead ends: 73 [2020-10-24 00:53:42,040 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:53:42,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-24 00:53:42,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2020-10-24 00:53:42,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-24 00:53:42,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2020-10-24 00:53:42,082 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 60 [2020-10-24 00:53:42,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:42,082 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2020-10-24 00:53:42,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:53:42,082 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2020-10-24 00:53:42,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-24 00:53:42,089 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:42,092 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-10-24 00:53:42,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:53:42,092 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:42,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:42,096 INFO L82 PathProgramCache]: Analyzing trace with hash -13012784, now seen corresponding path program 3 times [2020-10-24 00:53:42,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:42,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1391135027] [2020-10-24 00:53:42,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-24 00:53:42,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1391135027] [2020-10-24 00:53:42,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:42,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:53:42,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397942307] [2020-10-24 00:53:42,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:53:42,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:42,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:53:42,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:53:42,341 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 8 states. [2020-10-24 00:53:42,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:42,783 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2020-10-24 00:53:42,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 00:53:42,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-10-24 00:53:42,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:42,787 INFO L225 Difference]: With dead ends: 96 [2020-10-24 00:53:42,787 INFO L226 Difference]: Without dead ends: 89 [2020-10-24 00:53:42,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:53:42,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-24 00:53:42,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2020-10-24 00:53:42,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-10-24 00:53:42,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2020-10-24 00:53:42,857 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 61 [2020-10-24 00:53:42,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:42,857 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2020-10-24 00:53:42,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:53:42,857 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2020-10-24 00:53:42,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-10-24 00:53:42,862 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:42,865 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-10-24 00:53:42,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:53:42,866 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:42,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:42,866 INFO L82 PathProgramCache]: Analyzing trace with hash 159854214, now seen corresponding path program 4 times [2020-10-24 00:53:42,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:42,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1301593911] [2020-10-24 00:53:42,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:42,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:43,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:43,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:43,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:43,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:43,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:43,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:43,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:43,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:43,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:43,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:43,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:43,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:43,203 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 36 proven. 197 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2020-10-24 00:53:43,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1301593911] [2020-10-24 00:53:43,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:43,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:53:43,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048574136] [2020-10-24 00:53:43,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:53:43,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:43,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:53:43,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:53:43,206 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand 9 states. [2020-10-24 00:53:43,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:43,773 INFO L93 Difference]: Finished difference Result 146 states and 199 transitions. [2020-10-24 00:53:43,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:53:43,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2020-10-24 00:53:43,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:43,779 INFO L225 Difference]: With dead ends: 146 [2020-10-24 00:53:43,779 INFO L226 Difference]: Without dead ends: 139 [2020-10-24 00:53:43,780 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:53:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-10-24 00:53:43,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 127. [2020-10-24 00:53:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-24 00:53:43,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 177 transitions. [2020-10-24 00:53:43,832 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 177 transitions. Word has length 132 [2020-10-24 00:53:43,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:43,833 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 177 transitions. [2020-10-24 00:53:43,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:53:43,833 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 177 transitions. [2020-10-24 00:53:43,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-10-24 00:53:43,837 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:43,838 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-10-24 00:53:43,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:53:43,838 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:43,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:43,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1497778840, now seen corresponding path program 5 times [2020-10-24 00:53:43,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:43,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [950494946] [2020-10-24 00:53:43,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:43,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:53:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:43,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:53:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:53:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:53:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:53:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:53:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:53:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:53:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:53:44,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 375 proven. 413 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2020-10-24 00:53:44,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [950494946] [2020-10-24 00:53:44,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:53:44,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 00:53:44,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116184408] [2020-10-24 00:53:44,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 00:53:44,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:53:44,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 00:53:44,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:53:44,465 INFO L87 Difference]: Start difference. First operand 127 states and 177 transitions. Second operand 14 states. [2020-10-24 00:53:45,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:53:45,937 INFO L93 Difference]: Finished difference Result 213 states and 326 transitions. [2020-10-24 00:53:45,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 00:53:45,937 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 202 [2020-10-24 00:53:45,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:53:45,941 INFO L225 Difference]: With dead ends: 213 [2020-10-24 00:53:45,941 INFO L226 Difference]: Without dead ends: 99 [2020-10-24 00:53:45,947 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=255, Invalid=867, Unknown=0, NotChecked=0, Total=1122 [2020-10-24 00:53:45,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-10-24 00:53:45,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2020-10-24 00:53:45,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-24 00:53:45,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2020-10-24 00:53:45,992 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 202 [2020-10-24 00:53:45,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:53:45,992 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2020-10-24 00:53:45,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 00:53:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2020-10-24 00:53:45,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-10-24 00:53:45,996 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:53:45,996 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-10-24 00:53:45,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:53:45,996 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:53:45,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:53:45,997 INFO L82 PathProgramCache]: Analyzing trace with hash -799639331, now seen corresponding path program 6 times [2020-10-24 00:53:45,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:53:45,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1253103569] [2020-10-24 00:53:45,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:53:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 00:53:46,038 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 00:53:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 00:53:46,081 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 00:53:46,148 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-24 00:53:46,149 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 00:53:46,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:53:46,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:53:46 BoogieIcfgContainer [2020-10-24 00:53:46,274 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:53:46,284 INFO L168 Benchmark]: Toolchain (without parser) took 8284.05 ms. Allocated memory was 162.5 MB in the beginning and 256.9 MB in the end (delta: 94.4 MB). Free memory was 139.2 MB in the beginning and 206.3 MB in the end (delta: -67.1 MB). Peak memory consumption was 27.7 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:46,284 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 162.5 MB. Free memory is still 136.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:53:46,285 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.00 ms. Allocated memory is still 162.5 MB. Free memory was 138.7 MB in the beginning and 129.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:46,285 INFO L168 Benchmark]: Boogie Preprocessor took 34.46 ms. Allocated memory is still 162.5 MB. Free memory was 129.7 MB in the beginning and 128.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:46,288 INFO L168 Benchmark]: RCFGBuilder took 494.29 ms. Allocated memory is still 162.5 MB. Free memory was 128.2 MB in the beginning and 114.5 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:46,292 INFO L168 Benchmark]: TraceAbstraction took 7474.06 ms. Allocated memory was 162.5 MB in the beginning and 256.9 MB in the end (delta: 94.4 MB). Free memory was 145.9 MB in the beginning and 206.3 MB in the end (delta: -60.4 MB). Peak memory consumption was 33.6 MB. Max. memory is 8.0 GB. [2020-10-24 00:53:46,298 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 162.5 MB. Free memory is still 136.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 248.00 ms. Allocated memory is still 162.5 MB. Free memory was 138.7 MB in the beginning and 129.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.46 ms. Allocated memory is still 162.5 MB. Free memory was 129.7 MB in the beginning and 128.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 494.29 ms. Allocated memory is still 162.5 MB. Free memory was 128.2 MB in the beginning and 114.5 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7474.06 ms. Allocated memory was 162.5 MB in the beginning and 256.9 MB in the end (delta: 94.4 MB). Free memory was 145.9 MB in the beginning and 206.3 MB in the end (delta: -60.4 MB). Peak memory consumption was 33.6 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.2s, OverallIterations: 9, TraceHistogramMax: 21, AutomataDifference: 4.3s, 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.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 2.6s 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.3s 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...