/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-zilu/benchmark25_linear.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-03 00:35:04,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-03 00:35:04,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-03 00:35:04,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-03 00:35:04,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-03 00:35:04,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-03 00:35:04,763 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-03 00:35:04,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-03 00:35:04,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-03 00:35:04,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-03 00:35:04,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-03 00:35:04,772 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-03 00:35:04,772 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-03 00:35:04,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-03 00:35:04,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-03 00:35:04,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-03 00:35:04,774 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-03 00:35:04,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-03 00:35:04,776 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-03 00:35:04,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-03 00:35:04,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-03 00:35:04,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-03 00:35:04,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-03 00:35:04,786 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-03 00:35:04,794 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-03 00:35:04,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-03 00:35:04,795 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-03 00:35:04,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-03 00:35:04,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-03 00:35:04,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-03 00:35:04,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-03 00:35:04,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-03 00:35:04,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-03 00:35:04,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-03 00:35:04,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-03 00:35:04,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-03 00:35:04,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-03 00:35:04,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-03 00:35:04,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-03 00:35:04,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-03 00:35:04,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-03 00:35:04,811 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-03 00:35:04,824 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-03 00:35:04,825 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-03 00:35:04,826 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-03 00:35:04,826 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-03 00:35:04,826 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-03 00:35:04,826 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-03 00:35:04,826 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-03 00:35:04,826 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-03 00:35:04,826 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-03 00:35:04,827 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-03 00:35:04,827 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-03 00:35:04,827 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-03 00:35:04,827 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-03 00:35:04,827 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-03 00:35:04,827 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-03 00:35:04,827 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-03 00:35:04,827 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-03 00:35:04,828 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-03 00:35:04,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-03 00:35:04,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-03 00:35:04,828 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-03 00:35:04,828 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-03 00:35:04,828 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-03 00:35:04,847 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-03 00:35:05,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-03 00:35:05,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-03 00:35:05,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-03 00:35:05,130 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-03 00:35:05,130 INFO L275 PluginConnector]: CDTParser initialized [2021-05-03 00:35:05,131 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark25_linear.i [2021-05-03 00:35:05,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6447418f0/a952a976022041d8a7c1e90052ac058c/FLAGa31cbe40b [2021-05-03 00:35:05,639 INFO L306 CDTParser]: Found 1 translation units. [2021-05-03 00:35:05,640 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark25_linear.i [2021-05-03 00:35:05,645 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6447418f0/a952a976022041d8a7c1e90052ac058c/FLAGa31cbe40b [2021-05-03 00:35:05,674 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6447418f0/a952a976022041d8a7c1e90052ac058c [2021-05-03 00:35:05,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-03 00:35:05,685 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-03 00:35:05,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-03 00:35:05,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-03 00:35:05,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-03 00:35:05,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:35:05" (1/1) ... [2021-05-03 00:35:05,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7825d4af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:35:05, skipping insertion in model container [2021-05-03 00:35:05,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:35:05" (1/1) ... [2021-05-03 00:35:05,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-03 00:35:05,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-03 00:35:05,846 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark25_linear.i[868,881] [2021-05-03 00:35:05,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:35:05,862 INFO L203 MainTranslator]: Completed pre-run [2021-05-03 00:35:05,879 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark25_linear.i[868,881] [2021-05-03 00:35:05,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:35:05,923 INFO L208 MainTranslator]: Completed translation [2021-05-03 00:35:05,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:35:05 WrapperNode [2021-05-03 00:35:05,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-03 00:35:05,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-03 00:35:05,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-03 00:35:05,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-03 00:35:05,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:35:05" (1/1) ... [2021-05-03 00:35:05,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:35:05" (1/1) ... [2021-05-03 00:35:05,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:35:05" (1/1) ... [2021-05-03 00:35:05,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:35:05" (1/1) ... [2021-05-03 00:35:05,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:35:05" (1/1) ... [2021-05-03 00:35:05,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:35:05" (1/1) ... [2021-05-03 00:35:05,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:35:05" (1/1) ... [2021-05-03 00:35:05,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-03 00:35:05,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-03 00:35:05,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-03 00:35:05,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-03 00:35:05,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:35:05" (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 [2021-05-03 00:35:06,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-03 00:35:06,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-03 00:35:06,047 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-03 00:35:06,047 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-03 00:35:06,047 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-03 00:35:06,047 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-03 00:35:06,047 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-03 00:35:06,048 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-03 00:35:06,048 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-03 00:35:06,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-03 00:35:06,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-03 00:35:06,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2021-05-03 00:35:06,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-03 00:35:06,049 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-03 00:35:06,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-03 00:35:06,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-03 00:35:06,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-03 00:35:06,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-03 00:35:06,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-03 00:35:06,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-03 00:35:06,280 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-03 00:35:06,280 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-03 00:35:06,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:35:06 BoogieIcfgContainer [2021-05-03 00:35:06,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-03 00:35:06,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-03 00:35:06,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-03 00:35:06,285 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-03 00:35:06,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 12:35:05" (1/3) ... [2021-05-03 00:35:06,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747f4ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:35:06, skipping insertion in model container [2021-05-03 00:35:06,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:35:05" (2/3) ... [2021-05-03 00:35:06,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747f4ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:35:06, skipping insertion in model container [2021-05-03 00:35:06,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:35:06" (3/3) ... [2021-05-03 00:35:06,287 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark25_linear.i [2021-05-03 00:35:06,311 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-03 00:35:06,314 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-03 00:35:06,333 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-03 00:35:06,351 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-03 00:35:06,351 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-03 00:35:06,351 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-03 00:35:06,351 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-03 00:35:06,351 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-03 00:35:06,351 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-03 00:35:06,351 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-03 00:35:06,351 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-03 00:35:06,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-03 00:35:06,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-03 00:35:06,369 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:35:06,370 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:35:06,370 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:35:06,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:35:06,374 INFO L82 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 1 times [2021-05-03 00:35:06,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:35:06,380 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [791741196] [2021-05-03 00:35:06,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:35:06,424 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:35:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:06,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:35:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:35:06,639 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:35:06,639 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [791741196] [2021-05-03 00:35:06,641 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [791741196] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:35:06,641 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:35:06,641 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-03 00:35:06,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449960747] [2021-05-03 00:35:06,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-03 00:35:06,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:35:06,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-03 00:35:06,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-03 00:35:06,659 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:35:06,782 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2021-05-03 00:35:06,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-03 00:35:06,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-05-03 00:35:06,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:35:06,787 INFO L225 Difference]: With dead ends: 33 [2021-05-03 00:35:06,788 INFO L226 Difference]: Without dead ends: 14 [2021-05-03 00:35:06,791 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 84.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-03 00:35:06,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-05-03 00:35:06,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-05-03 00:35:06,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:06,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2021-05-03 00:35:06,838 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2021-05-03 00:35:06,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:35:06,839 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2021-05-03 00:35:06,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:06,839 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2021-05-03 00:35:06,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-03 00:35:06,839 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:35:06,839 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:35:06,839 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-03 00:35:06,840 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:35:06,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:35:06,840 INFO L82 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 1 times [2021-05-03 00:35:06,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:35:06,841 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [982164089] [2021-05-03 00:35:06,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:35:06,910 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_10 10) InVars {main_~x~0=v_main_~x~0_10} OutVars{main_~x~0=v_main_~x~0_10} AuxVars[] AssignedVars[] [2021-05-03 00:35:06,933 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:35:06,941 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:35:06,968 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:35:07,012 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:35:07,053 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:35:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:07,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:35:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:35:07,219 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:35:07,261 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:35:07,262 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [982164089] [2021-05-03 00:35:07,262 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [982164089] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:35:07,262 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:35:07,262 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-03 00:35:07,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574483804] [2021-05-03 00:35:07,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-03 00:35:07,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:35:07,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-03 00:35:07,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-05-03 00:35:07,266 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:35:07,374 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2021-05-03 00:35:07,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-03 00:35:07,375 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-05-03 00:35:07,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:35:07,376 INFO L225 Difference]: With dead ends: 20 [2021-05-03 00:35:07,376 INFO L226 Difference]: Without dead ends: 15 [2021-05-03 00:35:07,377 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 138.3ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-05-03 00:35:07,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-05-03 00:35:07,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-05-03 00:35:07,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:07,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2021-05-03 00:35:07,381 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2021-05-03 00:35:07,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:35:07,381 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2021-05-03 00:35:07,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2021-05-03 00:35:07,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-03 00:35:07,381 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:35:07,382 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:35:07,382 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-03 00:35:07,382 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:35:07,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:35:07,382 INFO L82 PathProgramCache]: Analyzing trace with hash 106583640, now seen corresponding path program 2 times [2021-05-03 00:35:07,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:35:07,383 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1881738060] [2021-05-03 00:35:07,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:35:07,387 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_14 10) InVars {main_~x~0=v_main_~x~0_14} OutVars{main_~x~0=v_main_~x~0_14} AuxVars[] AssignedVars[] [2021-05-03 00:35:07,390 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:35:07,423 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:35:07,429 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:35:07,437 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:35:07,447 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:35:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:07,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:35:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:35:07,561 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:35:07,606 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:35:07,607 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1881738060] [2021-05-03 00:35:07,607 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1881738060] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:35:07,607 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:35:07,607 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-03 00:35:07,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279652755] [2021-05-03 00:35:07,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-03 00:35:07,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:35:07,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-03 00:35:07,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-05-03 00:35:07,608 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:07,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:35:07,768 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2021-05-03 00:35:07,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-03 00:35:07,769 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-03 00:35:07,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:35:07,770 INFO L225 Difference]: With dead ends: 21 [2021-05-03 00:35:07,770 INFO L226 Difference]: Without dead ends: 16 [2021-05-03 00:35:07,771 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 162.9ms TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-05-03 00:35:07,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-05-03 00:35:07,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-05-03 00:35:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2021-05-03 00:35:07,779 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2021-05-03 00:35:07,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:35:07,779 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2021-05-03 00:35:07,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2021-05-03 00:35:07,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-03 00:35:07,780 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:35:07,780 INFO L523 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:35:07,780 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-03 00:35:07,780 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:35:07,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:35:07,781 INFO L82 PathProgramCache]: Analyzing trace with hash -955485626, now seen corresponding path program 3 times [2021-05-03 00:35:07,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:35:07,781 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [497709549] [2021-05-03 00:35:07,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:35:07,790 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_19 10) InVars {main_~x~0=v_main_~x~0_19} OutVars{main_~x~0=v_main_~x~0_19} AuxVars[] AssignedVars[] [2021-05-03 00:35:07,798 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:35:07,811 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:35:07,818 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:35:07,830 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:35:07,841 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:35:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:07,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:35:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:35:07,946 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:35:08,013 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:35:08,014 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [497709549] [2021-05-03 00:35:08,014 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [497709549] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:35:08,014 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:35:08,014 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-03 00:35:08,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322550744] [2021-05-03 00:35:08,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-03 00:35:08,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:35:08,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-03 00:35:08,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-05-03 00:35:08,015 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:35:08,168 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2021-05-03 00:35:08,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-03 00:35:08,168 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-05-03 00:35:08,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:35:08,170 INFO L225 Difference]: With dead ends: 22 [2021-05-03 00:35:08,170 INFO L226 Difference]: Without dead ends: 17 [2021-05-03 00:35:08,171 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 170.5ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-05-03 00:35:08,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-05-03 00:35:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-05-03 00:35:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2021-05-03 00:35:08,179 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2021-05-03 00:35:08,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:35:08,179 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2021-05-03 00:35:08,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:08,180 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2021-05-03 00:35:08,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-03 00:35:08,180 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:35:08,180 INFO L523 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:35:08,180 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-03 00:35:08,181 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:35:08,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:35:08,181 INFO L82 PathProgramCache]: Analyzing trace with hash 480105496, now seen corresponding path program 4 times [2021-05-03 00:35:08,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:35:08,181 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1291623438] [2021-05-03 00:35:08,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:35:08,194 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_25 10) InVars {main_~x~0=v_main_~x~0_25} OutVars{main_~x~0=v_main_~x~0_25} AuxVars[] AssignedVars[] [2021-05-03 00:35:08,203 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:35:08,206 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:35:08,219 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:35:08,235 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:35:08,249 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:35:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:08,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:35:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:08,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:35:08,338 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:35:08,403 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:35:08,404 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1291623438] [2021-05-03 00:35:08,404 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1291623438] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:35:08,404 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:35:08,404 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-03 00:35:08,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631672104] [2021-05-03 00:35:08,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-03 00:35:08,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:35:08,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-03 00:35:08,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-05-03 00:35:08,405 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:35:08,597 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2021-05-03 00:35:08,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-03 00:35:08,598 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-05-03 00:35:08,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:35:08,598 INFO L225 Difference]: With dead ends: 23 [2021-05-03 00:35:08,598 INFO L226 Difference]: Without dead ends: 18 [2021-05-03 00:35:08,599 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 202.9ms TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:35:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-05-03 00:35:08,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-05-03 00:35:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:08,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2021-05-03 00:35:08,602 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2021-05-03 00:35:08,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:35:08,602 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2021-05-03 00:35:08,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2021-05-03 00:35:08,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-03 00:35:08,603 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:35:08,603 INFO L523 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:35:08,603 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-03 00:35:08,603 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:35:08,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:35:08,604 INFO L82 PathProgramCache]: Analyzing trace with hash 2033757318, now seen corresponding path program 5 times [2021-05-03 00:35:08,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:35:08,604 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [109157297] [2021-05-03 00:35:08,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:35:08,608 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_32 10) InVars {main_~x~0=v_main_~x~0_32} OutVars{main_~x~0=v_main_~x~0_32} AuxVars[] AssignedVars[] [2021-05-03 00:35:08,610 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:35:08,617 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:35:08,623 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:35:08,631 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:35:08,639 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:35:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:08,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:35:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:35:08,720 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:35:08,816 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:35:08,817 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [109157297] [2021-05-03 00:35:08,817 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [109157297] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:35:08,817 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:35:08,817 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-03 00:35:08,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475314722] [2021-05-03 00:35:08,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-03 00:35:08,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:35:08,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-03 00:35:08,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-05-03 00:35:08,818 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:09,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:35:09,025 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2021-05-03 00:35:09,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-03 00:35:09,026 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-03 00:35:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:35:09,028 INFO L225 Difference]: With dead ends: 24 [2021-05-03 00:35:09,028 INFO L226 Difference]: Without dead ends: 19 [2021-05-03 00:35:09,029 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 211.7ms TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:35:09,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-05-03 00:35:09,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-05-03 00:35:09,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:09,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2021-05-03 00:35:09,033 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2021-05-03 00:35:09,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:35:09,033 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2021-05-03 00:35:09,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:09,034 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2021-05-03 00:35:09,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-03 00:35:09,034 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:35:09,034 INFO L523 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:35:09,034 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-03 00:35:09,034 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:35:09,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:35:09,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1342643752, now seen corresponding path program 6 times [2021-05-03 00:35:09,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:35:09,035 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [663096145] [2021-05-03 00:35:09,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:35:09,039 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_40 10) InVars {main_~x~0=v_main_~x~0_40} OutVars{main_~x~0=v_main_~x~0_40} AuxVars[] AssignedVars[] [2021-05-03 00:35:09,043 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:35:09,052 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:35:09,057 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:35:09,063 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:35:09,078 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:35:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:09,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:35:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:35:09,154 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:35:09,247 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:35:09,247 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [663096145] [2021-05-03 00:35:09,247 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [663096145] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:35:09,247 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:35:09,247 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-03 00:35:09,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400569972] [2021-05-03 00:35:09,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-03 00:35:09,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:35:09,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-03 00:35:09,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:35:09,250 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:35:09,484 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2021-05-03 00:35:09,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-03 00:35:09,485 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-05-03 00:35:09,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:35:09,485 INFO L225 Difference]: With dead ends: 25 [2021-05-03 00:35:09,485 INFO L226 Difference]: Without dead ends: 20 [2021-05-03 00:35:09,486 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 245.9ms TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:35:09,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-05-03 00:35:09,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-05-03 00:35:09,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2021-05-03 00:35:09,490 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2021-05-03 00:35:09,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:35:09,490 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2021-05-03 00:35:09,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:09,490 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2021-05-03 00:35:09,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-03 00:35:09,490 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:35:09,491 INFO L523 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:35:09,491 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-03 00:35:09,491 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:35:09,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:35:09,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1363105478, now seen corresponding path program 7 times [2021-05-03 00:35:09,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:35:09,491 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1900692488] [2021-05-03 00:35:09,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:35:09,495 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_49 10) InVars {main_~x~0=v_main_~x~0_49} OutVars{main_~x~0=v_main_~x~0_49} AuxVars[] AssignedVars[] [2021-05-03 00:35:09,498 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:35:09,499 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:35:09,503 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:35:09,515 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:35:09,523 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:35:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:09,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:35:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:09,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:35:09,572 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:35:09,676 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:35:09,676 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1900692488] [2021-05-03 00:35:09,676 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1900692488] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:35:09,676 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:35:09,677 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-03 00:35:09,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954629510] [2021-05-03 00:35:09,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-03 00:35:09,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:35:09,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-03 00:35:09,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2021-05-03 00:35:09,678 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:09,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:35:09,963 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2021-05-03 00:35:09,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-03 00:35:09,964 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-05-03 00:35:09,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:35:09,965 INFO L225 Difference]: With dead ends: 26 [2021-05-03 00:35:09,965 INFO L226 Difference]: Without dead ends: 21 [2021-05-03 00:35:09,966 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 309.0ms TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:35:09,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-05-03 00:35:09,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-05-03 00:35:09,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:09,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2021-05-03 00:35:09,970 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2021-05-03 00:35:09,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:35:09,970 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2021-05-03 00:35:09,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:09,970 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2021-05-03 00:35:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-03 00:35:09,971 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:35:09,971 INFO L523 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:35:09,971 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-03 00:35:09,971 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:35:09,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:35:09,971 INFO L82 PathProgramCache]: Analyzing trace with hash -658014312, now seen corresponding path program 8 times [2021-05-03 00:35:09,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:35:09,972 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [514504473] [2021-05-03 00:35:09,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:35:09,977 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_59 10) InVars {main_~x~0=v_main_~x~0_59} OutVars{main_~x~0=v_main_~x~0_59} AuxVars[] AssignedVars[] [2021-05-03 00:35:09,980 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:35:09,985 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:35:09,990 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:35:09,996 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:35:10,005 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:35:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:10,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:35:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:10,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:35:10,086 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:35:10,206 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:35:10,207 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [514504473] [2021-05-03 00:35:10,207 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [514504473] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:35:10,207 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:35:10,207 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-03 00:35:10,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418155243] [2021-05-03 00:35:10,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-03 00:35:10,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:35:10,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-03 00:35:10,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:35:10,208 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:10,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:35:10,442 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2021-05-03 00:35:10,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-03 00:35:10,443 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-05-03 00:35:10,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:35:10,444 INFO L225 Difference]: With dead ends: 27 [2021-05-03 00:35:10,445 INFO L226 Difference]: Without dead ends: 22 [2021-05-03 00:35:10,445 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 324.8ms TimeCoverageRelationStatistics Valid=198, Invalid=452, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:35:10,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-05-03 00:35:10,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-05-03 00:35:10,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2021-05-03 00:35:10,449 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2021-05-03 00:35:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:35:10,449 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2021-05-03 00:35:10,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:10,449 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2021-05-03 00:35:10,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-03 00:35:10,449 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:35:10,449 INFO L523 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:35:10,449 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-03 00:35:10,450 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:35:10,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:35:10,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1111781638, now seen corresponding path program 9 times [2021-05-03 00:35:10,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:35:10,450 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1724552172] [2021-05-03 00:35:10,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:35:10,455 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_70 10) InVars {main_~x~0=v_main_~x~0_70} OutVars{main_~x~0=v_main_~x~0_70} AuxVars[] AssignedVars[] [2021-05-03 00:35:10,456 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:35:10,457 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:35:10,461 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:35:10,471 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:35:10,479 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:35:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:10,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:35:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:35:10,525 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:35:10,648 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:35:10,648 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1724552172] [2021-05-03 00:35:10,648 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1724552172] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:35:10,648 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:35:10,649 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-03 00:35:10,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261497940] [2021-05-03 00:35:10,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-03 00:35:10,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:35:10,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-03 00:35:10,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:35:10,651 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:35:10,946 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2021-05-03 00:35:10,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-03 00:35:10,946 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-05-03 00:35:10,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:35:10,948 INFO L225 Difference]: With dead ends: 28 [2021-05-03 00:35:10,948 INFO L226 Difference]: Without dead ends: 23 [2021-05-03 00:35:10,949 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 325.9ms TimeCoverageRelationStatistics Valid=233, Invalid=523, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:35:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-05-03 00:35:10,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-05-03 00:35:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2021-05-03 00:35:10,956 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2021-05-03 00:35:10,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:35:10,957 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2021-05-03 00:35:10,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2021-05-03 00:35:10,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-03 00:35:10,960 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:35:10,960 INFO L523 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:35:10,962 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-03 00:35:10,962 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:35:10,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:35:10,963 INFO L82 PathProgramCache]: Analyzing trace with hash 140881240, now seen corresponding path program 10 times [2021-05-03 00:35:10,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:35:10,963 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [559632108] [2021-05-03 00:35:10,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:35:10,968 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_82 10) InVars {main_~x~0=v_main_~x~0_82} OutVars{main_~x~0=v_main_~x~0_82} AuxVars[] AssignedVars[] [2021-05-03 00:35:10,970 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:35:10,976 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:35:10,981 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:35:10,988 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:35:10,997 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:35:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:11,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:35:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:35:11,061 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:35:11,224 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:35:11,224 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [559632108] [2021-05-03 00:35:11,224 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [559632108] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:35:11,224 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:35:11,224 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-03 00:35:11,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774969933] [2021-05-03 00:35:11,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-03 00:35:11,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:35:11,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-03 00:35:11,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:35:11,225 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:11,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:35:11,572 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2021-05-03 00:35:11,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-03 00:35:11,573 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-05-03 00:35:11,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:35:11,573 INFO L225 Difference]: With dead ends: 29 [2021-05-03 00:35:11,573 INFO L226 Difference]: Without dead ends: 24 [2021-05-03 00:35:11,574 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 413.7ms TimeCoverageRelationStatistics Valid=271, Invalid=599, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:35:11,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-05-03 00:35:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-05-03 00:35:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2021-05-03 00:35:11,577 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2021-05-03 00:35:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:35:11,578 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2021-05-03 00:35:11,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2021-05-03 00:35:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-03 00:35:11,578 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:35:11,578 INFO L523 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:35:11,578 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-03 00:35:11,578 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:35:11,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:35:11,579 INFO L82 PathProgramCache]: Analyzing trace with hash 107739974, now seen corresponding path program 11 times [2021-05-03 00:35:11,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:35:11,579 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1605533259] [2021-05-03 00:35:11,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:35:11,584 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_95 10) InVars {main_~x~0=v_main_~x~0_95} OutVars{main_~x~0=v_main_~x~0_95} AuxVars[] AssignedVars[] [2021-05-03 00:35:11,587 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:35:11,588 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:35:11,592 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:35:11,602 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:35:11,610 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:35:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:11,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:35:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:35:11,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:35:11,657 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:35:11,831 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:35:11,832 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1605533259] [2021-05-03 00:35:11,832 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1605533259] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:35:11,832 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:35:11,832 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-03 00:35:11,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681815213] [2021-05-03 00:35:11,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-03 00:35:11,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:35:11,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-03 00:35:11,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:35:11,833 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:12,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:35:12,211 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2021-05-03 00:35:12,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-03 00:35:12,211 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-05-03 00:35:12,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:35:12,212 INFO L225 Difference]: With dead ends: 24 [2021-05-03 00:35:12,212 INFO L226 Difference]: Without dead ends: 0 [2021-05-03 00:35:12,212 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 493.8ms TimeCoverageRelationStatistics Valid=303, Invalid=819, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:35:12,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-03 00:35:12,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-03 00:35:12,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-03 00:35:12,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-03 00:35:12,213 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2021-05-03 00:35:12,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:35:12,213 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-03 00:35:12,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:35:12,213 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-03 00:35:12,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-03 00:35:12,213 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-03 00:35:12,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-03 00:35:12,426 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2021-05-03 00:35:12,426 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2021-05-03 00:35:12,426 INFO L198 CegarLoopUtils]: For program point L11-1(line 11) no Hoare annotation was computed. [2021-05-03 00:35:12,426 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-03 00:35:12,426 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= |#t~string1.offset| |old(#t~string1.offset)|)) [2021-05-03 00:35:12,427 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-03 00:35:12,427 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-03 00:35:12,427 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-03 00:35:12,427 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-03 00:35:12,427 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-03 00:35:12,427 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 19 27) the Hoare annotation is: true [2021-05-03 00:35:12,427 INFO L201 CegarLoopUtils]: At program point L25(line 25) the Hoare annotation is: true [2021-05-03 00:35:12,427 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 19 27) the Hoare annotation is: true [2021-05-03 00:35:12,427 INFO L201 CegarLoopUtils]: At program point L21(line 21) the Hoare annotation is: true [2021-05-03 00:35:12,427 INFO L194 CegarLoopUtils]: At program point L22-2(lines 22 24) the Hoare annotation is: (<= main_~x~0 10) [2021-05-03 00:35:12,427 INFO L194 CegarLoopUtils]: At program point L22-3(lines 22 24) the Hoare annotation is: (= main_~x~0 10) [2021-05-03 00:35:12,427 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 19 27) the Hoare annotation is: true [2021-05-03 00:35:12,427 INFO L194 CegarLoopUtils]: At program point L16(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-03 00:35:12,427 INFO L194 CegarLoopUtils]: At program point L15(lines 15 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-03 00:35:12,427 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2021-05-03 00:35:12,427 INFO L201 CegarLoopUtils]: At program point L15-2(lines 14 18) the Hoare annotation is: true [2021-05-03 00:35:12,427 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 14 18) the Hoare annotation is: true [2021-05-03 00:35:12,428 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-03 00:35:12,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.05 12:35:12 BoogieIcfgContainer [2021-05-03 00:35:12,437 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-03 00:35:12,438 INFO L168 Benchmark]: Toolchain (without parser) took 6753.60 ms. Allocated memory was 170.9 MB in the beginning and 286.3 MB in the end (delta: 115.3 MB). Free memory was 135.9 MB in the beginning and 257.3 MB in the end (delta: -121.5 MB). Peak memory consumption was 149.3 MB. Max. memory is 8.0 GB. [2021-05-03 00:35:12,438 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 170.9 MB. Free memory is still 153.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-03 00:35:12,438 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.76 ms. Allocated memory is still 170.9 MB. Free memory was 135.7 MB in the beginning and 154.6 MB in the end (delta: -18.9 MB). Peak memory consumption was 11.8 MB. Max. memory is 8.0 GB. [2021-05-03 00:35:12,438 INFO L168 Benchmark]: Boogie Preprocessor took 31.70 ms. Allocated memory is still 170.9 MB. Free memory was 154.6 MB in the beginning and 153.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-05-03 00:35:12,438 INFO L168 Benchmark]: RCFGBuilder took 322.87 ms. Allocated memory is still 170.9 MB. Free memory was 153.2 MB in the beginning and 139.9 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-05-03 00:35:12,438 INFO L168 Benchmark]: TraceAbstraction took 6155.04 ms. Allocated memory was 170.9 MB in the beginning and 286.3 MB in the end (delta: 115.3 MB). Free memory was 139.6 MB in the beginning and 257.3 MB in the end (delta: -117.8 MB). Peak memory consumption was 153.2 MB. Max. memory is 8.0 GB. [2021-05-03 00:35:12,439 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 170.9 MB. Free memory is still 153.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 235.76 ms. Allocated memory is still 170.9 MB. Free memory was 135.7 MB in the beginning and 154.6 MB in the end (delta: -18.9 MB). Peak memory consumption was 11.8 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 31.70 ms. Allocated memory is still 170.9 MB. Free memory was 154.6 MB in the beginning and 153.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 322.87 ms. Allocated memory is still 170.9 MB. Free memory was 153.2 MB in the beginning and 139.9 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 6155.04 ms. Allocated memory was 170.9 MB in the beginning and 286.3 MB in the end (delta: 115.3 MB). Free memory was 139.6 MB in the beginning and 257.3 MB in the end (delta: -117.8 MB). Peak memory consumption was 153.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5865.0ms, OverallIterations: 12, TraceHistogramMax: 11, EmptinessCheckTime: 15.6ms, AutomataDifference: 2771.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 211.7ms, InitialAbstractionConstructionTime: 7.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 135 SDtfs, 88 SDslu, 481 SDs, 0 SdLazy, 755 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 583.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 273 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 3084.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=11, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 85.2ms AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 20 LocationsWithAnnotation, 86 PreInvPairs, 125 NumberOfFragments, 59 HoareAnnotationTreeSize, 86 FomulaSimplifications, 255 FormulaSimplificationTreeSizeReduction, 101.2ms HoareSimplificationTime, 20 FomulaSimplificationsInter, 568 FormulaSimplificationTreeSizeReductionInter, 99.1ms 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: x <= 10 - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! Received shutdown request...