/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-lit/gsv2008.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 17:49:40,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 17:49:40,877 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 17:49:40,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 17:49:40,922 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 17:49:40,923 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 17:49:40,925 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 17:49:40,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 17:49:40,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 17:49:40,931 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 17:49:40,932 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 17:49:40,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 17:49:40,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 17:49:40,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 17:49:40,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 17:49:40,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 17:49:40,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 17:49:40,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 17:49:40,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 17:49:40,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 17:49:40,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 17:49:40,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 17:49:40,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 17:49:40,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 17:49:40,958 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 17:49:40,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 17:49:40,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 17:49:40,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 17:49:40,965 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 17:49:40,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 17:49:40,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 17:49:40,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 17:49:40,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 17:49:40,974 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 17:49:40,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 17:49:40,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 17:49:40,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 17:49:40,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 17:49:40,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 17:49:40,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 17:49:40,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 17:49:40,996 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 17:49:41,018 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 17:49:41,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 17:49:41,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 17:49:41,022 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 17:49:41,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 17:49:41,023 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 17:49:41,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 17:49:41,024 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 17:49:41,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 17:49:41,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 17:49:41,026 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 17:49:41,026 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 17:49:41,026 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 17:49:41,026 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 17:49:41,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 17:49:41,027 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 17:49:41,028 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 17:49:41,028 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 17:49:41,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 17:49:41,028 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 17:49:41,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 17:49:41,029 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 17:49:41,029 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 17:49:41,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 17:49:41,602 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 17:49:41,608 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 17:49:41,610 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 17:49:41,611 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 17:49:41,613 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008.i [2020-09-04 17:49:41,714 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2def4f715/d72b11e62ef5470bb2019dc31c886a47/FLAG03dcfb1d6 [2020-09-04 17:49:42,372 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 17:49:42,373 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/loop-lit/gsv2008.i [2020-09-04 17:49:42,384 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2def4f715/d72b11e62ef5470bb2019dc31c886a47/FLAG03dcfb1d6 [2020-09-04 17:49:42,703 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2def4f715/d72b11e62ef5470bb2019dc31c886a47 [2020-09-04 17:49:42,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 17:49:42,723 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 17:49:42,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 17:49:42,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 17:49:42,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 17:49:42,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 05:49:42" (1/1) ... [2020-09-04 17:49:42,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7234b81c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:49:42, skipping insertion in model container [2020-09-04 17:49:42,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 05:49:42" (1/1) ... [2020-09-04 17:49:42,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 17:49:42,791 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 17:49:43,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 17:49:43,037 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 17:49:43,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 17:49:43,079 INFO L208 MainTranslator]: Completed translation [2020-09-04 17:49:43,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:49:43 WrapperNode [2020-09-04 17:49:43,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 17:49:43,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 17:49:43,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 17:49:43,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 17:49:43,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:49:43" (1/1) ... [2020-09-04 17:49:43,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:49:43" (1/1) ... [2020-09-04 17:49:43,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:49:43" (1/1) ... [2020-09-04 17:49:43,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:49:43" (1/1) ... [2020-09-04 17:49:43,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:49:43" (1/1) ... [2020-09-04 17:49:43,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:49:43" (1/1) ... [2020-09-04 17:49:43,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:49:43" (1/1) ... [2020-09-04 17:49:43,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 17:49:43,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 17:49:43,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 17:49:43,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 17:49:43,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:49:43" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 17:49:43,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 17:49:43,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 17:49:43,322 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 17:49:43,322 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 17:49:43,323 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 17:49:43,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 17:49:43,323 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 17:49:43,323 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 17:49:43,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 17:49:43,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 17:49:43,324 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 17:49:43,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 17:49:43,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 17:49:43,707 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 17:49:43,707 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 17:49:43,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 05:49:43 BoogieIcfgContainer [2020-09-04 17:49:43,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 17:49:43,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 17:49:43,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 17:49:43,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 17:49:43,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 05:49:42" (1/3) ... [2020-09-04 17:49:43,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69062ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 05:49:43, skipping insertion in model container [2020-09-04 17:49:43,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:49:43" (2/3) ... [2020-09-04 17:49:43,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69062ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 05:49:43, skipping insertion in model container [2020-09-04 17:49:43,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 05:49:43" (3/3) ... [2020-09-04 17:49:43,725 INFO L109 eAbstractionObserver]: Analyzing ICFG gsv2008.i [2020-09-04 17:49:43,738 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 17:49:43,750 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 17:49:43,774 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 17:49:43,806 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 17:49:43,806 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 17:49:43,807 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 17:49:43,807 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 17:49:43,807 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 17:49:43,807 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 17:49:43,807 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 17:49:43,808 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 17:49:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-09-04 17:49:43,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 17:49:43,842 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:43,843 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:49:43,844 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:43,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:43,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2104509233, now seen corresponding path program 1 times [2020-09-04 17:49:43,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:43,864 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1681338810] [2020-09-04 17:49:43,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:43,944 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:44,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:44,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:49:44,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1681338810] [2020-09-04 17:49:44,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:44,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-04 17:49:44,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295393542] [2020-09-04 17:49:44,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-09-04 17:49:44,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:44,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-09-04 17:49:44,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-09-04 17:49:44,090 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2020-09-04 17:49:44,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:44,130 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2020-09-04 17:49:44,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-09-04 17:49:44,133 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2020-09-04 17:49:44,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:44,147 INFO L225 Difference]: With dead ends: 41 [2020-09-04 17:49:44,147 INFO L226 Difference]: Without dead ends: 21 [2020-09-04 17:49:44,153 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-09-04 17:49:44,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-09-04 17:49:44,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-09-04 17:49:44,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-09-04 17:49:44,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2020-09-04 17:49:44,215 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2020-09-04 17:49:44,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:44,216 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2020-09-04 17:49:44,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-09-04 17:49:44,216 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-09-04 17:49:44,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 17:49:44,217 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:44,217 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:49:44,218 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 17:49:44,218 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:44,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:44,219 INFO L82 PathProgramCache]: Analyzing trace with hash 2097121065, now seen corresponding path program 1 times [2020-09-04 17:49:44,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:44,220 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1057847722] [2020-09-04 17:49:44,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:44,222 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:44,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:49:44,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1057847722] [2020-09-04 17:49:44,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:44,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 17:49:44,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149505774] [2020-09-04 17:49:44,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 17:49:44,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:44,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 17:49:44,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 17:49:44,293 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 3 states. [2020-09-04 17:49:44,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:44,329 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-09-04 17:49:44,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 17:49:44,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-09-04 17:49:44,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:44,332 INFO L225 Difference]: With dead ends: 28 [2020-09-04 17:49:44,332 INFO L226 Difference]: Without dead ends: 23 [2020-09-04 17:49:44,334 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 17:49:44,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-04 17:49:44,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-09-04 17:49:44,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-09-04 17:49:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2020-09-04 17:49:44,344 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 16 [2020-09-04 17:49:44,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:44,344 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2020-09-04 17:49:44,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 17:49:44,345 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2020-09-04 17:49:44,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 17:49:44,346 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:44,346 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] [2020-09-04 17:49:44,347 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 17:49:44,347 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:44,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:44,348 INFO L82 PathProgramCache]: Analyzing trace with hash -588245929, now seen corresponding path program 1 times [2020-09-04 17:49:44,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:44,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1761127446] [2020-09-04 17:49:44,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:44,390 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:44,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:44,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:49:44,593 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1761127446] [2020-09-04 17:49:44,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:44,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 17:49:44,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138324317] [2020-09-04 17:49:44,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 17:49:44,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:44,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 17:49:44,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-09-04 17:49:44,597 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 9 states. [2020-09-04 17:49:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:44,792 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2020-09-04 17:49:44,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 17:49:44,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-09-04 17:49:44,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:44,795 INFO L225 Difference]: With dead ends: 33 [2020-09-04 17:49:44,795 INFO L226 Difference]: Without dead ends: 28 [2020-09-04 17:49:44,796 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-09-04 17:49:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-09-04 17:49:44,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-09-04 17:49:44,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-09-04 17:49:44,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-09-04 17:49:44,806 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2020-09-04 17:49:44,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:44,807 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-09-04 17:49:44,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 17:49:44,807 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-09-04 17:49:44,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-04 17:49:44,809 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:44,809 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:49:44,809 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 17:49:44,809 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:44,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:44,810 INFO L82 PathProgramCache]: Analyzing trace with hash -590441495, now seen corresponding path program 2 times [2020-09-04 17:49:44,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:44,811 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [3433091] [2020-09-04 17:49:44,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:44,817 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:45,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:45,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:49:45,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [3433091] [2020-09-04 17:49:45,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:45,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 17:49:45,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091964108] [2020-09-04 17:49:45,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 17:49:45,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:45,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 17:49:45,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-09-04 17:49:45,087 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 12 states. [2020-09-04 17:49:45,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:45,396 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2020-09-04 17:49:45,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 17:49:45,397 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-09-04 17:49:45,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:45,398 INFO L225 Difference]: With dead ends: 38 [2020-09-04 17:49:45,398 INFO L226 Difference]: Without dead ends: 33 [2020-09-04 17:49:45,399 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2020-09-04 17:49:45,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-04 17:49:45,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-09-04 17:49:45,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-09-04 17:49:45,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2020-09-04 17:49:45,409 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2020-09-04 17:49:45,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:45,410 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2020-09-04 17:49:45,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 17:49:45,410 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2020-09-04 17:49:45,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-04 17:49:45,412 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:45,412 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:49:45,412 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 17:49:45,412 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:45,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:45,413 INFO L82 PathProgramCache]: Analyzing trace with hash -934609001, now seen corresponding path program 3 times [2020-09-04 17:49:45,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:45,414 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [135463000] [2020-09-04 17:49:45,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:45,420 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:45,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:49:45,683 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [135463000] [2020-09-04 17:49:45,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:45,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 17:49:45,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602285498] [2020-09-04 17:49:45,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 17:49:45,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:45,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 17:49:45,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2020-09-04 17:49:45,686 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 15 states. [2020-09-04 17:49:46,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:46,059 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-09-04 17:49:46,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 17:49:46,061 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 31 [2020-09-04 17:49:46,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:46,063 INFO L225 Difference]: With dead ends: 43 [2020-09-04 17:49:46,063 INFO L226 Difference]: Without dead ends: 38 [2020-09-04 17:49:46,064 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2020-09-04 17:49:46,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-09-04 17:49:46,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2020-09-04 17:49:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-09-04 17:49:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2020-09-04 17:49:46,088 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 31 [2020-09-04 17:49:46,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:46,089 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2020-09-04 17:49:46,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 17:49:46,089 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2020-09-04 17:49:46,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-04 17:49:46,092 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:46,092 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:49:46,093 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 17:49:46,093 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:46,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:46,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1774497961, now seen corresponding path program 4 times [2020-09-04 17:49:46,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:46,094 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1512297730] [2020-09-04 17:49:46,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:46,102 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:46,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:46,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:49:46,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1512297730] [2020-09-04 17:49:46,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:46,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 17:49:46,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302991198] [2020-09-04 17:49:46,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 17:49:46,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:46,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 17:49:46,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2020-09-04 17:49:46,441 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 18 states. [2020-09-04 17:49:46,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:46,960 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2020-09-04 17:49:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 17:49:46,962 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2020-09-04 17:49:46,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:46,964 INFO L225 Difference]: With dead ends: 48 [2020-09-04 17:49:46,964 INFO L226 Difference]: Without dead ends: 43 [2020-09-04 17:49:46,966 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2020-09-04 17:49:46,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-09-04 17:49:46,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2020-09-04 17:49:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 17:49:46,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2020-09-04 17:49:46,991 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2020-09-04 17:49:46,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:46,991 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2020-09-04 17:49:46,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 17:49:46,992 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-09-04 17:49:46,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-09-04 17:49:46,993 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:46,993 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:49:46,994 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 17:49:46,994 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:46,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:46,994 INFO L82 PathProgramCache]: Analyzing trace with hash -194454825, now seen corresponding path program 5 times [2020-09-04 17:49:46,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:46,995 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [315183352] [2020-09-04 17:49:46,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:47,000 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:47,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:47,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:49:47,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [315183352] [2020-09-04 17:49:47,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:47,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-09-04 17:49:47,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435116274] [2020-09-04 17:49:47,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 17:49:47,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:47,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 17:49:47,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2020-09-04 17:49:47,421 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 21 states. [2020-09-04 17:49:48,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:48,033 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2020-09-04 17:49:48,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 17:49:48,040 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2020-09-04 17:49:48,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:48,042 INFO L225 Difference]: With dead ends: 53 [2020-09-04 17:49:48,042 INFO L226 Difference]: Without dead ends: 48 [2020-09-04 17:49:48,045 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=953, Unknown=0, NotChecked=0, Total=1056 [2020-09-04 17:49:48,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-09-04 17:49:48,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2020-09-04 17:49:48,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-09-04 17:49:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2020-09-04 17:49:48,060 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 41 [2020-09-04 17:49:48,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:48,066 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2020-09-04 17:49:48,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 17:49:48,066 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2020-09-04 17:49:48,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-09-04 17:49:48,071 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:48,071 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:49:48,071 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 17:49:48,072 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:48,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:48,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1783487849, now seen corresponding path program 6 times [2020-09-04 17:49:48,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:48,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [672593986] [2020-09-04 17:49:48,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:48,079 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:48,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:48,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:49:48,605 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [672593986] [2020-09-04 17:49:48,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:48,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-09-04 17:49:48,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749908075] [2020-09-04 17:49:48,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-04 17:49:48,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:48,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-04 17:49:48,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2020-09-04 17:49:48,608 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2020-09-04 17:49:49,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:49,400 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2020-09-04 17:49:49,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-09-04 17:49:49,401 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2020-09-04 17:49:49,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:49,404 INFO L225 Difference]: With dead ends: 58 [2020-09-04 17:49:49,405 INFO L226 Difference]: Without dead ends: 53 [2020-09-04 17:49:49,406 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=1357, Unknown=0, NotChecked=0, Total=1482 [2020-09-04 17:49:49,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-09-04 17:49:49,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2020-09-04 17:49:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-09-04 17:49:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2020-09-04 17:49:49,417 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 46 [2020-09-04 17:49:49,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:49,417 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2020-09-04 17:49:49,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-04 17:49:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2020-09-04 17:49:49,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 17:49:49,419 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:49,419 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:49:49,419 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 17:49:49,419 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:49,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:49,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1046324759, now seen corresponding path program 7 times [2020-09-04 17:49:49,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:49,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [323655358] [2020-09-04 17:49:49,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:49,425 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:49,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:49:49,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [323655358] [2020-09-04 17:49:49,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:49,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2020-09-04 17:49:49,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440248092] [2020-09-04 17:49:49,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-09-04 17:49:49,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:49,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-09-04 17:49:49,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=644, Unknown=0, NotChecked=0, Total=702 [2020-09-04 17:49:49,969 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 27 states. [2020-09-04 17:49:50,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:50,967 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2020-09-04 17:49:50,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-09-04 17:49:50,969 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2020-09-04 17:49:50,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:50,970 INFO L225 Difference]: With dead ends: 63 [2020-09-04 17:49:50,971 INFO L226 Difference]: Without dead ends: 58 [2020-09-04 17:49:50,972 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=147, Invalid=1833, Unknown=0, NotChecked=0, Total=1980 [2020-09-04 17:49:50,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-09-04 17:49:50,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2020-09-04 17:49:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-09-04 17:49:50,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2020-09-04 17:49:50,981 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 51 [2020-09-04 17:49:50,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:50,981 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2020-09-04 17:49:50,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-09-04 17:49:50,982 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2020-09-04 17:49:50,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 17:49:50,983 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:50,983 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:49:50,983 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 17:49:50,984 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:50,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:50,984 INFO L82 PathProgramCache]: Analyzing trace with hash 232135209, now seen corresponding path program 8 times [2020-09-04 17:49:50,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:50,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1738397203] [2020-09-04 17:49:50,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:50,989 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:51,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:51,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:49:51,652 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1738397203] [2020-09-04 17:49:51,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:51,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2020-09-04 17:49:51,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401803849] [2020-09-04 17:49:51,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-09-04 17:49:51,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:51,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-09-04 17:49:51,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=805, Unknown=0, NotChecked=0, Total=870 [2020-09-04 17:49:51,654 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2020-09-04 17:49:52,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:52,859 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2020-09-04 17:49:52,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-09-04 17:49:52,860 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2020-09-04 17:49:52,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:52,861 INFO L225 Difference]: With dead ends: 68 [2020-09-04 17:49:52,862 INFO L226 Difference]: Without dead ends: 63 [2020-09-04 17:49:52,864 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=170, Invalid=2380, Unknown=0, NotChecked=0, Total=2550 [2020-09-04 17:49:52,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-09-04 17:49:52,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2020-09-04 17:49:52,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-09-04 17:49:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2020-09-04 17:49:52,873 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 56 [2020-09-04 17:49:52,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:52,874 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2020-09-04 17:49:52,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-09-04 17:49:52,874 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2020-09-04 17:49:52,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 17:49:52,875 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:52,876 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:49:52,876 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 17:49:52,876 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:52,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:52,877 INFO L82 PathProgramCache]: Analyzing trace with hash 977101143, now seen corresponding path program 9 times [2020-09-04 17:49:52,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:52,877 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [896943318] [2020-09-04 17:49:52,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:52,887 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:53,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:53,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:49:53,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [896943318] [2020-09-04 17:49:53,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:53,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2020-09-04 17:49:53,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611529882] [2020-09-04 17:49:53,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-09-04 17:49:53,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:53,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-09-04 17:49:53,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=984, Unknown=0, NotChecked=0, Total=1056 [2020-09-04 17:49:53,771 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 33 states. [2020-09-04 17:49:55,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:55,258 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2020-09-04 17:49:55,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-09-04 17:49:55,259 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 61 [2020-09-04 17:49:55,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:55,260 INFO L225 Difference]: With dead ends: 73 [2020-09-04 17:49:55,260 INFO L226 Difference]: Without dead ends: 68 [2020-09-04 17:49:55,262 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=194, Invalid=2998, Unknown=0, NotChecked=0, Total=3192 [2020-09-04 17:49:55,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-09-04 17:49:55,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2020-09-04 17:49:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-09-04 17:49:55,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2020-09-04 17:49:55,276 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 61 [2020-09-04 17:49:55,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:55,276 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2020-09-04 17:49:55,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-09-04 17:49:55,276 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2020-09-04 17:49:55,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-09-04 17:49:55,279 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:49:55,279 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:49:55,279 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 17:49:55,280 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:49:55,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:49:55,280 INFO L82 PathProgramCache]: Analyzing trace with hash 751396585, now seen corresponding path program 10 times [2020-09-04 17:49:55,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:49:55,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1810927845] [2020-09-04 17:49:55,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:49:55,288 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:49:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:56,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:49:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:49:56,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:49:56,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1810927845] [2020-09-04 17:49:56,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:49:56,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2020-09-04 17:49:56,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335595834] [2020-09-04 17:49:56,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-09-04 17:49:56,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:49:56,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-09-04 17:49:56,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1181, Unknown=0, NotChecked=0, Total=1260 [2020-09-04 17:49:56,225 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 36 states. [2020-09-04 17:49:58,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:49:58,023 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2020-09-04 17:49:58,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-09-04 17:49:58,023 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 66 [2020-09-04 17:49:58,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:49:58,024 INFO L225 Difference]: With dead ends: 68 [2020-09-04 17:49:58,024 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 17:49:58,026 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=221, Invalid=3685, Unknown=0, NotChecked=0, Total=3906 [2020-09-04 17:49:58,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 17:49:58,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 17:49:58,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 17:49:58,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 17:49:58,027 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2020-09-04 17:49:58,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:49:58,028 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 17:49:58,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-09-04 17:49:58,028 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 17:49:58,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 17:49:58,028 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 17:49:58,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 17:49:58,526 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2020-09-04 17:49:58,657 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2020-09-04 17:49:58,813 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 17:49:58,813 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 17:49:58,814 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 17:49:58,814 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 17:49:58,814 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 17:49:58,814 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 17:49:58,814 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-09-04 17:49:58,815 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-09-04 17:49:58,815 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-09-04 17:49:58,815 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-09-04 17:49:58,815 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-09-04 17:49:58,815 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 24) the Hoare annotation is: true [2020-09-04 17:49:58,815 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (let ((.cse1 (* 6 main_~y~0))) (let ((.cse0 (<= (+ main_~x~0 65) .cse1))) (or (<= (+ main_~x~0 51) main_~y~0) (<= (+ main_~x~0 50) 0) (<= (+ main_~x~0 56) (* 3 main_~y~0)) (and .cse0 (<= (+ main_~x~0 86) (* 8 main_~y~0))) (and (<= (+ main_~x~0 105) (* 10 main_~y~0)) .cse0) (<= (+ main_~x~0 60) (* 4 main_~y~0)) (<= (+ main_~x~0 71) .cse1)))) [2020-09-04 17:49:58,816 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (<= (+ main_~x~0 50) 0) [2020-09-04 17:49:58,816 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-09-04 17:49:58,816 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-09-04 17:49:58,816 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 24) the Hoare annotation is: true [2020-09-04 17:49:58,816 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 24) the Hoare annotation is: true [2020-09-04 17:49:58,816 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-09-04 17:49:58,817 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (<= (+ main_~x~0 95) (* 10 main_~y~0)) (<= (+ main_~x~0 50) main_~y~0) (<= (+ main_~x~0 53) (* 3 main_~y~0)) (<= (+ main_~x~0 71) (* 7 main_~y~0)) (<= (+ main_~x~0 78) (* 8 main_~y~0)) (<= (+ main_~x~0 60) (* 5 main_~y~0))) [2020-09-04 17:49:58,817 INFO L264 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (or (let ((.cse0 (+ main_~x~0 95))) (and (<= .cse0 (* 10 main_~y~0)) (<= .cse0 (* 10 |main_#t~post1|)))) (let ((.cse1 (+ main_~x~0 50))) (and (<= .cse1 main_~y~0) (<= .cse1 |main_#t~post1|))) (let ((.cse2 (+ main_~x~0 60))) (and (<= .cse2 (* 5 |main_#t~post1|)) (<= .cse2 (* 5 main_~y~0)))) (let ((.cse3 (+ main_~x~0 53))) (and (<= .cse3 (* 3 |main_#t~post1|)) (<= .cse3 (* 3 main_~y~0)))) (let ((.cse4 (+ main_~x~0 71))) (and (<= .cse4 (* 7 |main_#t~post1|)) (<= .cse4 (* 7 main_~y~0)))) (let ((.cse5 (+ main_~x~0 78))) (and (<= .cse5 (* 8 |main_#t~post1|)) (<= .cse5 (* 8 main_~y~0))))) [2020-09-04 17:49:58,817 INFO L264 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse2 (+ main_~x~0 51)) (.cse1 (+ main_~x~0 71)) (.cse0 (+ main_~x~0 95))) (or (and (<= .cse0 (* 9 main_~y~0)) (<= (+ main_~x~0 86) (* 9 |main_#t~post1|))) (and (<= .cse1 (* 7 |main_#t~post1|)) (<= (+ main_~x~0 78) (* 7 main_~y~0))) (and (<= .cse2 main_~y~0) (<= (+ main_~x~0 50) |main_#t~post1|)) (and (<= (+ main_~x~0 53) (* 2 main_~y~0)) (<= .cse2 (* 2 |main_#t~post1|))) (and (<= (+ main_~x~0 56) (* 4 |main_#t~post1|)) (<= (+ main_~x~0 60) (* 4 main_~y~0))) (and (<= .cse1 (* 6 main_~y~0)) (<= (+ main_~x~0 65) (* 6 |main_#t~post1|))) (and (<= (+ main_~x~0 105) (* 10 main_~y~0)) (<= .cse0 (* 10 |main_#t~post1|))))) [2020-09-04 17:49:58,817 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (<= (+ main_~x~0 50) 0) [2020-09-04 17:49:58,818 INFO L264 CegarLoopResult]: At program point L18-2(lines 18 21) the Hoare annotation is: (or (<= (+ main_~x~0 51) main_~y~0) (<= (+ main_~x~0 50) 0) (<= (+ main_~x~0 56) (* 3 main_~y~0)) (<= (+ main_~x~0 105) (* 10 main_~y~0)) (<= (+ main_~x~0 60) (* 4 main_~y~0)) (<= (+ main_~x~0 86) (* 8 main_~y~0)) (<= (+ main_~x~0 71) (* 6 main_~y~0))) [2020-09-04 17:49:58,818 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (<= (+ main_~x~0 50) 0) [2020-09-04 17:49:58,818 INFO L264 CegarLoopResult]: At program point L18-3(lines 18 21) the Hoare annotation is: (and (<= 11 main_~y~0) (<= (+ main_~x~0 105) (* 10 main_~y~0))) [2020-09-04 17:49:58,818 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-09-04 17:49:58,818 INFO L264 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (<= (+ main_~x~0 50) 0) [2020-09-04 17:49:58,818 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-09-04 17:49:58,819 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: true [2020-09-04 17:49:58,819 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 17:49:58,819 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 17:49:58,819 INFO L271 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2020-09-04 17:49:58,819 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 17:49:58,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 05:49:58 BoogieIcfgContainer [2020-09-04 17:49:58,852 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 17:49:58,855 INFO L168 Benchmark]: Toolchain (without parser) took 16131.94 ms. Allocated memory was 138.9 MB in the beginning and 326.1 MB in the end (delta: 187.2 MB). Free memory was 103.6 MB in the beginning and 120.8 MB in the end (delta: -17.2 MB). Peak memory consumption was 170.0 MB. Max. memory is 7.1 GB. [2020-09-04 17:49:58,856 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 17:49:58,857 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.12 ms. Allocated memory is still 138.9 MB. Free memory was 103.4 MB in the beginning and 94.2 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-09-04 17:49:58,858 INFO L168 Benchmark]: Boogie Preprocessor took 135.73 ms. Allocated memory was 138.9 MB in the beginning and 199.8 MB in the end (delta: 60.8 MB). Free memory was 94.2 MB in the beginning and 178.9 MB in the end (delta: -84.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-09-04 17:49:58,858 INFO L168 Benchmark]: RCFGBuilder took 496.08 ms. Allocated memory is still 199.8 MB. Free memory was 178.3 MB in the beginning and 165.5 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2020-09-04 17:49:58,859 INFO L168 Benchmark]: TraceAbstraction took 15137.43 ms. Allocated memory was 199.8 MB in the beginning and 326.1 MB in the end (delta: 126.4 MB). Free memory was 164.8 MB in the beginning and 120.8 MB in the end (delta: 44.1 MB). Peak memory consumption was 170.4 MB. Max. memory is 7.1 GB. [2020-09-04 17:49:58,863 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.49 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 352.12 ms. Allocated memory is still 138.9 MB. Free memory was 103.4 MB in the beginning and 94.2 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.73 ms. Allocated memory was 138.9 MB in the beginning and 199.8 MB in the end (delta: 60.8 MB). Free memory was 94.2 MB in the beginning and 178.9 MB in the end (delta: -84.7 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 496.08 ms. Allocated memory is still 199.8 MB. Free memory was 178.3 MB in the beginning and 165.5 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15137.43 ms. Allocated memory was 199.8 MB in the beginning and 326.1 MB in the end (delta: 126.4 MB). Free memory was 164.8 MB in the beginning and 120.8 MB in the end (delta: 44.1 MB). Peak memory consumption was 170.4 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: 18]: Loop Invariant Derived loop invariant: (((((x + 51 <= y || x + 50 <= 0) || x + 56 <= 3 * y) || x + 105 <= 10 * y) || x + 60 <= 4 * y) || x + 86 <= 8 * y) || x + 71 <= 6 * y - 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: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 14.2s, OverallIterations: 12, TraceHistogramMax: 10, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 242 SDtfs, 202 SDslu, 2195 SDs, 0 SdLazy, 5535 SolverSat, 136 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 399 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 351 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2709 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 10 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 95 PreInvPairs, 179 NumberOfFragments, 399 HoareAnnotationTreeSize, 95 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 29 FomulaSimplificationsInter, 316 FormulaSimplificationTreeSizeReductionInter, 0.5s 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...