/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:26:11,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:26:11,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:26:11,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:26:11,900 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:26:11,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:26:11,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:26:11,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:26:11,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:26:11,923 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:26:11,924 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:26:11,925 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:26:11,925 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:26:11,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:26:11,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:26:11,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:26:11,936 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:26:11,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:26:11,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:26:11,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:26:11,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:26:11,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:26:11,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:26:11,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:26:11,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:26:11,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:26:11,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:26:11,975 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:26:11,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:26:11,976 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:26:11,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:26:11,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:26:11,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:26:11,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:26:11,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:26:11,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:26:11,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:26:11,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:26:11,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:26:11,991 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:26:11,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:26:11,992 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 16:26:12,012 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:26:12,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:26:12,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:26:12,016 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:26:12,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:26:12,016 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:26:12,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:26:12,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:26:12,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:26:12,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:26:12,018 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:26:12,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:26:12,018 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:26:12,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:26:12,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:26:12,019 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:26:12,019 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:26:12,020 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:26:12,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:26:12,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:26:12,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:26:12,021 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:26:12,021 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:26:12,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:26:12,475 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:26:12,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:26:12,481 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:26:12,482 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:26:12,483 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c [2020-09-04 16:26:12,569 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1c912ebb6/bc0dcbf8ffdf4c6aa95265ad60e7dff2/FLAGc9f57da01 [2020-09-04 16:26:13,175 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:26:13,176 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c [2020-09-04 16:26:13,183 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1c912ebb6/bc0dcbf8ffdf4c6aa95265ad60e7dff2/FLAGc9f57da01 [2020-09-04 16:26:13,511 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1c912ebb6/bc0dcbf8ffdf4c6aa95265ad60e7dff2 [2020-09-04 16:26:13,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:26:13,529 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:26:13,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:26:13,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:26:13,536 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:26:13,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:26:13" (1/1) ... [2020-09-04 16:26:13,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b03ff29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:13, skipping insertion in model container [2020-09-04 16:26:13,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:26:13" (1/1) ... [2020-09-04 16:26:13,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:26:13,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:26:13,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:26:13,820 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:26:13,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:26:13,857 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:26:13,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:13 WrapperNode [2020-09-04 16:26:13,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:26:13,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:26:13,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:26:13,859 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:26:13,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:13" (1/1) ... [2020-09-04 16:26:13,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:13" (1/1) ... [2020-09-04 16:26:13,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:13" (1/1) ... [2020-09-04 16:26:13,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:13" (1/1) ... [2020-09-04 16:26:13,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:13" (1/1) ... [2020-09-04 16:26:13,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:13" (1/1) ... [2020-09-04 16:26:13,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:13" (1/1) ... [2020-09-04 16:26:13,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:26:13,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:26:13,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:26:13,986 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:26:13,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:13" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 16:26:14,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:26:14,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:26:14,076 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-09-04 16:26:14,076 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-09-04 16:26:14,076 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:26:14,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 16:26:14,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:26:14,077 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-09-04 16:26:14,077 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-09-04 16:26:14,077 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:26:14,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:26:14,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:26:14,381 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:26:14,381 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:26:14,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:26:14 BoogieIcfgContainer [2020-09-04 16:26:14,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:26:14,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:26:14,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:26:14,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:26:14,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:26:13" (1/3) ... [2020-09-04 16:26:14,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6baaca7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:26:14, skipping insertion in model container [2020-09-04 16:26:14,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:26:13" (2/3) ... [2020-09-04 16:26:14,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6baaca7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:26:14, skipping insertion in model container [2020-09-04 16:26:14,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:26:14" (3/3) ... [2020-09-04 16:26:14,422 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-1.c [2020-09-04 16:26:14,440 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:26:14,450 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:26:14,471 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:26:14,499 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:26:14,499 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:26:14,499 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:26:14,500 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:26:14,500 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:26:14,500 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:26:14,500 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:26:14,500 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:26:14,521 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-09-04 16:26:14,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 16:26:14,535 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:14,537 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:14,537 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:14,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:14,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1089710179, now seen corresponding path program 1 times [2020-09-04 16:26:14,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:14,557 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1071308980] [2020-09-04 16:26:14,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:14,638 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:14,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:14,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:26:14,863 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1071308980] [2020-09-04 16:26:14,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:14,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:26:14,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023131429] [2020-09-04 16:26:14,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:26:14,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:14,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:26:14,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:26:14,889 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-09-04 16:26:15,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:15,037 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-09-04 16:26:15,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:26:15,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 16:26:15,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:15,053 INFO L225 Difference]: With dead ends: 58 [2020-09-04 16:26:15,053 INFO L226 Difference]: Without dead ends: 42 [2020-09-04 16:26:15,057 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:26:15,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-09-04 16:26:15,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-09-04 16:26:15,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 16:26:15,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-09-04 16:26:15,116 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2020-09-04 16:26:15,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:15,116 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-09-04 16:26:15,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:26:15,117 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-09-04 16:26:15,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-04 16:26:15,119 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:15,120 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:15,120 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:26:15,120 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:15,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:15,121 INFO L82 PathProgramCache]: Analyzing trace with hash -653728005, now seen corresponding path program 1 times [2020-09-04 16:26:15,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:15,122 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [214648077] [2020-09-04 16:26:15,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:15,124 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:15,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:15,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:15,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:26:15,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [214648077] [2020-09-04 16:26:15,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:15,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:26:15,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368832050] [2020-09-04 16:26:15,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:26:15,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:15,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:26:15,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:26:15,213 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-09-04 16:26:15,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:15,300 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-09-04 16:26:15,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:26:15,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-04 16:26:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:15,304 INFO L225 Difference]: With dead ends: 50 [2020-09-04 16:26:15,304 INFO L226 Difference]: Without dead ends: 44 [2020-09-04 16:26:15,306 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:26:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-09-04 16:26:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-09-04 16:26:15,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 16:26:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-09-04 16:26:15,321 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2020-09-04 16:26:15,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:15,322 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-09-04 16:26:15,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:26:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-09-04 16:26:15,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-09-04 16:26:15,324 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:15,325 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:15,325 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:26:15,325 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:15,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:15,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1617834856, now seen corresponding path program 1 times [2020-09-04 16:26:15,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:15,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [390643850] [2020-09-04 16:26:15,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:15,330 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:15,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:15,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:15,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:15,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 16:26:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 16:26:15,470 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [390643850] [2020-09-04 16:26:15,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:15,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:26:15,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164980593] [2020-09-04 16:26:15,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:26:15,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:15,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:26:15,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:26:15,472 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2020-09-04 16:26:15,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:15,573 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2020-09-04 16:26:15,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:26:15,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-09-04 16:26:15,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:15,576 INFO L225 Difference]: With dead ends: 82 [2020-09-04 16:26:15,576 INFO L226 Difference]: Without dead ends: 46 [2020-09-04 16:26:15,578 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:26:15,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-09-04 16:26:15,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-09-04 16:26:15,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-09-04 16:26:15,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-09-04 16:26:15,594 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2020-09-04 16:26:15,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:15,595 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-09-04 16:26:15,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:26:15,595 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-09-04 16:26:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 16:26:15,597 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:15,598 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:15,598 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:26:15,598 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:15,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:15,599 INFO L82 PathProgramCache]: Analyzing trace with hash 887160861, now seen corresponding path program 1 times [2020-09-04 16:26:15,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:15,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1821383478] [2020-09-04 16:26:15,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:15,602 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:15,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:15,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:15,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:15,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:15,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 16:26:15,790 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1821383478] [2020-09-04 16:26:15,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:15,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:26:15,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926276787] [2020-09-04 16:26:15,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:26:15,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:15,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:26:15,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:26:15,792 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 7 states. [2020-09-04 16:26:16,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:16,029 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2020-09-04 16:26:16,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:26:16,030 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-09-04 16:26:16,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:16,033 INFO L225 Difference]: With dead ends: 74 [2020-09-04 16:26:16,033 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 16:26:16,034 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:26:16,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 16:26:16,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-09-04 16:26:16,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-09-04 16:26:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2020-09-04 16:26:16,053 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 34 [2020-09-04 16:26:16,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:16,054 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2020-09-04 16:26:16,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:26:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2020-09-04 16:26:16,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-09-04 16:26:16,057 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:16,057 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:16,058 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:26:16,058 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:16,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:16,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1875452576, now seen corresponding path program 1 times [2020-09-04 16:26:16,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:16,059 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [481570885] [2020-09-04 16:26:16,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:16,081 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:16,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:16,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:16,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:16,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:16,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 16:26:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:16,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-09-04 16:26:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:16,223 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 16:26:16,224 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [481570885] [2020-09-04 16:26:16,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:16,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:26:16,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615590717] [2020-09-04 16:26:16,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:26:16,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:16,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:26:16,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:26:16,226 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 6 states. [2020-09-04 16:26:16,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:16,320 INFO L93 Difference]: Finished difference Result 130 states and 178 transitions. [2020-09-04 16:26:16,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:26:16,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2020-09-04 16:26:16,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:16,323 INFO L225 Difference]: With dead ends: 130 [2020-09-04 16:26:16,323 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 16:26:16,325 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:26:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 16:26:16,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-09-04 16:26:16,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 16:26:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2020-09-04 16:26:16,343 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 50 [2020-09-04 16:26:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:16,343 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2020-09-04 16:26:16,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:26:16,344 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2020-09-04 16:26:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 16:26:16,346 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:16,347 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:16,347 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:26:16,347 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:16,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:16,348 INFO L82 PathProgramCache]: Analyzing trace with hash 104828256, now seen corresponding path program 1 times [2020-09-04 16:26:16,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:16,348 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1417487721] [2020-09-04 16:26:16,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:16,356 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:16,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:16,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:16,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:16,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:16,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:16,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:16,595 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-09-04 16:26:16,596 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1417487721] [2020-09-04 16:26:16,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:16,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:26:16,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171120054] [2020-09-04 16:26:16,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:26:16,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:16,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:26:16,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:26:16,599 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 8 states. [2020-09-04 16:26:16,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:16,754 INFO L93 Difference]: Finished difference Result 142 states and 197 transitions. [2020-09-04 16:26:16,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:26:16,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-09-04 16:26:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:16,761 INFO L225 Difference]: With dead ends: 142 [2020-09-04 16:26:16,762 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 16:26:16,769 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:26:16,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 16:26:16,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2020-09-04 16:26:16,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-09-04 16:26:16,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2020-09-04 16:26:16,808 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 51 [2020-09-04 16:26:16,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:16,809 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2020-09-04 16:26:16,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:26:16,810 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2020-09-04 16:26:16,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 16:26:16,823 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:16,824 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:16,824 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:26:16,825 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:16,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:16,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1703786405, now seen corresponding path program 1 times [2020-09-04 16:26:16,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:16,827 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [308609231] [2020-09-04 16:26:16,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:16,837 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:16,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:16,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:16,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:17,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:17,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:17,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 16:26:17,045 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [308609231] [2020-09-04 16:26:17,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:17,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:26:17,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782881033] [2020-09-04 16:26:17,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:26:17,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:17,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:26:17,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:26:17,047 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 8 states. [2020-09-04 16:26:17,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:17,272 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2020-09-04 16:26:17,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:26:17,274 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-09-04 16:26:17,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:17,280 INFO L225 Difference]: With dead ends: 118 [2020-09-04 16:26:17,280 INFO L226 Difference]: Without dead ends: 112 [2020-09-04 16:26:17,281 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:26:17,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-09-04 16:26:17,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-09-04 16:26:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-09-04 16:26:17,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2020-09-04 16:26:17,319 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 52 [2020-09-04 16:26:17,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:17,319 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2020-09-04 16:26:17,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:26:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2020-09-04 16:26:17,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-09-04 16:26:17,322 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:17,323 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 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, 1, 1, 1] [2020-09-04 16:26:17,323 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:26:17,323 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:17,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:17,323 INFO L82 PathProgramCache]: Analyzing trace with hash -521446491, now seen corresponding path program 1 times [2020-09-04 16:26:17,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:17,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2087529631] [2020-09-04 16:26:17,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:17,329 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:17,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:17,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:17,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:17,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:17,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:17,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:17,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:17,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-04 16:26:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-09-04 16:26:17,504 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2087529631] [2020-09-04 16:26:17,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:17,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:26:17,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610794439] [2020-09-04 16:26:17,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:26:17,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:17,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:26:17,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:26:17,507 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand 8 states. [2020-09-04 16:26:17,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:17,657 INFO L93 Difference]: Finished difference Result 227 states and 348 transitions. [2020-09-04 16:26:17,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:26:17,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2020-09-04 16:26:17,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:17,661 INFO L225 Difference]: With dead ends: 227 [2020-09-04 16:26:17,661 INFO L226 Difference]: Without dead ends: 127 [2020-09-04 16:26:17,663 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:26:17,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-09-04 16:26:17,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2020-09-04 16:26:17,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-09-04 16:26:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2020-09-04 16:26:17,688 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 69 [2020-09-04 16:26:17,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:17,689 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2020-09-04 16:26:17,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:26:17,689 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2020-09-04 16:26:17,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 16:26:17,691 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:17,691 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1] [2020-09-04 16:26:17,692 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:26:17,692 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:17,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:17,692 INFO L82 PathProgramCache]: Analyzing trace with hash -439633211, now seen corresponding path program 1 times [2020-09-04 16:26:17,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:17,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [726710969] [2020-09-04 16:26:17,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:17,701 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:17,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:17,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:17,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:17,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:17,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:17,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:17,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:17,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:26:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:17,963 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 16:26:17,964 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [726710969] [2020-09-04 16:26:17,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:17,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:26:17,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369896184] [2020-09-04 16:26:17,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:26:17,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:17,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:26:17,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:26:17,983 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand 10 states. [2020-09-04 16:26:18,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:18,281 INFO L93 Difference]: Finished difference Result 257 states and 400 transitions. [2020-09-04 16:26:18,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:26:18,282 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2020-09-04 16:26:18,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:18,286 INFO L225 Difference]: With dead ends: 257 [2020-09-04 16:26:18,286 INFO L226 Difference]: Without dead ends: 151 [2020-09-04 16:26:18,289 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:26:18,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-09-04 16:26:18,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2020-09-04 16:26:18,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-09-04 16:26:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2020-09-04 16:26:18,319 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 70 [2020-09-04 16:26:18,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:18,320 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2020-09-04 16:26:18,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:26:18,320 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2020-09-04 16:26:18,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-09-04 16:26:18,324 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:18,324 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:26:18,324 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:26:18,325 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:18,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:18,325 INFO L82 PathProgramCache]: Analyzing trace with hash 307755032, now seen corresponding path program 2 times [2020-09-04 16:26:18,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:18,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1840830319] [2020-09-04 16:26:18,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:18,340 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:18,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:18,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:18,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:18,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:18,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:18,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:18,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:18,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:26:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:18,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:18,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:18,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:18,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:18,742 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-09-04 16:26:18,743 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1840830319] [2020-09-04 16:26:18,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:18,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:26:18,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813927306] [2020-09-04 16:26:18,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:26:18,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:18,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:26:18,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:26:18,746 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand 12 states. [2020-09-04 16:26:19,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:19,240 INFO L93 Difference]: Finished difference Result 265 states and 420 transitions. [2020-09-04 16:26:19,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:26:19,241 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2020-09-04 16:26:19,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:19,249 INFO L225 Difference]: With dead ends: 265 [2020-09-04 16:26:19,250 INFO L226 Difference]: Without dead ends: 116 [2020-09-04 16:26:19,253 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:26:19,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-09-04 16:26:19,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2020-09-04 16:26:19,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-09-04 16:26:19,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2020-09-04 16:26:19,284 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 105 [2020-09-04 16:26:19,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:19,284 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2020-09-04 16:26:19,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:26:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2020-09-04 16:26:19,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-09-04 16:26:19,287 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:19,287 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-09-04 16:26:19,288 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:26:19,288 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:19,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:19,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1951493560, now seen corresponding path program 1 times [2020-09-04 16:26:19,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:19,289 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1617169212] [2020-09-04 16:26:19,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:19,295 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:19,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:19,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:19,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:19,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:19,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:19,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:19,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:19,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:26:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:19,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:19,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:19,713 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-09-04 16:26:19,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1617169212] [2020-09-04 16:26:19,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:19,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-09-04 16:26:19,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122636101] [2020-09-04 16:26:19,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 16:26:19,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:19,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 16:26:19,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2020-09-04 16:26:19,717 INFO L87 Difference]: Start difference. First operand 103 states and 127 transitions. Second operand 17 states. [2020-09-04 16:26:20,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:20,259 INFO L93 Difference]: Finished difference Result 137 states and 167 transitions. [2020-09-04 16:26:20,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 16:26:20,259 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2020-09-04 16:26:20,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:20,263 INFO L225 Difference]: With dead ends: 137 [2020-09-04 16:26:20,263 INFO L226 Difference]: Without dead ends: 131 [2020-09-04 16:26:20,264 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2020-09-04 16:26:20,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-09-04 16:26:20,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 111. [2020-09-04 16:26:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-09-04 16:26:20,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 137 transitions. [2020-09-04 16:26:20,282 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 137 transitions. Word has length 87 [2020-09-04 16:26:20,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:20,283 INFO L479 AbstractCegarLoop]: Abstraction has 111 states and 137 transitions. [2020-09-04 16:26:20,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 16:26:20,284 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2020-09-04 16:26:20,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-09-04 16:26:20,285 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:20,285 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-09-04 16:26:20,286 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 16:26:20,286 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:20,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:20,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1530276981, now seen corresponding path program 2 times [2020-09-04 16:26:20,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:20,287 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1467342448] [2020-09-04 16:26:20,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:20,292 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 16:26:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-09-04 16:26:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,448 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-04 16:26:20,449 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1467342448] [2020-09-04 16:26:20,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:20,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:26:20,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539318127] [2020-09-04 16:26:20,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:26:20,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:20,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:26:20,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:26:20,451 INFO L87 Difference]: Start difference. First operand 111 states and 137 transitions. Second operand 7 states. [2020-09-04 16:26:20,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:20,579 INFO L93 Difference]: Finished difference Result 197 states and 253 transitions. [2020-09-04 16:26:20,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:26:20,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2020-09-04 16:26:20,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:20,582 INFO L225 Difference]: With dead ends: 197 [2020-09-04 16:26:20,582 INFO L226 Difference]: Without dead ends: 94 [2020-09-04 16:26:20,584 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:26:20,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-09-04 16:26:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-09-04 16:26:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-09-04 16:26:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2020-09-04 16:26:20,600 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 88 [2020-09-04 16:26:20,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:20,600 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2020-09-04 16:26:20,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:26:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2020-09-04 16:26:20,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-09-04 16:26:20,602 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:26:20,605 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-09-04 16:26:20,605 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 16:26:20,605 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:26:20,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:26:20,606 INFO L82 PathProgramCache]: Analyzing trace with hash 681841290, now seen corresponding path program 3 times [2020-09-04 16:26:20,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:26:20,606 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [43255011] [2020-09-04 16:26:20,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:26:20,612 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:26:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:26:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:26:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:26:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:26:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 16:26:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:26:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:26:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:26:20,922 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-09-04 16:26:20,923 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [43255011] [2020-09-04 16:26:20,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:26:20,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:26:20,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703940995] [2020-09-04 16:26:20,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:26:20,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:26:20,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:26:20,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:26:20,925 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand 11 states. [2020-09-04 16:26:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:26:21,160 INFO L93 Difference]: Finished difference Result 176 states and 223 transitions. [2020-09-04 16:26:21,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:26:21,161 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 106 [2020-09-04 16:26:21,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:26:21,162 INFO L225 Difference]: With dead ends: 176 [2020-09-04 16:26:21,162 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:26:21,164 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:26:21,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:26:21,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:26:21,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:26:21,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:26:21,166 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2020-09-04 16:26:21,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:26:21,167 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:26:21,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:26:21,167 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:26:21,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:26:21,167 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 16:26:21,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:26:26,515 WARN L193 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-09-04 16:26:26,660 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 15 [2020-09-04 16:26:26,805 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 15 [2020-09-04 16:26:27,299 WARN L193 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 33 [2020-09-04 16:26:27,633 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 24 [2020-09-04 16:26:28,074 WARN L193 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-09-04 16:26:28,274 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 26 [2020-09-04 16:26:28,522 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 26 [2020-09-04 16:26:28,793 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2020-09-04 16:26:29,065 WARN L193 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 27 [2020-09-04 16:26:29,331 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 27 [2020-09-04 16:26:29,581 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 23 [2020-09-04 16:26:30,025 WARN L193 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 33 [2020-09-04 16:26:30,173 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 23 [2020-09-04 16:26:30,611 WARN L193 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 32 [2020-09-04 16:26:30,980 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 28 [2020-09-04 16:26:31,004 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:26:31,004 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:26:31,004 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:26:31,005 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:26:31,005 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:26:31,005 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:26:31,005 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) the Hoare annotation is: false [2020-09-04 16:26:31,005 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2020-09-04 16:26:31,005 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 35 42) the Hoare annotation is: (<= 4 main_~x~0) [2020-09-04 16:26:31,005 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 35 42) the Hoare annotation is: (<= 4 main_~x~0) [2020-09-04 16:26:31,006 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: false [2020-09-04 16:26:31,006 INFO L264 CegarLoopResult]: At program point L38(lines 38 40) the Hoare annotation is: (and (<= 4 main_~x~0) (<= main_~result~0 3) (<= main_~x~0 4) (< 2 main_~result~0)) [2020-09-04 16:26:31,006 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 4 main_~x~0) (<= main_~x~0 4)) [2020-09-04 16:26:31,006 INFO L264 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (and (<= 4 main_~x~0) (<= 3 |main_#t~ret4|) (<= main_~x~0 4) (<= |main_#t~ret4| 3)) [2020-09-04 16:26:31,007 INFO L264 CegarLoopResult]: At program point L38-2(lines 38 40) the Hoare annotation is: (<= 4 main_~x~0) [2020-09-04 16:26:31,007 INFO L264 CegarLoopResult]: At program point L37-2(line 37) the Hoare annotation is: (and (<= 4 main_~x~0) (<= 3 |main_#t~ret4|) (<= main_~x~0 4) (<= |main_#t~ret4| 3)) [2020-09-04 16:26:31,007 INFO L264 CegarLoopResult]: At program point L37-3(line 37) the Hoare annotation is: (and (<= 4 main_~x~0) (<= 3 |main_#t~ret4|) (<= main_~result~0 3) (<= main_~x~0 4) (< 2 main_~result~0) (<= |main_#t~ret4| 3)) [2020-09-04 16:26:31,007 INFO L271 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2020-09-04 16:26:31,007 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-09-04 16:26:31,008 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= |fibo2_#t~ret2| 1) .cse0 (<= 1 |fibo2_#t~ret2|) (<= 2 |fibo2_#in~n|) (<= |fibo2_#in~n| 2)) (and (<= 4 fibo2_~n) .cse0))) [2020-09-04 16:26:31,008 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 1) (< 0 fibo2_~n)) [2020-09-04 16:26:31,008 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= |fibo2_#t~ret2| 1) .cse0 (<= 1 |fibo2_#t~ret2|) (<= 2 |fibo2_#in~n|) (<= |fibo2_#in~n| 2)) (and (<= 4 fibo2_~n) .cse0))) [2020-09-04 16:26:31,008 INFO L264 CegarLoopResult]: At program point L20(lines 20 24) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (< 0 fibo2_~n)) [2020-09-04 16:26:31,009 INFO L264 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (and (let ((.cse0 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|)) (.cse1 (<= |fibo2_#t~ret2| 1)) (.cse2 (= fibo2_~n |fibo2_#in~n|)) (.cse3 (<= 1 |fibo2_#t~ret2|))) (or (and (<= .cse0 2) (<= 3 fibo2_~n) .cse1 .cse2 .cse3 (<= 2 .cse0)) (and (<= 4 fibo2_~n) .cse2) (and (<= 1 .cse0) (<= .cse0 1) .cse1 .cse2 .cse3 (<= |fibo2_#in~n| 2)))) (not (<= |fibo2_#in~n| 1))) [2020-09-04 16:26:31,009 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (<= |fibo2_#in~n| 0)) [2020-09-04 16:26:31,009 INFO L264 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (and (let ((.cse0 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|)) (.cse1 (<= |fibo2_#t~ret2| 1)) (.cse2 (= fibo2_~n |fibo2_#in~n|)) (.cse3 (<= 1 |fibo2_#t~ret2|))) (or (and (<= .cse0 2) (<= 3 fibo2_~n) .cse1 .cse2 .cse3 (<= 2 .cse0)) (and (<= 4 fibo2_~n) .cse2) (and (<= 1 .cse0) (<= .cse0 1) .cse1 .cse2 .cse3 (<= |fibo2_#in~n| 2)))) (not (<= |fibo2_#in~n| 1))) [2020-09-04 16:26:31,009 INFO L264 CegarLoopResult]: At program point L18(lines 18 24) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-09-04 16:26:31,009 INFO L264 CegarLoopResult]: At program point L23-5(line 23) the Hoare annotation is: (and (let ((.cse2 (<= |fibo2_#t~ret2| 1)) (.cse0 (= fibo2_~n |fibo2_#in~n|)) (.cse3 (<= 1 |fibo2_#t~ret2|)) (.cse1 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|))) (or (and (<= 4 fibo2_~n) .cse0) (and (<= 1 .cse1) (<= .cse1 1) (<= 1 |fibo2_#res|) .cse2 (<= |fibo2_#res| 1) .cse0 .cse3 (<= |fibo2_#in~n| 2)) (and (<= .cse1 2) (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= 3 fibo2_~n) .cse2 .cse0 .cse3 (<= 2 .cse1)))) (not (<= |fibo2_#in~n| 1))) [2020-09-04 16:26:31,010 INFO L264 CegarLoopResult]: At program point L23-6(line 23) the Hoare annotation is: (and (let ((.cse0 (<= |fibo2_#t~ret2| 1)) (.cse1 (<= 1 |fibo2_#t~ret2|))) (or (and (<= 1 |fibo2_#res|) .cse0 (<= |fibo2_#res| 1) .cse1 (<= |fibo2_#in~n| 2)) (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= 3 fibo2_~n) .cse0 .cse1) (not (<= |fibo2_#in~n| 3)))) (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-09-04 16:26:31,010 INFO L264 CegarLoopResult]: At program point fibo2FINAL(lines 17 25) the Hoare annotation is: (let ((.cse3 (= fibo2_~n |fibo2_#in~n|)) (.cse4 (<= 1 |fibo2_#res|)) (.cse5 (<= |fibo2_#res| 1)) (.cse2 (<= |fibo2_#in~n| 1))) (let ((.cse1 (and .cse4 .cse5 .cse2 (< 0 fibo2_~n))) (.cse0 (and .cse4 .cse5 .cse3 (<= 2 |fibo2_#in~n|) (<= |fibo2_#in~n| 2)))) (and (or .cse0 (<= 4 fibo2_~n) .cse1 (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|)) (<= |fibo2_#in~n| 0)) (or .cse1 (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)) (not .cse2)) (or .cse0 (and (<= 3 fibo2_~n) .cse3) (and .cse3 .cse2))))) [2020-09-04 16:26:31,010 INFO L264 CegarLoopResult]: At program point fibo2EXIT(lines 17 25) the Hoare annotation is: (let ((.cse3 (= fibo2_~n |fibo2_#in~n|)) (.cse4 (<= 1 |fibo2_#res|)) (.cse5 (<= |fibo2_#res| 1)) (.cse2 (<= |fibo2_#in~n| 1))) (let ((.cse1 (and .cse4 .cse5 .cse2 (< 0 fibo2_~n))) (.cse0 (and .cse4 .cse5 .cse3 (<= 2 |fibo2_#in~n|) (<= |fibo2_#in~n| 2)))) (and (or .cse0 (<= 4 fibo2_~n) .cse1 (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|)) (<= |fibo2_#in~n| 0)) (or .cse1 (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|)) (not .cse2)) (or .cse0 (and (<= 3 fibo2_~n) .cse3) (and .cse3 .cse2))))) [2020-09-04 16:26:31,010 INFO L271 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2020-09-04 16:26:31,011 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 2)) (= fibo1_~n |fibo1_#in~n|)) [2020-09-04 16:26:31,011 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 4 fibo1_~n) (<= 2 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 2) .cse0) (and (<= |fibo1_#in~n| 3) (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|) .cse0) (and (<= 5 |fibo1_#in~n|) .cse0))) (not (<= |fibo1_#in~n| 2))) [2020-09-04 16:26:31,011 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo1_#in~n| 1) (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-09-04 16:26:31,011 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 4 fibo1_~n) (<= 2 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 2) .cse0) (and (<= |fibo1_#in~n| 3) (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|) .cse0) (and (<= 5 |fibo1_#in~n|) .cse0))) (not (<= |fibo1_#in~n| 2))) [2020-09-04 16:26:31,011 INFO L264 CegarLoopResult]: At program point fibo1FINAL(lines 7 15) the Hoare annotation is: (and (let ((.cse0 (<= |fibo1_#in~n| 2)) (.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= |fibo1_#in~n| 1) .cse1 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (and (or (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|)) (<= |fibo1_#in~n| 3)) .cse1 (<= 3 |fibo1_#in~n|)) (and (<= |fibo1_#in~n| 0) .cse0 .cse1) (and (<= 5 |fibo1_#in~n|) .cse1))) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-09-04 16:26:31,012 INFO L264 CegarLoopResult]: At program point L10(lines 10 14) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (< 0 fibo1_~n)) [2020-09-04 16:26:31,012 INFO L264 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (or (let ((.cse1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (<= .cse1 3) (<= 2 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 2) (<= 3 .cse1))) (and (<= |fibo1_#t~ret0| 1) (<= |fibo1_#in~n| 3) (<= 1 |fibo1_#t~ret0|)))) (and (<= 5 |fibo1_#in~n|) .cse0))) (not (<= |fibo1_#in~n| 2))) [2020-09-04 16:26:31,012 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (<= |fibo1_#in~n| 0) (= fibo1_~n |fibo1_#in~n|)) [2020-09-04 16:26:31,012 INFO L264 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (or (let ((.cse1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (<= .cse1 3) (<= 2 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 2) (<= 3 .cse1))) (and (<= |fibo1_#t~ret0| 1) (<= |fibo1_#in~n| 3) (<= 1 |fibo1_#t~ret0|)))) (and (<= 5 |fibo1_#in~n|) .cse0))) (not (<= |fibo1_#in~n| 2))) [2020-09-04 16:26:31,012 INFO L264 CegarLoopResult]: At program point L8(lines 8 14) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-09-04 16:26:31,013 INFO L264 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: (let ((.cse3 (= fibo1_~n |fibo1_#in~n|))) (let ((.cse1 (<= 2 |fibo1_#t~ret0|)) (.cse2 (and (<= 5 |fibo1_#in~n|) .cse3))) (and (or (and (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|)) (let ((.cse0 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (<= |fibo1_#res| 3) (<= .cse0 3) (<= 3 |fibo1_#res|) .cse1 (<= |fibo1_#t~ret0| 2) (<= 3 .cse0))) .cse2) (not (<= |fibo1_#in~n| 2)) (or (and (<= |fibo1_#in~n| 3) .cse3) (and .cse1 .cse3) .cse2)))) [2020-09-04 16:26:31,013 INFO L264 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: (let ((.cse2 (= fibo1_~n |fibo1_#in~n|))) (let ((.cse0 (<= 2 |fibo1_#t~ret0|)) (.cse1 (and (<= 5 |fibo1_#in~n|) .cse2))) (and (or (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|) .cse0 (<= |fibo1_#t~ret0| 2)) (and (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|)) .cse1) (not (<= |fibo1_#in~n| 2)) (or (and (<= |fibo1_#in~n| 3) .cse2) (and .cse0 .cse2) .cse1)))) [2020-09-04 16:26:31,013 INFO L264 CegarLoopResult]: At program point fibo1EXIT(lines 7 15) the Hoare annotation is: (and (let ((.cse0 (<= |fibo1_#in~n| 2)) (.cse1 (= fibo1_~n |fibo1_#in~n|))) (or (and .cse0 (<= |fibo1_#in~n| 1) .cse1 (<= |fibo1_#res| 1) (<= 1 |fibo1_#res|)) (and (or (and (<= |fibo1_#res| 3) (<= 3 |fibo1_#res|)) (<= |fibo1_#in~n| 3)) .cse1 (<= 3 |fibo1_#in~n|)) (and (<= |fibo1_#in~n| 0) .cse0 .cse1) (and (<= 5 |fibo1_#in~n|) .cse1))) (or (and (<= 0 |fibo1_#res|) (<= |fibo1_#res| 0)) (< 0 fibo1_~n))) [2020-09-04 16:26:31,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:26:31 BoogieIcfgContainer [2020-09-04 16:26:31,041 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:26:31,043 INFO L168 Benchmark]: Toolchain (without parser) took 17515.36 ms. Allocated memory was 140.0 MB in the beginning and 384.3 MB in the end (delta: 244.3 MB). Free memory was 104.3 MB in the beginning and 284.7 MB in the end (delta: -180.4 MB). Peak memory consumption was 253.2 MB. Max. memory is 7.1 GB. [2020-09-04 16:26:31,044 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 16:26:31,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.49 ms. Allocated memory is still 140.0 MB. Free memory was 104.1 MB in the beginning and 94.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-09-04 16:26:31,046 INFO L168 Benchmark]: Boogie Preprocessor took 121.26 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 94.4 MB in the beginning and 183.1 MB in the end (delta: -88.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-09-04 16:26:31,046 INFO L168 Benchmark]: RCFGBuilder took 406.29 ms. Allocated memory is still 203.9 MB. Free memory was 183.1 MB in the beginning and 168.3 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2020-09-04 16:26:31,047 INFO L168 Benchmark]: TraceAbstraction took 16638.99 ms. Allocated memory was 203.9 MB in the beginning and 384.3 MB in the end (delta: 180.4 MB). Free memory was 167.6 MB in the beginning and 284.7 MB in the end (delta: -117.1 MB). Peak memory consumption was 252.6 MB. Max. memory is 7.1 GB. [2020-09-04 16:26:31,050 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 327.49 ms. Allocated memory is still 140.0 MB. Free memory was 104.1 MB in the beginning and 94.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.26 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 94.4 MB in the beginning and 183.1 MB in the end (delta: -88.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 406.29 ms. Allocated memory is still 203.9 MB. Free memory was 183.1 MB in the beginning and 168.3 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16638.99 ms. Allocated memory was 203.9 MB in the beginning and 384.3 MB in the end (delta: 180.4 MB). Free memory was 167.6 MB in the beginning and 284.7 MB in the end (delta: -117.1 MB). Peak memory consumption was 252.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 35]: Procedure Contract for main Derived contract for procedure main: 4 <= x - ProcedureContractResult [Line: 17]: Procedure Contract for fibo2 Derived contract for procedure fibo2: (((((((((1 <= \result && \result <= 1) && n == \old(n)) && 2 <= \old(n)) && \old(n) <= 2) || 4 <= n) || (((1 <= \result && \result <= 1) && \old(n) <= 1) && 0 < n)) || (\result <= 2 && 2 <= \result)) || \old(n) <= 0) && (((((1 <= \result && \result <= 1) && \old(n) <= 1) && 0 < n) || (\result <= 0 && 0 <= \result)) || !(\old(n) <= 1))) && ((((((1 <= \result && \result <= 1) && n == \old(n)) && 2 <= \old(n)) && \old(n) <= 2) || (3 <= n && n == \old(n))) || (n == \old(n) && \old(n) <= 1)) - ProcedureContractResult [Line: 7]: Procedure Contract for fibo1 Derived contract for procedure fibo1: (((((((\old(n) <= 2 && \old(n) <= 1) && n == \old(n)) && \result <= 1) && 1 <= \result) || ((((\result <= 3 && 3 <= \result) || \old(n) <= 3) && n == \old(n)) && 3 <= \old(n))) || ((\old(n) <= 0 && \old(n) <= 2) && n == \old(n))) || (5 <= \old(n) && n == \old(n))) && ((0 <= \result && \result <= 0) || 0 < n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.6s, OverallIterations: 13, TraceHistogramMax: 7, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 584 SDtfs, 511 SDslu, 2820 SDs, 0 SdLazy, 1531 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=9, 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, 13 MinimizatonAttempts, 81 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 1599 PreInvPairs, 2793 NumberOfFragments, 1053 HoareAnnotationTreeSize, 1599 FomulaSimplifications, 46516 FormulaSimplificationTreeSizeReduction, 4.8s HoareSimplificationTime, 45 FomulaSimplificationsInter, 15375 FormulaSimplificationTreeSizeReductionInter, 4.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...