/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_7-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 13:07:50,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 13:07:50,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 13:07:50,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 13:07:50,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 13:07:50,801 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 13:07:50,803 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 13:07:50,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 13:07:50,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 13:07:50,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 13:07:50,823 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 13:07:50,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 13:07:50,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 13:07:50,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 13:07:50,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 13:07:50,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 13:07:50,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 13:07:50,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 13:07:50,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 13:07:50,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 13:07:50,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 13:07:50,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 13:07:50,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 13:07:50,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 13:07:50,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 13:07:50,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 13:07:50,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 13:07:50,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 13:07:50,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 13:07:50,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 13:07:50,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 13:07:50,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 13:07:50,863 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 13:07:50,864 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 13:07:50,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 13:07:50,865 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 13:07:50,866 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 13:07:50,866 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 13:07:50,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 13:07:50,867 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 13:07:50,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 13:07:50,869 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-07 13:07:50,884 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 13:07:50,884 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 13:07:50,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 13:07:50,886 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 13:07:50,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 13:07:50,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 13:07:50,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 13:07:50,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 13:07:50,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 13:07:50,888 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 13:07:50,889 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 13:07:50,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 13:07:50,889 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 13:07:50,889 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 13:07:50,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 13:07:50,890 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-07 13:07:50,890 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 13:07:50,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 13:07:50,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:07:50,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 13:07:50,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-07 13:07:50,892 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 13:07:50,893 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-07 13:07:51,153 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 13:07:51,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 13:07:51,171 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 13:07:51,172 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 13:07:51,173 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 13:07:51,174 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_7-1.c [2020-07-07 13:07:51,232 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4beabc65/cf5ac8e15d7e460cae2ca2fdc3f2e7f4/FLAGe9e7f5142 [2020-07-07 13:07:51,644 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 13:07:51,645 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-1.c [2020-07-07 13:07:51,653 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4beabc65/cf5ac8e15d7e460cae2ca2fdc3f2e7f4/FLAGe9e7f5142 [2020-07-07 13:07:52,015 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4beabc65/cf5ac8e15d7e460cae2ca2fdc3f2e7f4 [2020-07-07 13:07:52,027 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 13:07:52,029 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 13:07:52,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 13:07:52,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 13:07:52,036 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 13:07:52,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:07:52" (1/1) ... [2020-07-07 13:07:52,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5700ce5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:07:52, skipping insertion in model container [2020-07-07 13:07:52,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:07:52" (1/1) ... [2020-07-07 13:07:52,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 13:07:52,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 13:07:52,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:07:52,237 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 13:07:52,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:07:52,262 INFO L208 MainTranslator]: Completed translation [2020-07-07 13:07:52,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:07:52 WrapperNode [2020-07-07 13:07:52,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 13:07:52,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 13:07:52,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 13:07:52,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 13:07:52,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:07:52" (1/1) ... [2020-07-07 13:07:52,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:07:52" (1/1) ... [2020-07-07 13:07:52,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:07:52" (1/1) ... [2020-07-07 13:07:52,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:07:52" (1/1) ... [2020-07-07 13:07:52,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:07:52" (1/1) ... [2020-07-07 13:07:52,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:07:52" (1/1) ... [2020-07-07 13:07:52,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:07:52" (1/1) ... [2020-07-07 13:07:52,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 13:07:52,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 13:07:52,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 13:07:52,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 13:07:52,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:07:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:07:52,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 13:07:52,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 13:07:52,419 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-07 13:07:52,419 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 13:07:52,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 13:07:52,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 13:07:52,420 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-07 13:07:52,420 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 13:07:52,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 13:07:52,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 13:07:52,590 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 13:07:52,591 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-07 13:07:52,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:07:52 BoogieIcfgContainer [2020-07-07 13:07:52,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 13:07:52,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 13:07:52,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 13:07:52,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 13:07:52,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 01:07:52" (1/3) ... [2020-07-07 13:07:52,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419583be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:07:52, skipping insertion in model container [2020-07-07 13:07:52,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:07:52" (2/3) ... [2020-07-07 13:07:52,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419583be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:07:52, skipping insertion in model container [2020-07-07 13:07:52,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:07:52" (3/3) ... [2020-07-07 13:07:52,603 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_7-1.c [2020-07-07 13:07:52,613 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-07 13:07:52,620 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 13:07:52,630 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 13:07:52,650 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 13:07:52,650 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 13:07:52,650 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-07 13:07:52,650 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 13:07:52,650 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 13:07:52,651 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 13:07:52,651 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 13:07:52,652 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 13:07:52,667 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-07-07 13:07:52,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-07 13:07:52,677 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:07:52,678 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:07:52,678 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:07:52,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:07:52,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1756383024, now seen corresponding path program 1 times [2020-07-07 13:07:52,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:07:52,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [608602446] [2020-07-07 13:07:52,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:07:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:52,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:07:52,894 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:07:52,896 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [608602446] [2020-07-07 13:07:52,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:07:52,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:07:52,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697836011] [2020-07-07 13:07:52,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:07:52,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:07:52,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:07:52,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:07:52,939 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2020-07-07 13:07:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:07:53,145 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-07-07 13:07:53,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 13:07:53,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-07 13:07:53,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:07:53,160 INFO L225 Difference]: With dead ends: 44 [2020-07-07 13:07:53,161 INFO L226 Difference]: Without dead ends: 28 [2020-07-07 13:07:53,165 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-07-07 13:07:53,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-07 13:07:53,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-07 13:07:53,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-07 13:07:53,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-07 13:07:53,220 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2020-07-07 13:07:53,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:07:53,221 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-07 13:07:53,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:07:53,222 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-07 13:07:53,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-07 13:07:53,224 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:07:53,224 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:07:53,224 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 13:07:53,225 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:07:53,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:07:53,225 INFO L82 PathProgramCache]: Analyzing trace with hash -389703589, now seen corresponding path program 1 times [2020-07-07 13:07:53,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:07:53,226 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2102831247] [2020-07-07 13:07:53,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:07:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:07:53,294 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:07:53,295 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2102831247] [2020-07-07 13:07:53,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:07:53,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:07:53,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140113857] [2020-07-07 13:07:53,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:07:53,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:07:53,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:07:53,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:07:53,298 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2020-07-07 13:07:53,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:07:53,360 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-07 13:07:53,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 13:07:53,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-07 13:07:53,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:07:53,363 INFO L225 Difference]: With dead ends: 36 [2020-07-07 13:07:53,363 INFO L226 Difference]: Without dead ends: 30 [2020-07-07 13:07:53,365 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-07-07 13:07:53,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-07 13:07:53,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-07 13:07:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-07 13:07:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-07 13:07:53,377 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2020-07-07 13:07:53,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:07:53,378 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-07 13:07:53,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:07:53,378 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-07 13:07:53,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-07 13:07:53,380 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:07:53,380 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:07:53,381 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 13:07:53,381 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:07:53,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:07:53,381 INFO L82 PathProgramCache]: Analyzing trace with hash 50309368, now seen corresponding path program 1 times [2020-07-07 13:07:53,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:07:53,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [229397094] [2020-07-07 13:07:53,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:07:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:53,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 13:07:53,537 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:07:53,537 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [229397094] [2020-07-07 13:07:53,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:07:53,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 13:07:53,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603254056] [2020-07-07 13:07:53,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 13:07:53,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:07:53,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 13:07:53,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-07 13:07:53,540 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2020-07-07 13:07:53,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:07:53,636 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2020-07-07 13:07:53,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 13:07:53,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-07 13:07:53,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:07:53,639 INFO L225 Difference]: With dead ends: 52 [2020-07-07 13:07:53,639 INFO L226 Difference]: Without dead ends: 30 [2020-07-07 13:07:53,640 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-07 13:07:53,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-07 13:07:53,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-07 13:07:53,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-07 13:07:53,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-07 13:07:53,651 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 33 [2020-07-07 13:07:53,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:07:53,652 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-07 13:07:53,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 13:07:53,652 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-07 13:07:53,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-07 13:07:53,654 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:07:53,654 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:07:53,655 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 13:07:53,655 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:07:53,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:07:53,656 INFO L82 PathProgramCache]: Analyzing trace with hash -643371531, now seen corresponding path program 1 times [2020-07-07 13:07:53,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:07:53,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1100034312] [2020-07-07 13:07:53,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:07:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-07 13:07:53,767 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:07:53,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1100034312] [2020-07-07 13:07:53,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:07:53,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 13:07:53,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429377141] [2020-07-07 13:07:53,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 13:07:53,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:07:53,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 13:07:53,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-07 13:07:53,770 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 7 states. [2020-07-07 13:07:53,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:07:53,887 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2020-07-07 13:07:53,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 13:07:53,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-07-07 13:07:53,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:07:53,890 INFO L225 Difference]: With dead ends: 56 [2020-07-07 13:07:53,890 INFO L226 Difference]: Without dead ends: 50 [2020-07-07 13:07:53,891 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-07 13:07:53,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-07 13:07:53,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-07-07 13:07:53,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-07 13:07:53,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2020-07-07 13:07:53,907 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 34 [2020-07-07 13:07:53,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:07:53,907 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2020-07-07 13:07:53,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 13:07:53,908 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2020-07-07 13:07:53,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-07 13:07:53,910 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:07:53,910 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:07:53,911 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 13:07:53,911 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:07:53,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:07:53,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1274787059, now seen corresponding path program 2 times [2020-07-07 13:07:53,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:07:53,912 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [85092196] [2020-07-07 13:07:53,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:07:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,110 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-07 13:07:54,111 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:07:54,111 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [85092196] [2020-07-07 13:07:54,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:07:54,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:07:54,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590251919] [2020-07-07 13:07:54,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:07:54,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:07:54,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:07:54,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:07:54,113 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 9 states. [2020-07-07 13:07:54,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:07:54,245 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2020-07-07 13:07:54,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 13:07:54,248 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2020-07-07 13:07:54,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:07:54,254 INFO L225 Difference]: With dead ends: 111 [2020-07-07 13:07:54,254 INFO L226 Difference]: Without dead ends: 67 [2020-07-07 13:07:54,256 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-07 13:07:54,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-07 13:07:54,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2020-07-07 13:07:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-07 13:07:54,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2020-07-07 13:07:54,280 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 51 [2020-07-07 13:07:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:07:54,280 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2020-07-07 13:07:54,281 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:07:54,281 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2020-07-07 13:07:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-07 13:07:54,289 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:07:54,290 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:07:54,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 13:07:54,290 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:07:54,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:07:54,291 INFO L82 PathProgramCache]: Analyzing trace with hash 99184320, now seen corresponding path program 3 times [2020-07-07 13:07:54,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:07:54,291 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1884202493] [2020-07-07 13:07:54,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:07:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,435 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-07 13:07:54,435 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:07:54,436 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1884202493] [2020-07-07 13:07:54,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:07:54,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:07:54,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960379002] [2020-07-07 13:07:54,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:07:54,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:07:54,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:07:54,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:07:54,438 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand 9 states. [2020-07-07 13:07:54,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:07:54,562 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2020-07-07 13:07:54,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-07 13:07:54,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2020-07-07 13:07:54,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:07:54,565 INFO L225 Difference]: With dead ends: 89 [2020-07-07 13:07:54,566 INFO L226 Difference]: Without dead ends: 83 [2020-07-07 13:07:54,567 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-07 13:07:54,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-07 13:07:54,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2020-07-07 13:07:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-07 13:07:54,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2020-07-07 13:07:54,585 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 52 [2020-07-07 13:07:54,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:07:54,586 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2020-07-07 13:07:54,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:07:54,586 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2020-07-07 13:07:54,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-07 13:07:54,591 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:07:54,592 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:07:54,592 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 13:07:54,592 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:07:54,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:07:54,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1883941443, now seen corresponding path program 4 times [2020-07-07 13:07:54,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:07:54,593 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [696451961] [2020-07-07 13:07:54,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:07:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 17 proven. 70 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-07-07 13:07:55,009 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:07:55,010 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [696451961] [2020-07-07 13:07:55,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:07:55,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-07 13:07:55,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082486757] [2020-07-07 13:07:55,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-07 13:07:55,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:07:55,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-07 13:07:55,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-07-07 13:07:55,012 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand 15 states. [2020-07-07 13:07:55,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:07:55,323 INFO L93 Difference]: Finished difference Result 142 states and 213 transitions. [2020-07-07 13:07:55,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-07 13:07:55,324 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 123 [2020-07-07 13:07:55,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:07:55,327 INFO L225 Difference]: With dead ends: 142 [2020-07-07 13:07:55,328 INFO L226 Difference]: Without dead ends: 73 [2020-07-07 13:07:55,329 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2020-07-07 13:07:55,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-07 13:07:55,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2020-07-07 13:07:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-07 13:07:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2020-07-07 13:07:55,343 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 123 [2020-07-07 13:07:55,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:07:55,344 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2020-07-07 13:07:55,344 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-07 13:07:55,344 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2020-07-07 13:07:55,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-07-07 13:07:55,348 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:07:55,348 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:07:55,348 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 13:07:55,348 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:07:55,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:07:55,349 INFO L82 PathProgramCache]: Analyzing trace with hash 532445701, now seen corresponding path program 5 times [2020-07-07 13:07:55,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:07:55,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [667784701] [2020-07-07 13:07:55,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 113 to 223 [2020-07-07 13:07:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:56,106 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 47 proven. 92 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2020-07-07 13:07:56,107 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:07:56,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [667784701] [2020-07-07 13:07:56,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:07:56,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-07-07 13:07:56,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604420047] [2020-07-07 13:07:56,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-07 13:07:56,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:07:56,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-07 13:07:56,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2020-07-07 13:07:56,110 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 18 states. [2020-07-07 13:07:56,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:07:56,589 INFO L93 Difference]: Finished difference Result 149 states and 214 transitions. [2020-07-07 13:07:56,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-07 13:07:56,590 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 193 [2020-07-07 13:07:56,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:07:56,592 INFO L225 Difference]: With dead ends: 149 [2020-07-07 13:07:56,593 INFO L226 Difference]: Without dead ends: 92 [2020-07-07 13:07:56,594 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=622, Unknown=0, NotChecked=0, Total=812 [2020-07-07 13:07:56,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-07 13:07:56,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2020-07-07 13:07:56,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-07 13:07:56,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2020-07-07 13:07:56,611 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 193 [2020-07-07 13:07:56,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:07:56,612 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2020-07-07 13:07:56,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-07 13:07:56,612 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2020-07-07 13:07:56,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-07-07 13:07:56,615 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:07:56,615 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:07:56,615 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 13:07:56,616 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:07:56,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:07:56,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1227428144, now seen corresponding path program 6 times [2020-07-07 13:07:56,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:07:56,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [405438003] [2020-07-07 13:07:56,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-07 13:07:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2020-07-07 13:07:57,251 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:07:57,252 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [405438003] [2020-07-07 13:07:57,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:07:57,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-07 13:07:57,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673544122] [2020-07-07 13:07:57,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-07 13:07:57,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:07:57,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-07 13:07:57,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-07-07 13:07:57,259 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand 15 states. [2020-07-07 13:07:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:07:57,536 INFO L93 Difference]: Finished difference Result 248 states and 331 transitions. [2020-07-07 13:07:57,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-07 13:07:57,538 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 228 [2020-07-07 13:07:57,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:07:57,543 INFO L225 Difference]: With dead ends: 248 [2020-07-07 13:07:57,543 INFO L226 Difference]: Without dead ends: 242 [2020-07-07 13:07:57,544 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-07-07 13:07:57,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-07-07 13:07:57,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 218. [2020-07-07 13:07:57,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-07-07 13:07:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 295 transitions. [2020-07-07 13:07:57,582 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 295 transitions. Word has length 228 [2020-07-07 13:07:57,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:07:57,583 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 295 transitions. [2020-07-07 13:07:57,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-07 13:07:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 295 transitions. [2020-07-07 13:07:57,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2020-07-07 13:07:57,590 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:07:57,590 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 13, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:07:57,590 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 13:07:57,591 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:07:57,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:07:57,591 INFO L82 PathProgramCache]: Analyzing trace with hash 260846875, now seen corresponding path program 7 times [2020-07-07 13:07:57,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:07:57,592 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [679234355] [2020-07-07 13:07:57,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-07 13:07:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:07:59,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2020-07-07 13:07:59,341 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:07:59,341 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [679234355] [2020-07-07 13:07:59,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:07:59,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-07-07 13:07:59,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348259521] [2020-07-07 13:07:59,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-07 13:07:59,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:07:59,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-07 13:07:59,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2020-07-07 13:07:59,344 INFO L87 Difference]: Start difference. First operand 218 states and 295 transitions. Second operand 22 states. [2020-07-07 13:08:00,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:08:00,510 INFO L93 Difference]: Finished difference Result 490 states and 689 transitions. [2020-07-07 13:08:00,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-07-07 13:08:00,510 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 369 [2020-07-07 13:08:00,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:08:00,518 INFO L225 Difference]: With dead ends: 490 [2020-07-07 13:08:00,518 INFO L226 Difference]: Without dead ends: 484 [2020-07-07 13:08:00,520 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=150, Invalid=1742, Unknown=0, NotChecked=0, Total=1892 [2020-07-07 13:08:00,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2020-07-07 13:08:00,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 242. [2020-07-07 13:08:00,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-07-07 13:08:00,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 340 transitions. [2020-07-07 13:08:00,577 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 340 transitions. Word has length 369 [2020-07-07 13:08:00,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:08:00,578 INFO L479 AbstractCegarLoop]: Abstraction has 242 states and 340 transitions. [2020-07-07 13:08:00,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-07 13:08:00,579 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 340 transitions. [2020-07-07 13:08:00,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2020-07-07 13:08:00,586 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:08:00,587 INFO L422 BasicCegarLoop]: trace histogram [45, 45, 36, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 14, 14, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:08:00,587 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-07 13:08:00,587 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:08:00,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:08:00,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1775818798, now seen corresponding path program 8 times [2020-07-07 13:08:00,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:08:00,588 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [344656310] [2020-07-07 13:08:00,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 113 to 223 [2020-07-07 13:08:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:01,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1205 backedges. 32 proven. 190 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2020-07-07 13:08:01,751 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:08:01,751 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [344656310] [2020-07-07 13:08:01,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:08:01,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-07 13:08:01,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743788915] [2020-07-07 13:08:01,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-07 13:08:01,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:08:01,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-07 13:08:01,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-07 13:08:01,754 INFO L87 Difference]: Start difference. First operand 242 states and 340 transitions. Second operand 12 states. [2020-07-07 13:08:02,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:08:02,024 INFO L93 Difference]: Finished difference Result 469 states and 690 transitions. [2020-07-07 13:08:02,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-07 13:08:02,025 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 404 [2020-07-07 13:08:02,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:08:02,032 INFO L225 Difference]: With dead ends: 469 [2020-07-07 13:08:02,033 INFO L226 Difference]: Without dead ends: 237 [2020-07-07 13:08:02,036 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2020-07-07 13:08:02,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2020-07-07 13:08:02,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2020-07-07 13:08:02,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-07-07 13:08:02,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 309 transitions. [2020-07-07 13:08:02,086 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 309 transitions. Word has length 404 [2020-07-07 13:08:02,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:08:02,087 INFO L479 AbstractCegarLoop]: Abstraction has 234 states and 309 transitions. [2020-07-07 13:08:02,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-07 13:08:02,087 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 309 transitions. [2020-07-07 13:08:02,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2020-07-07 13:08:02,096 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:08:02,097 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 15, 15, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:08:02,097 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-07 13:08:02,097 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:08:02,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:08:02,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1790400411, now seen corresponding path program 9 times [2020-07-07 13:08:02,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:08:02,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1914293892] [2020-07-07 13:08:02,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-07 13:08:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 55 proven. 247 refuted. 0 times theorem prover too weak. 1020 trivial. 0 not checked. [2020-07-07 13:08:03,350 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:08:03,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1914293892] [2020-07-07 13:08:03,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:08:03,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-07-07 13:08:03,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067527141] [2020-07-07 13:08:03,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-07 13:08:03,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:08:03,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-07 13:08:03,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2020-07-07 13:08:03,352 INFO L87 Difference]: Start difference. First operand 234 states and 309 transitions. Second operand 24 states. [2020-07-07 13:08:04,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:08:04,021 INFO L93 Difference]: Finished difference Result 385 states and 586 transitions. [2020-07-07 13:08:04,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-07-07 13:08:04,022 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 422 [2020-07-07 13:08:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:08:04,025 INFO L225 Difference]: With dead ends: 385 [2020-07-07 13:08:04,025 INFO L226 Difference]: Without dead ends: 161 [2020-07-07 13:08:04,028 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=367, Invalid=1355, Unknown=0, NotChecked=0, Total=1722 [2020-07-07 13:08:04,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-07-07 13:08:04,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 129. [2020-07-07 13:08:04,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-07-07 13:08:04,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 169 transitions. [2020-07-07 13:08:04,044 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 169 transitions. Word has length 422 [2020-07-07 13:08:04,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:08:04,045 INFO L479 AbstractCegarLoop]: Abstraction has 129 states and 169 transitions. [2020-07-07 13:08:04,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-07 13:08:04,045 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 169 transitions. [2020-07-07 13:08:04,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2020-07-07 13:08:04,055 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:08:04,055 INFO L422 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 16, 16, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:08:04,056 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-07 13:08:04,056 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:08:04,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:08:04,056 INFO L82 PathProgramCache]: Analyzing trace with hash 2100877470, now seen corresponding path program 10 times [2020-07-07 13:08:04,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:08:04,057 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1847586338] [2020-07-07 13:08:04,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-07 13:08:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1554 backedges. 105 proven. 221 refuted. 0 times theorem prover too weak. 1228 trivial. 0 not checked. [2020-07-07 13:08:05,228 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:08:05,229 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1847586338] [2020-07-07 13:08:05,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:08:05,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-07 13:08:05,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986546261] [2020-07-07 13:08:05,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-07 13:08:05,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:08:05,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-07 13:08:05,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2020-07-07 13:08:05,231 INFO L87 Difference]: Start difference. First operand 129 states and 169 transitions. Second operand 20 states. [2020-07-07 13:08:05,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:08:05,717 INFO L93 Difference]: Finished difference Result 256 states and 351 transitions. [2020-07-07 13:08:05,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-07 13:08:05,718 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 457 [2020-07-07 13:08:05,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:08:05,722 INFO L225 Difference]: With dead ends: 256 [2020-07-07 13:08:05,722 INFO L226 Difference]: Without dead ends: 137 [2020-07-07 13:08:05,724 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2020-07-07 13:08:05,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-07-07 13:08:05,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 117. [2020-07-07 13:08:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-07 13:08:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2020-07-07 13:08:05,739 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 457 [2020-07-07 13:08:05,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:08:05,740 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2020-07-07 13:08:05,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-07 13:08:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2020-07-07 13:08:05,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2020-07-07 13:08:05,745 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:08:05,745 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 21, 21, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:08:05,745 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-07 13:08:05,746 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:08:05,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:08:05,746 INFO L82 PathProgramCache]: Analyzing trace with hash -554586347, now seen corresponding path program 11 times [2020-07-07 13:08:05,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:08:05,751 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [469368437] [2020-07-07 13:08:05,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-07 13:08:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:08:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2842 backedges. 8 proven. 220 refuted. 0 times theorem prover too weak. 2614 trivial. 0 not checked. [2020-07-07 13:08:07,281 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:08:07,281 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [469368437] [2020-07-07 13:08:07,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:08:07,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-07 13:08:07,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319557545] [2020-07-07 13:08:07,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-07 13:08:07,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:08:07,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-07 13:08:07,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-07-07 13:08:07,283 INFO L87 Difference]: Start difference. First operand 117 states and 148 transitions. Second operand 16 states. [2020-07-07 13:08:07,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:08:07,542 INFO L93 Difference]: Finished difference Result 235 states and 315 transitions. [2020-07-07 13:08:07,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-07 13:08:07,543 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 598 [2020-07-07 13:08:07,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:08:07,545 INFO L225 Difference]: With dead ends: 235 [2020-07-07 13:08:07,545 INFO L226 Difference]: Without dead ends: 0 [2020-07-07 13:08:07,547 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2020-07-07 13:08:07,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-07 13:08:07,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-07 13:08:07,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-07 13:08:07,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-07 13:08:07,548 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 598 [2020-07-07 13:08:07,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:08:07,548 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-07 13:08:07,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-07 13:08:07,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-07 13:08:07,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-07 13:08:07,549 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-07 13:08:07,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-07 13:08:09,767 WARN L193 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 65 [2020-07-07 13:08:10,358 WARN L193 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2020-07-07 13:08:10,913 WARN L193 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 83 [2020-07-07 13:08:11,527 WARN L193 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 63 [2020-07-07 13:08:12,069 WARN L193 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 63 [2020-07-07 13:08:12,582 WARN L193 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 65 [2020-07-07 13:08:12,892 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 42 [2020-07-07 13:08:13,247 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 42 [2020-07-07 13:08:13,298 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-07 13:08:13,298 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-07 13:08:13,298 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-07 13:08:13,299 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-07 13:08:13,299 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-07 13:08:13,299 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-07 13:08:13,299 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 27) the Hoare annotation is: false [2020-07-07 13:08:13,299 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 23 30) the Hoare annotation is: true [2020-07-07 13:08:13,299 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: false [2020-07-07 13:08:13,299 INFO L264 CegarLoopResult]: At program point L26(lines 26 28) the Hoare annotation is: (and (<= 7 main_~x~0) (<= main_~result~0 13) (<= 13 main_~result~0)) [2020-07-07 13:08:13,300 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= 7 main_~x~0) (<= main_~x~0 7)) [2020-07-07 13:08:13,300 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 23 30) the Hoare annotation is: (<= 7 main_~x~0) [2020-07-07 13:08:13,300 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (and (<= 7 main_~x~0) (<= |main_#t~ret2| 13) (<= 13 |main_#t~ret2|)) [2020-07-07 13:08:13,300 INFO L264 CegarLoopResult]: At program point L26-2(lines 26 28) the Hoare annotation is: (<= 7 main_~x~0) [2020-07-07 13:08:13,300 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (and (<= 7 main_~x~0) (<= |main_#t~ret2| 13) (<= 13 |main_#t~ret2|)) [2020-07-07 13:08:13,301 INFO L264 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: (and (<= 7 main_~x~0) (<= main_~result~0 13) (<= |main_#t~ret2| 13) (<= 13 |main_#t~ret2|) (<= 13 main_~result~0)) [2020-07-07 13:08:13,301 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 23 30) the Hoare annotation is: (<= 7 main_~x~0) [2020-07-07 13:08:13,301 INFO L264 CegarLoopResult]: At program point fiboEXIT(lines 5 13) the Hoare annotation is: (let ((.cse1 (< 0 fibo_~n)) (.cse10 (<= |fibo_#res| 1)) (.cse11 (<= 1 |fibo_#res|)) (.cse9 (= fibo_~n |fibo_#in~n|)) (.cse8 (<= 4 fibo_~n))) (let ((.cse0 (and (<= fibo_~n 4) (<= |fibo_#res| 3) (<= 3 |fibo_#res|) .cse8)) (.cse2 (and (<= fibo_~n 6) (<= |fibo_#res| 8) (<= 6 fibo_~n) .cse9 (<= 8 |fibo_#res|))) (.cse3 (and .cse9 (<= 13 |fibo_#res|) (<= 7 fibo_~n) (<= fibo_~n 7) (<= |fibo_#res| 13))) (.cse7 (and .cse9 (<= 8 fibo_~n))) (.cse4 (and .cse1 .cse10 .cse11 (<= |fibo_#in~n| 1))) (.cse5 (and (< 1 fibo_~n) .cse10 (<= fibo_~n 2) .cse11)) (.cse6 (<= |fibo_#in~n| 0))) (and (or .cse0 (not (<= 4 |fibo_#in~n|)) (not (<= |fibo_#in~n| 4))) (or (and (<= 0 |fibo_#res|) (<= |fibo_#res| 0)) .cse1) (or (and (<= 2 |fibo_#res|) (<= fibo_~n 3) (<= |fibo_#res| 2)) .cse2 .cse3 .cse4 .cse5 .cse0 .cse6 .cse7 (and (<= 5 |fibo_#res|) (<= |fibo_#res| 5) .cse8)) (or .cse2 .cse3 .cse7 (and .cse9 (<= fibo_~n 5))) (or .cse4 .cse5 .cse6 (not (<= |fibo_#in~n| 2)))))) [2020-07-07 13:08:13,301 INFO L264 CegarLoopResult]: At program point fiboFINAL(lines 5 13) the Hoare annotation is: (let ((.cse1 (< 0 fibo_~n)) (.cse10 (<= |fibo_#res| 1)) (.cse11 (<= 1 |fibo_#res|)) (.cse9 (= fibo_~n |fibo_#in~n|)) (.cse8 (<= 4 fibo_~n))) (let ((.cse0 (and (<= fibo_~n 4) (<= |fibo_#res| 3) (<= 3 |fibo_#res|) .cse8)) (.cse2 (and (<= fibo_~n 6) (<= |fibo_#res| 8) (<= 6 fibo_~n) .cse9 (<= 8 |fibo_#res|))) (.cse3 (and .cse9 (<= 13 |fibo_#res|) (<= 7 fibo_~n) (<= fibo_~n 7) (<= |fibo_#res| 13))) (.cse7 (and .cse9 (<= 8 fibo_~n))) (.cse4 (and .cse1 .cse10 .cse11 (<= |fibo_#in~n| 1))) (.cse5 (and (< 1 fibo_~n) .cse10 (<= fibo_~n 2) .cse11)) (.cse6 (<= |fibo_#in~n| 0))) (and (or .cse0 (not (<= 4 |fibo_#in~n|)) (not (<= |fibo_#in~n| 4))) (or (and (<= 0 |fibo_#res|) (<= |fibo_#res| 0)) .cse1) (or (and (<= 2 |fibo_#res|) (<= fibo_~n 3) (<= |fibo_#res| 2)) .cse2 .cse3 .cse4 .cse5 .cse0 .cse6 .cse7 (and (<= 5 |fibo_#res|) (<= |fibo_#res| 5) .cse8)) (or .cse2 .cse3 .cse7 (and .cse9 (<= fibo_~n 5))) (or .cse4 .cse5 .cse6 (not (<= |fibo_#in~n| 2)))))) [2020-07-07 13:08:13,301 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (= fibo_~n |fibo_#in~n|) (not (<= |fibo_#in~n| 1))) [2020-07-07 13:08:13,302 INFO L264 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (let ((.cse1 (<= 1 |fibo_#t~ret0|)) (.cse2 (<= |fibo_#t~ret0| 1)) (.cse0 (= fibo_~n |fibo_#in~n|))) (or (and (<= 3 |fibo_#t~ret0|) .cse0 (<= 5 fibo_~n) (<= |fibo_#t~ret0| 3) (<= fibo_~n 5)) (and .cse1 .cse2 .cse0 (<= fibo_~n 3) (<= 3 fibo_~n)) (and .cse0 (<= fibo_~n 4) (<= |fibo_#t~ret0| 2) (<= 2 |fibo_#t~ret0|) (<= 4 fibo_~n)) (and .cse0 (<= 8 fibo_~n)) (and .cse0 (<= |fibo_#t~ret0| 8) (<= 7 fibo_~n) (<= 8 |fibo_#t~ret0|)) (and .cse1 .cse2 .cse0 (< 1 fibo_~n) (<= fibo_~n 2)) (and (<= 5 |fibo_#t~ret0|) (<= fibo_~n 6) (<= 6 fibo_~n) (<= |fibo_#t~ret0| 5) .cse0))) [2020-07-07 13:08:13,302 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (< 0 fibo_~n) (= fibo_~n |fibo_#in~n|) (<= |fibo_#in~n| 1)) [2020-07-07 13:08:13,302 INFO L264 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (let ((.cse1 (<= 1 |fibo_#t~ret0|)) (.cse2 (<= |fibo_#t~ret0| 1)) (.cse0 (= fibo_~n |fibo_#in~n|))) (or (and (<= 3 |fibo_#t~ret0|) .cse0 (<= 5 fibo_~n) (<= |fibo_#t~ret0| 3) (<= fibo_~n 5)) (and .cse1 .cse2 .cse0 (<= fibo_~n 3) (<= 3 fibo_~n)) (and .cse0 (<= fibo_~n 4) (<= |fibo_#t~ret0| 2) (<= 2 |fibo_#t~ret0|) (<= 4 fibo_~n)) (and .cse0 (<= 8 fibo_~n)) (and .cse0 (<= |fibo_#t~ret0| 8) (<= 7 fibo_~n) (<= 8 |fibo_#t~ret0|)) (and .cse1 .cse2 .cse0 (< 1 fibo_~n) (<= fibo_~n 2)) (and (<= 5 |fibo_#t~ret0|) (<= fibo_~n 6) (<= 6 fibo_~n) (<= |fibo_#t~ret0| 5) .cse0))) [2020-07-07 13:08:13,302 INFO L264 CegarLoopResult]: At program point L8(lines 8 12) the Hoare annotation is: (and (< 0 fibo_~n) (= fibo_~n |fibo_#in~n|)) [2020-07-07 13:08:13,302 INFO L264 CegarLoopResult]: At program point L11-3(line 11) the Hoare annotation is: (let ((.cse7 (<= 1 |fibo_#t~ret0|)) (.cse8 (<= |fibo_#t~ret0| 1)) (.cse6 (= fibo_~n |fibo_#in~n|)) (.cse2 (+ |fibo_#t~ret0| |fibo_#t~ret1|))) (let ((.cse0 (and .cse7 .cse8 .cse6 (<= 2 .cse2) (<= fibo_~n 3) (<= 3 fibo_~n) (<= .cse2 2))) (.cse1 (and (<= .cse2 1) .cse7 (<= 1 .cse2) .cse8 .cse6 (< 1 fibo_~n) (<= fibo_~n 2))) (.cse3 (and (<= .cse2 13) .cse6 (<= |fibo_#t~ret0| 8) (<= 7 fibo_~n) (<= 13 .cse2) (<= 8 |fibo_#t~ret0|))) (.cse4 (and (<= 5 |fibo_#t~ret0|) (<= fibo_~n 6) (<= 6 fibo_~n) (<= |fibo_#t~ret0| 5) .cse6 (<= .cse2 8) (<= 8 .cse2))) (.cse5 (and .cse6 (<= 8 fibo_~n)))) (and (or (not (<= |fibo_#in~n| 3)) .cse0 .cse1) (or (and (<= 3 .cse2) (<= .cse2 3) (<= fibo_~n 4) (<= |fibo_#t~ret0| 2) (<= 2 |fibo_#t~ret0|)) .cse3 .cse4 .cse0 .cse5 (and (<= 5 .cse2) (<= 3 |fibo_#t~ret0|) (<= 5 fibo_~n) (<= |fibo_#t~ret0| 3) (<= .cse2 5)) .cse1) (or .cse3 .cse4 .cse5 (and .cse6 (<= fibo_~n 5)))))) [2020-07-07 13:08:13,302 INFO L264 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (and (= fibo_~n |fibo_#in~n|) (<= |fibo_#in~n| 0)) [2020-07-07 13:08:13,303 INFO L264 CegarLoopResult]: At program point L11-4(line 11) the Hoare annotation is: (let ((.cse7 (<= 1 |fibo_#t~ret0|)) (.cse8 (<= |fibo_#t~ret0| 1)) (.cse6 (= fibo_~n |fibo_#in~n|)) (.cse2 (+ |fibo_#t~ret0| |fibo_#t~ret1|))) (let ((.cse0 (and .cse7 .cse8 .cse6 (<= 2 .cse2) (<= fibo_~n 3) (<= 3 fibo_~n) (<= .cse2 2))) (.cse1 (and (<= .cse2 1) .cse7 (<= 1 .cse2) .cse8 .cse6 (< 1 fibo_~n) (<= fibo_~n 2))) (.cse3 (and (<= .cse2 13) .cse6 (<= |fibo_#t~ret0| 8) (<= 7 fibo_~n) (<= 13 .cse2) (<= 8 |fibo_#t~ret0|))) (.cse4 (and (<= 5 |fibo_#t~ret0|) (<= fibo_~n 6) (<= 6 fibo_~n) (<= |fibo_#t~ret0| 5) .cse6 (<= .cse2 8) (<= 8 .cse2))) (.cse5 (and .cse6 (<= 8 fibo_~n)))) (and (or (not (<= |fibo_#in~n| 3)) .cse0 .cse1) (or (and (<= 3 .cse2) (<= .cse2 3) (<= fibo_~n 4) (<= |fibo_#t~ret0| 2) (<= 2 |fibo_#t~ret0|)) .cse3 .cse4 .cse0 .cse5 (and (<= 5 .cse2) (<= 3 |fibo_#t~ret0|) (<= 5 fibo_~n) (<= |fibo_#t~ret0| 3) (<= .cse2 5)) .cse1) (or .cse3 .cse4 .cse5 (and .cse6 (<= fibo_~n 5)))))) [2020-07-07 13:08:13,303 INFO L264 CegarLoopResult]: At program point L6(lines 6 12) the Hoare annotation is: (= fibo_~n |fibo_#in~n|) [2020-07-07 13:08:13,303 INFO L264 CegarLoopResult]: At program point L11-5(line 11) the Hoare annotation is: (let ((.cse0 (<= 1 |fibo_#t~ret0|)) (.cse2 (+ |fibo_#t~ret0| |fibo_#t~ret1|)) (.cse1 (<= |fibo_#t~ret0| 1))) (let ((.cse3 (and (<= .cse2 1) .cse0 (<= 1 .cse2) .cse1 (< 1 fibo_~n) (<= |fibo_#res| 1) (<= fibo_~n 2) (<= 1 |fibo_#res|)))) (and (or (and .cse0 (<= 2 |fibo_#res|) .cse1 (<= 2 .cse2) (<= .cse2 2) (<= |fibo_#res| 2)) .cse3 (not (<= |fibo_#in~n| 3))) (let ((.cse4 (= fibo_~n |fibo_#in~n|))) (or (and (<= .cse2 13) .cse4 (<= |fibo_#t~ret0| 8) (<= 13 |fibo_#res|) (<= 7 fibo_~n) (<= 13 .cse2) (<= |fibo_#res| 13) (<= 8 |fibo_#t~ret0|)) (and (<= 5 |fibo_#t~ret0|) (<= fibo_~n 6) (<= |fibo_#res| 8) (<= |fibo_#t~ret0| 5) .cse4 (<= 8 |fibo_#res|) (<= .cse2 8) (<= 8 .cse2)) (and .cse4 (<= 8 fibo_~n)) (and .cse4 (<= fibo_~n 5)))) (or .cse3 (not (<= |fibo_#in~n| 2))) (or (not (<= |fibo_#in~n| 5)) (and (<= 5 |fibo_#res|) (<= 5 .cse2) (<= 3 |fibo_#t~ret0|) (<= |fibo_#res| 5) (<= |fibo_#t~ret0| 3) (<= .cse2 5)) (not (<= 5 |fibo_#in~n|))) (or (and (<= 3 .cse2) (<= .cse2 3) (<= |fibo_#t~ret0| 2) (<= |fibo_#res| 3) (<= 2 |fibo_#t~ret0|) (<= 3 |fibo_#res|)) (not (<= 4 |fibo_#in~n|)) (not (<= |fibo_#in~n| 4)))))) [2020-07-07 13:08:13,303 INFO L271 CegarLoopResult]: At program point fiboENTRY(lines 5 13) the Hoare annotation is: true [2020-07-07 13:08:13,303 INFO L264 CegarLoopResult]: At program point L11-6(line 11) the Hoare annotation is: (let ((.cse3 (<= 1 |fibo_#t~ret0|)) (.cse4 (<= |fibo_#t~ret0| 1)) (.cse2 (<= 5 fibo_~n))) (let ((.cse1 (and (<= 5 |fibo_#res|) (<= 3 |fibo_#t~ret0|) (<= |fibo_#res| 5) .cse2 (<= |fibo_#t~ret0| 3) (<= fibo_~n 5))) (.cse5 (and .cse3 .cse4 (<= |fibo_#res| 1) (<= fibo_~n 2) (<= 1 |fibo_#res|)))) (and (not (<= |fibo_#in~n| 1)) (let ((.cse0 (= fibo_~n |fibo_#in~n|))) (or (and .cse0 (<= |fibo_#t~ret0| 8) (<= 13 |fibo_#res|) (<= |fibo_#res| 13) (<= 8 |fibo_#t~ret0|)) (and .cse0 (<= 8 fibo_~n)) (and (<= fibo_~n 6) .cse0))) (or (not (<= |fibo_#in~n| 5)) .cse1 (not (<= 5 |fibo_#in~n|))) (or .cse1 (and (<= fibo_~n 4) (<= |fibo_#t~ret0| 2) (<= |fibo_#res| 3) (<= 2 |fibo_#t~ret0|) (<= 3 |fibo_#res|) (<= 4 fibo_~n)) (and (<= 5 |fibo_#t~ret0|) (<= |fibo_#res| 8) (<= |fibo_#t~ret0| 5) .cse2 (<= 8 |fibo_#res|)) (and .cse3 (<= 2 |fibo_#res|) .cse4 (<= fibo_~n 3) (<= |fibo_#res| 2)) (<= 7 fibo_~n) .cse5) (or (not (<= |fibo_#in~n| 2)) .cse5)))) [2020-07-07 13:08:13,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 01:08:13 BoogieIcfgContainer [2020-07-07 13:08:13,334 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 13:08:13,336 INFO L168 Benchmark]: Toolchain (without parser) took 21307.58 ms. Allocated memory was 138.9 MB in the beginning and 759.7 MB in the end (delta: 620.8 MB). Free memory was 104.3 MB in the beginning and 279.1 MB in the end (delta: -174.8 MB). Peak memory consumption was 637.9 MB. Max. memory is 7.1 GB. [2020-07-07 13:08:13,337 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-07 13:08:13,337 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.83 ms. Allocated memory is still 138.9 MB. Free memory was 104.0 MB in the beginning and 94.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-07 13:08:13,341 INFO L168 Benchmark]: Boogie Preprocessor took 22.36 ms. Allocated memory is still 138.9 MB. Free memory was 94.7 MB in the beginning and 93.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-07 13:08:13,344 INFO L168 Benchmark]: RCFGBuilder took 308.32 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 93.3 MB in the beginning and 170.1 MB in the end (delta: -76.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-07 13:08:13,345 INFO L168 Benchmark]: TraceAbstraction took 20738.68 ms. Allocated memory was 202.9 MB in the beginning and 759.7 MB in the end (delta: 556.8 MB). Free memory was 170.1 MB in the beginning and 279.1 MB in the end (delta: -108.9 MB). Peak memory consumption was 639.8 MB. Max. memory is 7.1 GB. [2020-07-07 13:08:13,351 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.24 ms. Allocated memory is still 138.9 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 230.83 ms. Allocated memory is still 138.9 MB. Free memory was 104.0 MB in the beginning and 94.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.36 ms. Allocated memory is still 138.9 MB. Free memory was 94.7 MB in the beginning and 93.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 308.32 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 93.3 MB in the beginning and 170.1 MB in the end (delta: -76.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20738.68 ms. Allocated memory was 202.9 MB in the beginning and 759.7 MB in the end (delta: 556.8 MB). Free memory was 170.1 MB in the beginning and 279.1 MB in the end (delta: -108.9 MB). Peak memory consumption was 639.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: 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: 23]: Procedure Contract for main Derived contract for procedure main: 7 <= x - ProcedureContractResult [Line: 5]: Procedure Contract for fibo Derived contract for procedure fibo: ((((((((n <= 4 && \result <= 3) && 3 <= \result) && 4 <= n) || !(4 <= \old(n))) || !(\old(n) <= 4)) && ((0 <= \result && \result <= 0) || 0 < n)) && ((((((((((2 <= \result && n <= 3) && \result <= 2) || ((((n <= 6 && \result <= 8) && 6 <= n) && n == \old(n)) && 8 <= \result)) || ((((n == \old(n) && 13 <= \result) && 7 <= n) && n <= 7) && \result <= 13)) || (((0 < n && \result <= 1) && 1 <= \result) && \old(n) <= 1)) || (((1 < n && \result <= 1) && n <= 2) && 1 <= \result)) || (((n <= 4 && \result <= 3) && 3 <= \result) && 4 <= n)) || \old(n) <= 0) || (n == \old(n) && 8 <= n)) || ((5 <= \result && \result <= 5) && 4 <= n))) && (((((((n <= 6 && \result <= 8) && 6 <= n) && n == \old(n)) && 8 <= \result) || ((((n == \old(n) && 13 <= \result) && 7 <= n) && n <= 7) && \result <= 13)) || (n == \old(n) && 8 <= n)) || (n == \old(n) && n <= 5))) && ((((((0 < n && \result <= 1) && 1 <= \result) && \old(n) <= 1) || (((1 < n && \result <= 1) && n <= 2) && 1 <= \result)) || \old(n) <= 0) || !(\old(n) <= 2)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 14.9s, OverallIterations: 14, TraceHistogramMax: 67, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 536 SDtfs, 1025 SDslu, 2873 SDs, 0 SdLazy, 2933 SolverSat, 726 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1020 GetRequests, 781 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=242occurred in iteration=10, 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, 14 MinimizatonAttempts, 351 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 1935 PreInvPairs, 3394 NumberOfFragments, 1689 HoareAnnotationTreeSize, 1935 FomulaSimplifications, 28345 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 31 FomulaSimplificationsInter, 12872 FormulaSimplificationTreeSizeReductionInter, 4.0s 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...