/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/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 14:01:11,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 14:01:11,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 14:01:11,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 14:01:11,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 14:01:11,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 14:01:11,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 14:01:11,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 14:01:11,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 14:01:11,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 14:01:11,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 14:01:11,815 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 14:01:11,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 14:01:11,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 14:01:11,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 14:01:11,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 14:01:11,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 14:01:11,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 14:01:11,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 14:01:11,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 14:01:11,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 14:01:11,838 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 14:01:11,839 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 14:01:11,839 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 14:01:11,842 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 14:01:11,842 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 14:01:11,842 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 14:01:11,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 14:01:11,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 14:01:11,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 14:01:11,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 14:01:11,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 14:01:11,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 14:01:11,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 14:01:11,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 14:01:11,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 14:01:11,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 14:01:11,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 14:01:11,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 14:01:11,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 14:01:11,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 14:01:11,856 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 14:01:11,885 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 14:01:11,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 14:01:11,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 14:01:11,890 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 14:01:11,890 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 14:01:11,890 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 14:01:11,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 14:01:11,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 14:01:11,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 14:01:11,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 14:01:11,891 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 14:01:11,891 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 14:01:11,891 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 14:01:11,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 14:01:11,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 14:01:11,892 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-07 14:01:11,892 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 14:01:11,894 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 14:01:11,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 14:01:11,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 14:01:11,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-07 14:01:11,895 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 14:01:11,895 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-07 14:01:12,184 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 14:01:12,199 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 14:01:12,202 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 14:01:12,204 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 14:01:12,204 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 14:01:12,205 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-07-07 14:01:12,281 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53b9d889c/6decbe9e05af49759032931dd3d72251/FLAGf6e0e2be9 [2020-07-07 14:01:12,816 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 14:01:12,817 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-07-07 14:01:12,824 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53b9d889c/6decbe9e05af49759032931dd3d72251/FLAGf6e0e2be9 [2020-07-07 14:01:13,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53b9d889c/6decbe9e05af49759032931dd3d72251 [2020-07-07 14:01:13,171 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 14:01:13,173 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 14:01:13,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 14:01:13,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 14:01:13,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 14:01:13,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 02:01:13" (1/1) ... [2020-07-07 14:01:13,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5250edf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 02:01:13, skipping insertion in model container [2020-07-07 14:01:13,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 02:01:13" (1/1) ... [2020-07-07 14:01:13,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 14:01:13,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 14:01:13,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 14:01:13,393 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 14:01:13,413 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 14:01:13,430 INFO L208 MainTranslator]: Completed translation [2020-07-07 14:01:13,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 02:01:13 WrapperNode [2020-07-07 14:01:13,430 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 14:01:13,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 14:01:13,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 14:01:13,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 14:01:13,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 02:01:13" (1/1) ... [2020-07-07 14:01:13,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 02:01:13" (1/1) ... [2020-07-07 14:01:13,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 02:01:13" (1/1) ... [2020-07-07 14:01:13,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 02:01:13" (1/1) ... [2020-07-07 14:01:13,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 02:01:13" (1/1) ... [2020-07-07 14:01:13,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 02:01:13" (1/1) ... [2020-07-07 14:01:13,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 02:01:13" (1/1) ... [2020-07-07 14:01:13,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 14:01:13,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 14:01:13,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 14:01:13,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 14:01:13,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 02:01:13" (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 14:01:13,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 14:01:13,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 14:01:13,627 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-07 14:01:13,627 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-07 14:01:13,627 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 14:01:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 14:01:13,627 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-07 14:01:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-07 14:01:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-07 14:01:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 14:01:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 14:01:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 14:01:13,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 14:01:13,900 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 14:01:13,900 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-07 14:01:13,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 02:01:13 BoogieIcfgContainer [2020-07-07 14:01:13,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 14:01:13,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 14:01:13,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 14:01:13,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 14:01:13,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 02:01:13" (1/3) ... [2020-07-07 14:01:13,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c9fe0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 02:01:13, skipping insertion in model container [2020-07-07 14:01:13,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 02:01:13" (2/3) ... [2020-07-07 14:01:13,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c9fe0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 02:01:13, skipping insertion in model container [2020-07-07 14:01:13,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 02:01:13" (3/3) ... [2020-07-07 14:01:13,921 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2020-07-07 14:01:13,931 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-07 14:01:13,940 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 14:01:13,953 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 14:01:13,975 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 14:01:13,975 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 14:01:13,975 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-07 14:01:13,975 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 14:01:13,976 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 14:01:13,976 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 14:01:13,976 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 14:01:13,976 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 14:01:13,993 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2020-07-07 14:01:14,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-07 14:01:14,004 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:01:14,006 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:01:14,006 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:01:14,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:01:14,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1122321079, now seen corresponding path program 1 times [2020-07-07 14:01:14,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:01:14,019 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1730622492] [2020-07-07 14:01:14,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:01:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:14,155 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 14:01:14,156 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:01:14,158 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1730622492] [2020-07-07 14:01:14,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:01:14,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-07 14:01:14,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599487540] [2020-07-07 14:01:14,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-07 14:01:14,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:01:14,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-07 14:01:14,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-07 14:01:14,188 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 2 states. [2020-07-07 14:01:14,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:01:14,228 INFO L93 Difference]: Finished difference Result 91 states and 122 transitions. [2020-07-07 14:01:14,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-07 14:01:14,230 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2020-07-07 14:01:14,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:01:14,242 INFO L225 Difference]: With dead ends: 91 [2020-07-07 14:01:14,242 INFO L226 Difference]: Without dead ends: 47 [2020-07-07 14:01:14,248 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-07 14:01:14,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-07 14:01:14,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-07 14:01:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-07 14:01:14,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2020-07-07 14:01:14,305 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2020-07-07 14:01:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:01:14,306 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2020-07-07 14:01:14,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-07 14:01:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2020-07-07 14:01:14,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-07 14:01:14,308 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:01:14,308 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:01:14,309 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 14:01:14,309 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:01:14,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:01:14,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1949391841, now seen corresponding path program 1 times [2020-07-07 14:01:14,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:01:14,311 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [992691924] [2020-07-07 14:01:14,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:01:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:14,439 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 14:01:14,440 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:01:14,440 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [992691924] [2020-07-07 14:01:14,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:01:14,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 14:01:14,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809787552] [2020-07-07 14:01:14,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 14:01:14,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:01:14,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 14:01:14,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 14:01:14,444 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 5 states. [2020-07-07 14:01:14,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:01:14,578 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2020-07-07 14:01:14,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 14:01:14,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-07 14:01:14,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:01:14,581 INFO L225 Difference]: With dead ends: 66 [2020-07-07 14:01:14,581 INFO L226 Difference]: Without dead ends: 64 [2020-07-07 14:01:14,583 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 14:01:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-07 14:01:14,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2020-07-07 14:01:14,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-07 14:01:14,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2020-07-07 14:01:14,604 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 26 [2020-07-07 14:01:14,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:01:14,605 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2020-07-07 14:01:14,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 14:01:14,606 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2020-07-07 14:01:14,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-07 14:01:14,607 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:01:14,608 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:01:14,608 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 14:01:14,608 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:01:14,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:01:14,609 INFO L82 PathProgramCache]: Analyzing trace with hash -873076999, now seen corresponding path program 1 times [2020-07-07 14:01:14,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:01:14,609 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1053369908] [2020-07-07 14:01:14,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:01:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:14,749 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 14:01:14,750 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:01:14,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1053369908] [2020-07-07 14:01:14,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:01:14,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-07 14:01:14,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982023275] [2020-07-07 14:01:14,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-07 14:01:14,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:01:14,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-07 14:01:14,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-07 14:01:14,753 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 6 states. [2020-07-07 14:01:14,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:01:14,920 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2020-07-07 14:01:14,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 14:01:14,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-07-07 14:01:14,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:01:14,923 INFO L225 Difference]: With dead ends: 70 [2020-07-07 14:01:14,923 INFO L226 Difference]: Without dead ends: 68 [2020-07-07 14:01:14,924 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-07 14:01:14,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-07 14:01:14,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2020-07-07 14:01:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-07 14:01:14,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2020-07-07 14:01:14,944 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 31 [2020-07-07 14:01:14,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:01:14,944 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2020-07-07 14:01:14,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-07 14:01:14,945 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2020-07-07 14:01:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-07 14:01:14,947 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:01:14,947 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:01:14,947 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 14:01:14,948 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:01:14,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:01:14,948 INFO L82 PathProgramCache]: Analyzing trace with hash 2057902492, now seen corresponding path program 1 times [2020-07-07 14:01:14,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:01:14,949 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1460460773] [2020-07-07 14:01:14,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:01:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:15,064 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 14:01:15,083 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:01:15,084 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1460460773] [2020-07-07 14:01:15,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:01:15,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 14:01:15,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123212775] [2020-07-07 14:01:15,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 14:01:15,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:01:15,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 14:01:15,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-07 14:01:15,088 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 7 states. [2020-07-07 14:01:15,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:01:15,239 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2020-07-07 14:01:15,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 14:01:15,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2020-07-07 14:01:15,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:01:15,242 INFO L225 Difference]: With dead ends: 77 [2020-07-07 14:01:15,242 INFO L226 Difference]: Without dead ends: 75 [2020-07-07 14:01:15,243 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 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 14:01:15,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-07 14:01:15,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2020-07-07 14:01:15,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-07 14:01:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2020-07-07 14:01:15,259 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 39 [2020-07-07 14:01:15,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:01:15,259 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2020-07-07 14:01:15,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 14:01:15,259 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2020-07-07 14:01:15,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-07 14:01:15,261 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:01:15,261 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:01:15,261 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 14:01:15,262 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:01:15,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:01:15,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1847294180, now seen corresponding path program 1 times [2020-07-07 14:01:15,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:01:15,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1554409876] [2020-07-07 14:01:15,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:01:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:15,371 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 14:01:15,371 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:01:15,371 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1554409876] [2020-07-07 14:01:15,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:01:15,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 14:01:15,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800158495] [2020-07-07 14:01:15,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 14:01:15,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:01:15,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 14:01:15,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-07 14:01:15,374 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 8 states. [2020-07-07 14:01:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:01:15,583 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2020-07-07 14:01:15,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-07 14:01:15,583 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-07-07 14:01:15,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:01:15,585 INFO L225 Difference]: With dead ends: 81 [2020-07-07 14:01:15,585 INFO L226 Difference]: Without dead ends: 63 [2020-07-07 14:01:15,586 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-07 14:01:15,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-07 14:01:15,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2020-07-07 14:01:15,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-07 14:01:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2020-07-07 14:01:15,598 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 44 [2020-07-07 14:01:15,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:01:15,598 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2020-07-07 14:01:15,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 14:01:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2020-07-07 14:01:15,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-07 14:01:15,600 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:01:15,600 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:01:15,600 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 14:01:15,601 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:01:15,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:01:15,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1076854334, now seen corresponding path program 1 times [2020-07-07 14:01:15,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:01:15,602 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1141245006] [2020-07-07 14:01:15,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:01:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:15,706 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 14:01:15,707 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:01:15,707 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1141245006] [2020-07-07 14:01:15,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:01:15,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 14:01:15,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700400944] [2020-07-07 14:01:15,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 14:01:15,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:01:15,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 14:01:15,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-07 14:01:15,709 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 7 states. [2020-07-07 14:01:15,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:01:15,801 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2020-07-07 14:01:15,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 14:01:15,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-07-07 14:01:15,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:01:15,803 INFO L225 Difference]: With dead ends: 72 [2020-07-07 14:01:15,803 INFO L226 Difference]: Without dead ends: 70 [2020-07-07 14:01:15,803 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 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 14:01:15,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-07 14:01:15,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2020-07-07 14:01:15,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-07 14:01:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2020-07-07 14:01:15,814 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 43 [2020-07-07 14:01:15,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:01:15,815 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2020-07-07 14:01:15,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 14:01:15,815 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2020-07-07 14:01:15,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-07 14:01:15,816 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:01:15,817 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:01:15,817 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 14:01:15,817 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:01:15,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:01:15,818 INFO L82 PathProgramCache]: Analyzing trace with hash 146364602, now seen corresponding path program 1 times [2020-07-07 14:01:15,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:01:15,818 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1926853776] [2020-07-07 14:01:15,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:01:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:15,963 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 14:01:15,963 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:01:15,963 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1926853776] [2020-07-07 14:01:15,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:01:15,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 14:01:15,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967528640] [2020-07-07 14:01:15,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 14:01:15,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:01:15,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 14:01:15,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-07 14:01:15,966 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 9 states. [2020-07-07 14:01:16,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:01:16,221 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2020-07-07 14:01:16,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 14:01:16,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-07-07 14:01:16,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:01:16,224 INFO L225 Difference]: With dead ends: 98 [2020-07-07 14:01:16,224 INFO L226 Difference]: Without dead ends: 96 [2020-07-07 14:01:16,225 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-07-07 14:01:16,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-07 14:01:16,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2020-07-07 14:01:16,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-07 14:01:16,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2020-07-07 14:01:16,240 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 48 [2020-07-07 14:01:16,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:01:16,240 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2020-07-07 14:01:16,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 14:01:16,241 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2020-07-07 14:01:16,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-07 14:01:16,242 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:01:16,242 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:01:16,243 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 14:01:16,243 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:01:16,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:01:16,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1943579560, now seen corresponding path program 1 times [2020-07-07 14:01:16,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:01:16,244 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [655926897] [2020-07-07 14:01:16,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:01:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:16,330 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 14:01:16,331 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:01:16,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [655926897] [2020-07-07 14:01:16,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:01:16,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 14:01:16,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387487980] [2020-07-07 14:01:16,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 14:01:16,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:01:16,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 14:01:16,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-07 14:01:16,333 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 7 states. [2020-07-07 14:01:16,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:01:16,436 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2020-07-07 14:01:16,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 14:01:16,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2020-07-07 14:01:16,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:01:16,440 INFO L225 Difference]: With dead ends: 83 [2020-07-07 14:01:16,440 INFO L226 Difference]: Without dead ends: 81 [2020-07-07 14:01:16,441 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 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 14:01:16,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-07 14:01:16,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-07-07 14:01:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-07 14:01:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2020-07-07 14:01:16,454 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 56 [2020-07-07 14:01:16,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:01:16,454 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2020-07-07 14:01:16,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 14:01:16,455 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2020-07-07 14:01:16,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-07 14:01:16,456 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:01:16,456 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:01:16,456 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 14:01:16,457 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:01:16,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:01:16,457 INFO L82 PathProgramCache]: Analyzing trace with hash 903884048, now seen corresponding path program 1 times [2020-07-07 14:01:16,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:01:16,458 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [653753530] [2020-07-07 14:01:16,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:01:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:16,560 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 14:01:16,560 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:01:16,560 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [653753530] [2020-07-07 14:01:16,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:01:16,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 14:01:16,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001160631] [2020-07-07 14:01:16,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 14:01:16,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:01:16,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 14:01:16,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-07 14:01:16,562 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 8 states. [2020-07-07 14:01:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:01:16,762 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2020-07-07 14:01:16,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-07 14:01:16,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-07-07 14:01:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:01:16,765 INFO L225 Difference]: With dead ends: 100 [2020-07-07 14:01:16,765 INFO L226 Difference]: Without dead ends: 98 [2020-07-07 14:01:16,766 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-07 14:01:16,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-07 14:01:16,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2020-07-07 14:01:16,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-07 14:01:16,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2020-07-07 14:01:16,780 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 61 [2020-07-07 14:01:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:01:16,781 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2020-07-07 14:01:16,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 14:01:16,781 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2020-07-07 14:01:16,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-07 14:01:16,783 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:01:16,783 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:01:16,783 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 14:01:16,783 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:01:16,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:01:16,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1662212275, now seen corresponding path program 1 times [2020-07-07 14:01:16,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:01:16,784 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1005645530] [2020-07-07 14:01:16,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:01:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:16,880 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 14:01:16,880 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:01:16,881 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1005645530] [2020-07-07 14:01:16,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:01:16,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 14:01:16,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215936370] [2020-07-07 14:01:16,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 14:01:16,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:01:16,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 14:01:16,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-07 14:01:16,883 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 9 states. [2020-07-07 14:01:17,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:01:17,060 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2020-07-07 14:01:17,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 14:01:17,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2020-07-07 14:01:17,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:01:17,063 INFO L225 Difference]: With dead ends: 100 [2020-07-07 14:01:17,063 INFO L226 Difference]: Without dead ends: 98 [2020-07-07 14:01:17,064 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2020-07-07 14:01:17,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-07 14:01:17,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-07-07 14:01:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-07 14:01:17,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2020-07-07 14:01:17,079 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 69 [2020-07-07 14:01:17,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:01:17,079 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2020-07-07 14:01:17,079 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 14:01:17,080 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2020-07-07 14:01:17,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-07-07 14:01:17,081 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:01:17,081 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:01:17,081 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-07 14:01:17,081 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:01:17,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:01:17,082 INFO L82 PathProgramCache]: Analyzing trace with hash 71900773, now seen corresponding path program 1 times [2020-07-07 14:01:17,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:01:17,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [306302885] [2020-07-07 14:01:17,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:01:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:17,237 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 14:01:17,237 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:01:17,238 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [306302885] [2020-07-07 14:01:17,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:01:17,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-07 14:01:17,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102451842] [2020-07-07 14:01:17,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-07 14:01:17,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:01:17,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-07 14:01:17,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-07 14:01:17,240 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 11 states. [2020-07-07 14:01:17,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:01:17,684 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2020-07-07 14:01:17,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-07 14:01:17,685 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2020-07-07 14:01:17,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:01:17,687 INFO L225 Difference]: With dead ends: 119 [2020-07-07 14:01:17,687 INFO L226 Difference]: Without dead ends: 101 [2020-07-07 14:01:17,688 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2020-07-07 14:01:17,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-07 14:01:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2020-07-07 14:01:17,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-07 14:01:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2020-07-07 14:01:17,701 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 74 [2020-07-07 14:01:17,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:01:17,702 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2020-07-07 14:01:17,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-07 14:01:17,702 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2020-07-07 14:01:17,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-07 14:01:17,703 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:01:17,703 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:01:17,704 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-07 14:01:17,704 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:01:17,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:01:17,704 INFO L82 PathProgramCache]: Analyzing trace with hash -50388093, now seen corresponding path program 1 times [2020-07-07 14:01:17,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:01:17,705 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1057688363] [2020-07-07 14:01:17,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:01:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:17,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 14:01:17,896 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:01:17,896 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1057688363] [2020-07-07 14:01:17,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:01:17,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-07 14:01:17,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067758494] [2020-07-07 14:01:17,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-07 14:01:17,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:01:17,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-07 14:01:17,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-07 14:01:17,907 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 11 states. [2020-07-07 14:01:18,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:01:18,197 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2020-07-07 14:01:18,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-07 14:01:18,198 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2020-07-07 14:01:18,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:01:18,200 INFO L225 Difference]: With dead ends: 128 [2020-07-07 14:01:18,200 INFO L226 Difference]: Without dead ends: 126 [2020-07-07 14:01:18,201 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2020-07-07 14:01:18,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-07-07 14:01:18,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 107. [2020-07-07 14:01:18,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-07-07 14:01:18,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2020-07-07 14:01:18,220 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 78 [2020-07-07 14:01:18,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:01:18,222 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2020-07-07 14:01:18,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-07 14:01:18,222 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2020-07-07 14:01:18,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-07 14:01:18,227 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:01:18,227 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:01:18,227 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-07 14:01:18,228 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:01:18,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:01:18,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1911943399, now seen corresponding path program 2 times [2020-07-07 14:01:18,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:01:18,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1653639894] [2020-07-07 14:01:18,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:01:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-07 14:01:18,455 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:01:18,455 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1653639894] [2020-07-07 14:01:18,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:01:18,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-07 14:01:18,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653014855] [2020-07-07 14:01:18,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-07 14:01:18,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:01:18,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-07 14:01:18,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-07 14:01:18,459 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 11 states. [2020-07-07 14:01:18,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:01:18,852 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2020-07-07 14:01:18,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-07 14:01:18,853 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2020-07-07 14:01:18,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:01:18,855 INFO L225 Difference]: With dead ends: 134 [2020-07-07 14:01:18,856 INFO L226 Difference]: Without dead ends: 132 [2020-07-07 14:01:18,860 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2020-07-07 14:01:18,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-07-07 14:01:18,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 120. [2020-07-07 14:01:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-07 14:01:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2020-07-07 14:01:18,877 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 91 [2020-07-07 14:01:18,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:01:18,877 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2020-07-07 14:01:18,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-07 14:01:18,878 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2020-07-07 14:01:18,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-07-07 14:01:18,879 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:01:18,879 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:01:18,879 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-07 14:01:18,880 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:01:18,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:01:18,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1949077486, now seen corresponding path program 2 times [2020-07-07 14:01:18,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:01:18,887 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1161457250] [2020-07-07 14:01:18,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:01:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-07 14:01:19,110 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:01:19,110 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1161457250] [2020-07-07 14:01:19,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:01:19,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-07 14:01:19,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531186577] [2020-07-07 14:01:19,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-07 14:01:19,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:01:19,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-07 14:01:19,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-07-07 14:01:19,112 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand 13 states. [2020-07-07 14:01:19,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:01:19,409 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2020-07-07 14:01:19,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-07 14:01:19,411 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2020-07-07 14:01:19,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:01:19,413 INFO L225 Difference]: With dead ends: 126 [2020-07-07 14:01:19,413 INFO L226 Difference]: Without dead ends: 109 [2020-07-07 14:01:19,414 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2020-07-07 14:01:19,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-07-07 14:01:19,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2020-07-07 14:01:19,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-07-07 14:01:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2020-07-07 14:01:19,429 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 104 [2020-07-07 14:01:19,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:01:19,430 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2020-07-07 14:01:19,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-07 14:01:19,430 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2020-07-07 14:01:19,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-07-07 14:01:19,431 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:01:19,431 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:01:19,432 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-07 14:01:19,433 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:01:19,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:01:19,433 INFO L82 PathProgramCache]: Analyzing trace with hash 55355532, now seen corresponding path program 2 times [2020-07-07 14:01:19,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:01:19,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [52227487] [2020-07-07 14:01:19,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:01:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-07 14:01:19,724 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:01:19,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [52227487] [2020-07-07 14:01:19,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:01:19,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-07-07 14:01:19,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831553038] [2020-07-07 14:01:19,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-07 14:01:19,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:01:19,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-07 14:01:19,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2020-07-07 14:01:19,727 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand 17 states. [2020-07-07 14:01:20,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:01:20,259 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2020-07-07 14:01:20,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-07 14:01:20,260 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 108 [2020-07-07 14:01:20,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:01:20,261 INFO L225 Difference]: With dead ends: 130 [2020-07-07 14:01:20,261 INFO L226 Difference]: Without dead ends: 128 [2020-07-07 14:01:20,266 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2020-07-07 14:01:20,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-07 14:01:20,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 117. [2020-07-07 14:01:20,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-07 14:01:20,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2020-07-07 14:01:20,285 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 108 [2020-07-07 14:01:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:01:20,286 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2020-07-07 14:01:20,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-07 14:01:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2020-07-07 14:01:20,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-07-07 14:01:20,291 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 14:01:20,291 INFO L422 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 14:01:20,292 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-07 14:01:20,292 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 14:01:20,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 14:01:20,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1897035733, now seen corresponding path program 3 times [2020-07-07 14:01:20,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 14:01:20,293 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1643945811] [2020-07-07 14:01:20,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 14:01:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 14:01:20,810 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-07 14:01:20,810 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 14:01:20,810 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1643945811] [2020-07-07 14:01:20,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 14:01:20,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-07-07 14:01:20,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873133191] [2020-07-07 14:01:20,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-07 14:01:20,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 14:01:20,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-07 14:01:20,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2020-07-07 14:01:20,812 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 21 states. [2020-07-07 14:01:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 14:01:21,382 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2020-07-07 14:01:21,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-07 14:01:21,383 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 138 [2020-07-07 14:01:21,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 14:01:21,383 INFO L225 Difference]: With dead ends: 117 [2020-07-07 14:01:21,384 INFO L226 Difference]: Without dead ends: 0 [2020-07-07 14:01:21,387 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=890, Unknown=0, NotChecked=0, Total=1122 [2020-07-07 14:01:21,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-07 14:01:21,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-07 14:01:21,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-07 14:01:21,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-07 14:01:21,389 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2020-07-07 14:01:21,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 14:01:21,389 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-07 14:01:21,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-07 14:01:21,390 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-07 14:01:21,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-07 14:01:21,390 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-07 14:01:21,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-07 14:01:22,702 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 26 [2020-07-07 14:01:22,891 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 29 [2020-07-07 14:01:23,358 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 36 [2020-07-07 14:01:23,363 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-07 14:01:23,363 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-07 14:01:23,363 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-07 14:01:23,363 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-07 14:01:23,364 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-07 14:01:23,364 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-07 14:01:23,364 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-07 14:01:23,364 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-07 14:01:23,364 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-07 14:01:23,364 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-07 14:01:23,364 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-07 14:01:23,365 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (let ((.cse0 (<= 2 main_~bufferlen~0)) (.cse1 (+ main_~buf~0 main_~inlen~0)) (.cse2 (<= 0 main_~in~0)) (.cse3 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse4 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse5 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~buflim~0 3) .cse1) .cse2 .cse3 .cse4 (<= 1 main_~buf~0) .cse5) (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) .cse1) .cse2 .cse3 .cse4 (<= 0 main_~buf~0) .cse5))) [2020-07-07 14:01:23,365 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 45) the Hoare annotation is: true [2020-07-07 14:01:23,365 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-07 14:01:23,365 INFO L271 CegarLoopResult]: At program point L44(lines 14 45) the Hoare annotation is: true [2020-07-07 14:01:23,365 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 |main_#t~post5|) (<= (+ |main_#t~post5| 2) main_~bufferlen~0) (<= 0 main_~buf~0)) [2020-07-07 14:01:23,365 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 0 |main_#t~post5|) (<= (+ |main_#t~post5| 2) main_~bufferlen~0) (<= 1 main_~buf~0)) [2020-07-07 14:01:23,365 INFO L264 CegarLoopResult]: At program point L36(lines 26 37) the Hoare annotation is: (let ((.cse1 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~buflim~0 3) .cse1) (<= 1 main_~in~0) .cse2 (<= 1 main_~buf~0) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse1) .cse0 (<= 0 main_~in~0) .cse2 .cse3 (<= 0 main_~buf~0)))) [2020-07-07 14:01:23,366 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse9 (+ main_~in~0 main_~buflim~0 3))) (let ((.cse0 (<= 2 main_~bufferlen~0)) (.cse2 (<= (+ |main_#t~post3| 1) main_~buflim~0)) (.cse3 (<= .cse9 (+ |main_#t~post3| main_~inlen~0))) (.cse1 (+ main_~buf~0 main_~inlen~0)) (.cse4 (<= 0 |main_#t~post3|)) (.cse6 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse5 (<= 0 main_~in~0)) (.cse7 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse8 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 main_~buf~0) .cse8) (and .cse0 .cse2 .cse3 (<= .cse9 .cse1) .cse4 .cse6 .cse5 .cse7 (<= 1 main_~buf~0) .cse8)))) [2020-07-07 14:01:23,366 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (and (<= (+ main_~in~0 main_~buflim~0 4) (+ main_~buf~0 main_~inlen~0)) (<= (+ |main_#t~post3| 1) main_~buflim~0) (<= (+ main_~in~0 main_~buflim~0 3) (+ |main_#t~post3| main_~inlen~0)) (<= main_~buf~0 main_~buflim~0) (<= 0 |main_#t~post3|) (<= 0 main_~in~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~buf~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-07-07 14:01:23,366 INFO L264 CegarLoopResult]: At program point L28(lines 28 29) the Hoare annotation is: (let ((.cse1 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~buflim~0 3) .cse1) (<= 1 main_~in~0) .cse2 (<= 1 main_~buf~0) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse1) .cse0 (<= 0 main_~in~0) .cse2 .cse3 (<= 0 main_~buf~0)))) [2020-07-07 14:01:23,366 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= 0 main_~buf~0)) [2020-07-07 14:01:23,366 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-07-07 14:01:23,366 INFO L264 CegarLoopResult]: At program point L20-1(lines 14 45) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2020-07-07 14:01:23,367 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-07 14:01:23,367 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-07-07 14:01:23,367 INFO L271 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: true [2020-07-07 14:01:23,367 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 1 main_~buf~0)) [2020-07-07 14:01:23,367 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (<= 2 main_~bufferlen~0) (<= (+ main_~buf~0 1) main_~bufferlen~0)) [2020-07-07 14:01:23,367 INFO L264 CegarLoopResult]: At program point L33(lines 33 34) the Hoare annotation is: (and (<= (+ main_~in~0 main_~buflim~0 4) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0) (<= 0 main_~in~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~buf~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-07-07 14:01:23,368 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 main_~in~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0) (<= 0 main_~buf~0)) [2020-07-07 14:01:23,368 INFO L264 CegarLoopResult]: At program point L21(lines 14 45) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2020-07-07 14:01:23,368 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-07 14:01:23,368 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-07 14:01:23,368 INFO L271 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: true [2020-07-07 14:01:23,368 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 45) the Hoare annotation is: true [2020-07-07 14:01:23,368 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-07 14:01:23,368 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 main_~buf~0)) [2020-07-07 14:01:23,369 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (let ((.cse0 (+ main_~buf~0 main_~inlen~0))) (and (<= 0 |main_#t~post4|) (<= (+ main_~in~0 main_~buflim~0 4) .cse0) (<= main_~buf~0 main_~buflim~0) (<= (+ |main_#t~post4| main_~buflim~0 4) .cse0) (<= 0 main_~in~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~buf~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))) [2020-07-07 14:01:23,369 INFO L264 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 (+ main_~buf~0 main_~inlen~0))) (and (<= 0 |main_#t~post4|) (<= (+ main_~in~0 main_~buflim~0 3) .cse0) (<= main_~buf~0 main_~buflim~0) (<= (+ |main_#t~post4| main_~buflim~0 4) .cse0) (<= 1 main_~in~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~buf~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))) [2020-07-07 14:01:23,369 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (let ((.cse0 (+ main_~buf~0 main_~inlen~0)) (.cse1 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse0) (<= 0 main_~in~0) .cse1 .cse2 (<= 0 main_~buf~0) .cse3) (and (<= (+ main_~in~0 main_~buflim~0 3) .cse0) .cse1 (<= 1 main_~in~0) .cse2 (<= 1 main_~buf~0) .cse3))) [2020-07-07 14:01:23,369 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 45) the Hoare annotation is: true [2020-07-07 14:01:23,370 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (let ((.cse0 (+ main_~buf~0 main_~inlen~0)) (.cse1 (<= (+ main_~buf~0 1) main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse0) (<= 0 main_~in~0) .cse1 .cse2 (<= 0 main_~buf~0) .cse3) (and (<= (+ main_~in~0 main_~buflim~0 3) .cse0) .cse1 (<= 1 main_~in~0) .cse2 (<= 1 main_~buf~0) .cse3))) [2020-07-07 14:01:23,370 INFO L264 CegarLoopResult]: At program point L26-1(lines 26 37) the Hoare annotation is: (let ((.cse1 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~buflim~0 3) .cse1) (<= 1 main_~in~0) .cse2 (<= 1 main_~buf~0) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse1) .cse0 (<= 0 main_~in~0) .cse2 .cse3 (<= 0 main_~buf~0)))) [2020-07-07 14:01:23,370 INFO L264 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 main_~buf~0)) [2020-07-07 14:01:23,370 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-07-07 14:01:23,370 INFO L264 CegarLoopResult]: At program point L26-4(line 26) the Hoare annotation is: (let ((.cse1 (+ main_~buf~0 main_~inlen~0)) (.cse0 (<= main_~buf~0 main_~buflim~0)) (.cse2 (<= (+ main_~buflim~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= (+ main_~in~0 main_~buflim~0 3) .cse1) (<= 1 main_~in~0) .cse2 (<= 1 main_~buf~0) .cse3) (and (<= (+ main_~in~0 main_~bufferlen~0 1) .cse1) .cse0 (<= 0 main_~in~0) .cse2 .cse3 (<= 0 main_~buf~0)))) [2020-07-07 14:01:23,371 INFO L264 CegarLoopResult]: At program point L26-5(lines 26 37) the Hoare annotation is: (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 main_~buf~0)) [2020-07-07 14:01:23,371 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-07 14:01:23,371 INFO L271 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-07-07 14:01:23,371 INFO L271 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: true [2020-07-07 14:01:23,371 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 0 main_~buf~0)) [2020-07-07 14:01:23,371 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0) (<= 1 main_~in~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~buf~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-07-07 14:01:23,372 INFO L264 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: (and (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) (<= main_~buf~0 main_~buflim~0) (<= 1 main_~in~0) (<= (+ main_~buflim~0 2) main_~bufferlen~0) (<= 1 main_~buf~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-07-07 14:01:23,372 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-07 14:01:23,372 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-07 14:01:23,372 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-07 14:01:23,372 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-07 14:01:23,372 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-07 14:01:23,373 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-07 14:01:23,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 02:01:23 BoogieIcfgContainer [2020-07-07 14:01:23,397 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 14:01:23,399 INFO L168 Benchmark]: Toolchain (without parser) took 10226.29 ms. Allocated memory was 138.4 MB in the beginning and 319.8 MB in the end (delta: 181.4 MB). Free memory was 102.6 MB in the beginning and 215.9 MB in the end (delta: -113.3 MB). Peak memory consumption was 188.4 MB. Max. memory is 7.1 GB. [2020-07-07 14:01:23,399 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-07 14:01:23,400 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.84 ms. Allocated memory is still 138.4 MB. Free memory was 102.2 MB in the beginning and 92.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-07 14:01:23,401 INFO L168 Benchmark]: Boogie Preprocessor took 124.74 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 92.1 MB in the beginning and 183.3 MB in the end (delta: -91.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2020-07-07 14:01:23,402 INFO L168 Benchmark]: RCFGBuilder took 347.48 ms. Allocated memory is still 203.4 MB. Free memory was 182.3 MB in the beginning and 166.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2020-07-07 14:01:23,403 INFO L168 Benchmark]: TraceAbstraction took 9486.51 ms. Allocated memory was 203.4 MB in the beginning and 319.8 MB in the end (delta: 116.4 MB). Free memory was 166.2 MB in the beginning and 215.9 MB in the end (delta: -49.7 MB). Peak memory consumption was 187.0 MB. Max. memory is 7.1 GB. [2020-07-07 14:01:23,406 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.23 ms. Allocated memory is still 138.4 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 256.84 ms. Allocated memory is still 138.4 MB. Free memory was 102.2 MB in the beginning and 92.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.74 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 92.1 MB in the beginning and 183.3 MB in the end (delta: -91.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 347.48 ms. Allocated memory is still 203.4 MB. Free memory was 182.3 MB in the beginning and 166.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9486.51 ms. Allocated memory was 203.4 MB in the beginning and 319.8 MB in the end (delta: 116.4 MB). Free memory was 166.2 MB in the beginning and 215.9 MB in the end (delta: -49.7 MB). Peak memory consumption was 187.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((((buf <= buflim && in + buflim + 3 <= buf + inlen) && 1 <= in) && buflim + 2 <= bufferlen) && 1 <= buf) && bufferlen + 1 <= inlen) || (((((in + bufferlen + 1 <= buf + inlen && buf <= buflim) && 0 <= in) && buflim + 2 <= bufferlen) && bufferlen + 1 <= inlen) && 0 <= buf) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.4s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 863 SDtfs, 890 SDslu, 3800 SDs, 0 SdLazy, 1803 SolverSat, 394 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 239 SyntacticMatches, 2 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 101 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 55 LocationsWithAnnotation, 289 PreInvPairs, 460 NumberOfFragments, 917 HoareAnnotationTreeSize, 289 FomulaSimplifications, 48443 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 55 FomulaSimplificationsInter, 3826 FormulaSimplificationTreeSizeReductionInter, 1.4s 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...