/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-invgen/heapsort.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 23:31:04,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 23:31:04,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 23:31:04,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 23:31:04,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 23:31:04,964 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 23:31:04,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 23:31:04,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 23:31:04,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 23:31:04,982 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 23:31:04,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 23:31:04,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 23:31:04,984 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 23:31:04,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 23:31:04,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 23:31:04,989 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 23:31:04,991 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 23:31:04,992 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 23:31:04,994 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 23:31:05,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 23:31:05,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 23:31:05,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 23:31:05,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 23:31:05,006 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 23:31:05,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 23:31:05,012 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 23:31:05,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 23:31:05,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 23:31:05,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 23:31:05,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 23:31:05,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 23:31:05,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 23:31:05,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 23:31:05,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 23:31:05,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 23:31:05,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 23:31:05,022 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 23:31:05,022 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 23:31:05,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 23:31:05,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 23:31:05,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 23:31:05,039 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-02 23:31:05,056 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 23:31:05,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 23:31:05,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 23:31:05,059 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 23:31:05,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 23:31:05,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 23:31:05,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 23:31:05,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 23:31:05,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 23:31:05,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 23:31:05,061 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 23:31:05,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 23:31:05,062 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 23:31:05,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 23:31:05,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 23:31:05,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 23:31:05,062 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 23:31:05,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 23:31:05,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:31:05,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 23:31:05,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-02 23:31:05,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 23:31:05,063 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-02 23:31:05,064 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-02 23:31:05,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 23:31:05,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 23:31:05,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 23:31:05,405 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 23:31:05,405 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 23:31:05,406 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort.i [2021-05-02 23:31:05,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6390f980/29c82593ba9b4042b72655dbb811a46c/FLAG8adb3a8c4 [2021-05-02 23:31:05,839 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 23:31:05,840 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i [2021-05-02 23:31:05,847 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6390f980/29c82593ba9b4042b72655dbb811a46c/FLAG8adb3a8c4 [2021-05-02 23:31:05,868 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6390f980/29c82593ba9b4042b72655dbb811a46c [2021-05-02 23:31:05,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 23:31:05,873 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 23:31:05,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 23:31:05,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 23:31:05,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 23:31:05,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:31:05" (1/1) ... [2021-05-02 23:31:05,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@229a5b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:05, skipping insertion in model container [2021-05-02 23:31:05,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:31:05" (1/1) ... [2021-05-02 23:31:05,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 23:31:05,907 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 23:31:06,025 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-invgen/heapsort.i[893,906] [2021-05-02 23:31:06,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:31:06,048 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 23:31:06,102 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-invgen/heapsort.i[893,906] [2021-05-02 23:31:06,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:31:06,128 INFO L208 MainTranslator]: Completed translation [2021-05-02 23:31:06,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:06 WrapperNode [2021-05-02 23:31:06,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 23:31:06,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 23:31:06,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 23:31:06,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 23:31:06,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:06" (1/1) ... [2021-05-02 23:31:06,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:06" (1/1) ... [2021-05-02 23:31:06,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:06" (1/1) ... [2021-05-02 23:31:06,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:06" (1/1) ... [2021-05-02 23:31:06,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:06" (1/1) ... [2021-05-02 23:31:06,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:06" (1/1) ... [2021-05-02 23:31:06,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:06" (1/1) ... [2021-05-02 23:31:06,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 23:31:06,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 23:31:06,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 23:31:06,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 23:31:06,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:06" (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-02 23:31:06,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 23:31:06,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 23:31:06,256 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 23:31:06,257 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 23:31:06,257 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 23:31:06,257 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 23:31:06,257 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 23:31:06,258 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 23:31:06,258 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-02 23:31:06,258 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-02 23:31:06,259 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 23:31:06,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 23:31:06,259 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 23:31:06,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 23:31:06,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 23:31:06,260 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 23:31:06,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 23:31:06,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 23:31:06,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 23:31:06,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 23:31:06,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 23:31:06,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 23:31:06,643 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 23:31:06,644 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-02 23:31:06,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:31:06 BoogieIcfgContainer [2021-05-02 23:31:06,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 23:31:06,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 23:31:06,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 23:31:06,649 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 23:31:06,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:31:05" (1/3) ... [2021-05-02 23:31:06,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@145a2087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:31:06, skipping insertion in model container [2021-05-02 23:31:06,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:31:06" (2/3) ... [2021-05-02 23:31:06,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@145a2087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:31:06, skipping insertion in model container [2021-05-02 23:31:06,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:31:06" (3/3) ... [2021-05-02 23:31:06,655 INFO L111 eAbstractionObserver]: Analyzing ICFG heapsort.i [2021-05-02 23:31:06,664 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-02 23:31:06,668 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 23:31:06,685 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 23:31:06,713 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 23:31:06,713 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 23:31:06,713 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-02 23:31:06,713 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 23:31:06,713 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 23:31:06,713 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 23:31:06,714 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 23:31:06,714 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 23:31:06,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-05-02 23:31:06,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 23:31:06,734 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:06,734 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:06,735 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:06,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:06,740 INFO L82 PathProgramCache]: Analyzing trace with hash -250128701, now seen corresponding path program 1 times [2021-05-02 23:31:06,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:06,750 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [414594695] [2021-05-02 23:31:06,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:06,809 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:07,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:07,021 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-02 23:31:07,022 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:07,023 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [414594695] [2021-05-02 23:31:07,024 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [414594695] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:07,024 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:07,025 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:31:07,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855815938] [2021-05-02 23:31:07,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:31:07,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:07,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:31:07,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:31:07,040 INFO L87 Difference]: Start difference. First operand has 44 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 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-02 23:31:07,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:07,649 INFO L93 Difference]: Finished difference Result 88 states and 148 transitions. [2021-05-02 23:31:07,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:31:07,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 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-02 23:31:07,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:07,660 INFO L225 Difference]: With dead ends: 88 [2021-05-02 23:31:07,661 INFO L226 Difference]: Without dead ends: 44 [2021-05-02 23:31:07,667 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 187.7ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:31:07,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-05-02 23:31:07,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2021-05-02 23:31:07,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-05-02 23:31:07,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2021-05-02 23:31:07,740 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 15 [2021-05-02 23:31:07,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:07,741 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2021-05-02 23:31:07,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 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-02 23:31:07,741 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2021-05-02 23:31:07,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 23:31:07,743 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:07,744 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:07,744 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 23:31:07,744 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:07,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:07,746 INFO L82 PathProgramCache]: Analyzing trace with hash -254865470, now seen corresponding path program 1 times [2021-05-02 23:31:07,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:07,746 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [371101630] [2021-05-02 23:31:07,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:07,753 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:07,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:07,885 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-02 23:31:07,885 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:07,886 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [371101630] [2021-05-02 23:31:07,886 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [371101630] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:07,886 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:07,887 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:31:07,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252080395] [2021-05-02 23:31:07,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:31:07,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:07,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:31:07,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:31:07,890 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 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-02 23:31:08,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:08,349 INFO L93 Difference]: Finished difference Result 71 states and 105 transitions. [2021-05-02 23:31:08,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:31:08,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 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-02 23:31:08,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:08,352 INFO L225 Difference]: With dead ends: 71 [2021-05-02 23:31:08,352 INFO L226 Difference]: Without dead ends: 69 [2021-05-02 23:31:08,353 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 138.6ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:31:08,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-05-02 23:31:08,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2021-05-02 23:31:08,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-05-02 23:31:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2021-05-02 23:31:08,368 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 15 [2021-05-02 23:31:08,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:08,368 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2021-05-02 23:31:08,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 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-02 23:31:08,369 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2021-05-02 23:31:08,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 23:31:08,369 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:08,369 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:08,370 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 23:31:08,370 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:08,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:08,370 INFO L82 PathProgramCache]: Analyzing trace with hash -216435080, now seen corresponding path program 1 times [2021-05-02 23:31:08,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:08,371 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1893095176] [2021-05-02 23:31:08,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:08,373 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:08,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:08,460 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-02 23:31:08,460 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:08,460 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1893095176] [2021-05-02 23:31:08,460 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1893095176] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:08,461 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:08,461 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:31:08,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26261205] [2021-05-02 23:31:08,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:31:08,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:08,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:31:08,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:31:08,463 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-02 23:31:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:08,994 INFO L93 Difference]: Finished difference Result 80 states and 115 transitions. [2021-05-02 23:31:08,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:31:08,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-02 23:31:08,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:09,001 INFO L225 Difference]: With dead ends: 80 [2021-05-02 23:31:09,001 INFO L226 Difference]: Without dead ends: 78 [2021-05-02 23:31:09,002 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 165.2ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:31:09,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-05-02 23:31:09,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2021-05-02 23:31:09,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2021-05-02 23:31:09,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2021-05-02 23:31:09,020 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 15 [2021-05-02 23:31:09,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:09,020 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2021-05-02 23:31:09,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-02 23:31:09,021 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2021-05-02 23:31:09,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 23:31:09,021 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:09,021 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:09,022 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 23:31:09,022 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:09,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:09,022 INFO L82 PathProgramCache]: Analyzing trace with hash -228679181, now seen corresponding path program 1 times [2021-05-02 23:31:09,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:09,023 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1519062563] [2021-05-02 23:31:09,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:09,025 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:09,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:09,092 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-02 23:31:09,092 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:09,093 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1519062563] [2021-05-02 23:31:09,093 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1519062563] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:09,093 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:09,093 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:31:09,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526934129] [2021-05-02 23:31:09,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:31:09,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:09,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:31:09,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:31:09,094 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 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-02 23:31:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:09,569 INFO L93 Difference]: Finished difference Result 122 states and 183 transitions. [2021-05-02 23:31:09,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:31:09,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 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-02 23:31:09,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:09,572 INFO L225 Difference]: With dead ends: 122 [2021-05-02 23:31:09,572 INFO L226 Difference]: Without dead ends: 120 [2021-05-02 23:31:09,573 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 155.5ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:31:09,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-05-02 23:31:09,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2021-05-02 23:31:09,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 38 states have call successors, (38), 7 states have call predecessors, (38), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2021-05-02 23:31:09,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 140 transitions. [2021-05-02 23:31:09,596 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 140 transitions. Word has length 15 [2021-05-02 23:31:09,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:09,596 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 140 transitions. [2021-05-02 23:31:09,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 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-02 23:31:09,596 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 140 transitions. [2021-05-02 23:31:09,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-02 23:31:09,597 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:09,597 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:09,597 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 23:31:09,598 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:09,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:09,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1266022048, now seen corresponding path program 1 times [2021-05-02 23:31:09,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:09,599 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [246092264] [2021-05-02 23:31:09,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:09,601 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:09,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:09,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-02 23:31:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:09,665 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-02 23:31:09,666 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:09,666 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [246092264] [2021-05-02 23:31:09,666 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [246092264] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:09,666 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:09,666 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:31:09,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028987398] [2021-05-02 23:31:09,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:31:09,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:09,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:31:09,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:31:09,668 INFO L87 Difference]: Start difference. First operand 94 states and 140 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:31:09,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:09,917 INFO L93 Difference]: Finished difference Result 100 states and 145 transitions. [2021-05-02 23:31:09,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:31:09,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2021-05-02 23:31:09,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:09,919 INFO L225 Difference]: With dead ends: 100 [2021-05-02 23:31:09,919 INFO L226 Difference]: Without dead ends: 98 [2021-05-02 23:31:09,919 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 95.3ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:31:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-05-02 23:31:09,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-05-02 23:31:09,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 38 states have call successors, (38), 8 states have call predecessors, (38), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2021-05-02 23:31:09,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2021-05-02 23:31:09,939 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 20 [2021-05-02 23:31:09,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:09,939 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2021-05-02 23:31:09,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:31:09,940 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2021-05-02 23:31:09,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-02 23:31:09,941 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:09,941 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:09,941 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 23:31:09,941 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:09,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:09,942 INFO L82 PathProgramCache]: Analyzing trace with hash 884659585, now seen corresponding path program 1 times [2021-05-02 23:31:09,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:09,942 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2001470965] [2021-05-02 23:31:09,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:09,944 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:10,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:10,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-02 23:31:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:10,032 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-02 23:31:10,032 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:10,032 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2001470965] [2021-05-02 23:31:10,032 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2001470965] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:10,033 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:10,033 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 23:31:10,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513156750] [2021-05-02 23:31:10,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 23:31:10,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:10,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 23:31:10,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:31:10,034 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:31:10,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:10,638 INFO L93 Difference]: Finished difference Result 236 states and 379 transitions. [2021-05-02 23:31:10,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:31:10,639 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2021-05-02 23:31:10,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:10,649 INFO L225 Difference]: With dead ends: 236 [2021-05-02 23:31:10,650 INFO L226 Difference]: Without dead ends: 234 [2021-05-02 23:31:10,650 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 172.3ms TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:31:10,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-05-02 23:31:10,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2021-05-02 23:31:10,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 114 states have internal predecessors, (156), 110 states have call successors, (110), 10 states have call predecessors, (110), 9 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2021-05-02 23:31:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 375 transitions. [2021-05-02 23:31:10,724 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 375 transitions. Word has length 20 [2021-05-02 23:31:10,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:10,724 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 375 transitions. [2021-05-02 23:31:10,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:31:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 375 transitions. [2021-05-02 23:31:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-02 23:31:10,730 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:10,731 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:10,731 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 23:31:10,731 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:10,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:10,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1424204299, now seen corresponding path program 1 times [2021-05-02 23:31:10,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:10,732 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1621862368] [2021-05-02 23:31:10,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:10,734 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:10,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:10,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-02 23:31:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:10,845 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-02 23:31:10,846 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:10,846 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1621862368] [2021-05-02 23:31:10,847 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1621862368] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:10,848 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:10,848 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 23:31:10,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568905152] [2021-05-02 23:31:10,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 23:31:10,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:10,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 23:31:10,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:31:10,849 INFO L87 Difference]: Start difference. First operand 232 states and 375 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:31:11,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:11,373 INFO L93 Difference]: Finished difference Result 281 states and 452 transitions. [2021-05-02 23:31:11,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:31:11,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2021-05-02 23:31:11,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:11,376 INFO L225 Difference]: With dead ends: 281 [2021-05-02 23:31:11,376 INFO L226 Difference]: Without dead ends: 279 [2021-05-02 23:31:11,377 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 147.0ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-05-02 23:31:11,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-05-02 23:31:11,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 260. [2021-05-02 23:31:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 126 states have internal predecessors, (168), 128 states have call successors, (128), 11 states have call predecessors, (128), 10 states have return successors, (127), 122 states have call predecessors, (127), 127 states have call successors, (127) [2021-05-02 23:31:11,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 423 transitions. [2021-05-02 23:31:11,417 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 423 transitions. Word has length 20 [2021-05-02 23:31:11,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:11,417 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 423 transitions. [2021-05-02 23:31:11,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:31:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 423 transitions. [2021-05-02 23:31:11,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-02 23:31:11,419 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:11,419 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:11,419 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 23:31:11,419 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:11,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:11,420 INFO L82 PathProgramCache]: Analyzing trace with hash 297853571, now seen corresponding path program 1 times [2021-05-02 23:31:11,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:11,420 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [805526107] [2021-05-02 23:31:11,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:11,422 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:11,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:11,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-02 23:31:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:11,457 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-02 23:31:11,458 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:11,458 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [805526107] [2021-05-02 23:31:11,458 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [805526107] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:11,458 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:11,458 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 23:31:11,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095713738] [2021-05-02 23:31:11,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 23:31:11,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:11,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 23:31:11,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 23:31:11,459 INFO L87 Difference]: Start difference. First operand 260 states and 423 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:31:11,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:11,664 INFO L93 Difference]: Finished difference Result 325 states and 513 transitions. [2021-05-02 23:31:11,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 23:31:11,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2021-05-02 23:31:11,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:11,669 INFO L225 Difference]: With dead ends: 325 [2021-05-02 23:31:11,669 INFO L226 Difference]: Without dead ends: 215 [2021-05-02 23:31:11,671 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:31:11,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-05-02 23:31:11,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 185. [2021-05-02 23:31:11,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 89 states have (on average 1.348314606741573) internal successors, (120), 92 states have internal predecessors, (120), 86 states have call successors, (86), 10 states have call predecessors, (86), 9 states have return successors, (85), 82 states have call predecessors, (85), 85 states have call successors, (85) [2021-05-02 23:31:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 291 transitions. [2021-05-02 23:31:11,699 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 291 transitions. Word has length 20 [2021-05-02 23:31:11,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:11,699 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 291 transitions. [2021-05-02 23:31:11,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:31:11,699 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 291 transitions. [2021-05-02 23:31:11,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-02 23:31:11,700 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:11,700 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:11,700 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-02 23:31:11,700 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:11,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:11,701 INFO L82 PathProgramCache]: Analyzing trace with hash 837398285, now seen corresponding path program 1 times [2021-05-02 23:31:11,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:11,701 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [36636728] [2021-05-02 23:31:11,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:11,703 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:11,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:11,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-02 23:31:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:11,752 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-02 23:31:11,752 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:11,752 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [36636728] [2021-05-02 23:31:11,752 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [36636728] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:11,752 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:11,752 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 23:31:11,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375778583] [2021-05-02 23:31:11,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 23:31:11,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:11,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 23:31:11,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:31:11,754 INFO L87 Difference]: Start difference. First operand 185 states and 291 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:31:11,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:11,941 INFO L93 Difference]: Finished difference Result 226 states and 344 transitions. [2021-05-02 23:31:11,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 23:31:11,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2021-05-02 23:31:11,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:11,944 INFO L225 Difference]: With dead ends: 226 [2021-05-02 23:31:11,944 INFO L226 Difference]: Without dead ends: 185 [2021-05-02 23:31:11,945 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 58.0ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:31:11,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-05-02 23:31:11,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2021-05-02 23:31:11,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 92 states have internal predecessors, (119), 86 states have call successors, (86), 10 states have call predecessors, (86), 9 states have return successors, (85), 82 states have call predecessors, (85), 85 states have call successors, (85) [2021-05-02 23:31:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 290 transitions. [2021-05-02 23:31:11,972 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 290 transitions. Word has length 20 [2021-05-02 23:31:11,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:11,972 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 290 transitions. [2021-05-02 23:31:11,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 23:31:11,973 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 290 transitions. [2021-05-02 23:31:11,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-02 23:31:11,973 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:11,973 INFO L523 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:11,974 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-02 23:31:11,974 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:11,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:11,974 INFO L82 PathProgramCache]: Analyzing trace with hash 288094237, now seen corresponding path program 1 times [2021-05-02 23:31:11,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:11,974 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [412092073] [2021-05-02 23:31:11,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:11,976 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:12,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:12,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-02 23:31:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:12,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-05-02 23:31:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:12,035 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-02 23:31:12,036 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:12,036 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [412092073] [2021-05-02 23:31:12,036 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [412092073] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:12,036 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:12,036 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:31:12,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668936276] [2021-05-02 23:31:12,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:31:12,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:12,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:31:12,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:31:12,038 INFO L87 Difference]: Start difference. First operand 185 states and 290 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 23:31:12,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:12,514 INFO L93 Difference]: Finished difference Result 243 states and 387 transitions. [2021-05-02 23:31:12,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:31:12,515 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2021-05-02 23:31:12,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:12,517 INFO L225 Difference]: With dead ends: 243 [2021-05-02 23:31:12,517 INFO L226 Difference]: Without dead ends: 241 [2021-05-02 23:31:12,517 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 124.6ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:31:12,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-05-02 23:31:12,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 220. [2021-05-02 23:31:12,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 106 states have (on average 1.3679245283018868) internal successors, (145), 112 states have internal predecessors, (145), 103 states have call successors, (103), 11 states have call predecessors, (103), 10 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2021-05-02 23:31:12,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 350 transitions. [2021-05-02 23:31:12,547 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 350 transitions. Word has length 27 [2021-05-02 23:31:12,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:12,547 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 350 transitions. [2021-05-02 23:31:12,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 23:31:12,548 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 350 transitions. [2021-05-02 23:31:12,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-02 23:31:12,548 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:12,549 INFO L523 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:12,549 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-02 23:31:12,549 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:12,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:12,549 INFO L82 PathProgramCache]: Analyzing trace with hash -870562259, now seen corresponding path program 1 times [2021-05-02 23:31:12,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:12,549 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1338793650] [2021-05-02 23:31:12,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:12,595 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< 1 v_main_~r~0_17) (< v_main_~r~0_17 (* 2 v_main_~l~0_18)) (<= v_main_~l~0_18 v_main_~n~0_20) (< 1 v_main_~l~0_18)) InVars {main_~l~0=v_main_~l~0_18, main_~n~0=v_main_~n~0_20, main_~r~0=v_main_~r~0_17} OutVars{main_~l~0=v_main_~l~0_18, main_~n~0=v_main_~n~0_20, main_~r~0=v_main_~r~0_17} AuxVars[] AssignedVars[] [2021-05-02 23:31:12,611 WARN L240 tifierPushTermWalker]: treesize reduction 24, result has 83.8 percent of original size [2021-05-02 23:31:12,652 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:12,666 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:12,695 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-05-02 23:31:12,700 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-05-02 23:31:12,737 WARN L245 tifierPushTermWalker]: treesize reduction 24, result has 83.8 percent of original size 124 [2021-05-02 23:31:12,772 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:12,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:12,845 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-02 23:31:12,849 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:12,926 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:13,015 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:13,022 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:13,041 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:13,062 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:13,084 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:13,115 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:13,120 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:13,173 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:13,198 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:13,198 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1338793650] [2021-05-02 23:31:13,198 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1338793650] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:13,198 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:13,198 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-02 23:31:13,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135441584] [2021-05-02 23:31:13,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-02 23:31:13,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:13,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-02 23:31:13,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-05-02 23:31:13,200 INFO L87 Difference]: Start difference. First operand 220 states and 350 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 23:31:14,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:14,486 INFO L93 Difference]: Finished difference Result 506 states and 824 transitions. [2021-05-02 23:31:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-02 23:31:14,486 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2021-05-02 23:31:14,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:14,491 INFO L225 Difference]: With dead ends: 506 [2021-05-02 23:31:14,491 INFO L226 Difference]: Without dead ends: 404 [2021-05-02 23:31:14,493 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 675.0ms TimeCoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2021-05-02 23:31:14,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-05-02 23:31:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 368. [2021-05-02 23:31:14,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 168 states have (on average 1.3988095238095237) internal successors, (235), 180 states have internal predecessors, (235), 188 states have call successors, (188), 13 states have call predecessors, (188), 11 states have return successors, (187), 174 states have call predecessors, (187), 187 states have call successors, (187) [2021-05-02 23:31:14,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 610 transitions. [2021-05-02 23:31:14,579 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 610 transitions. Word has length 29 [2021-05-02 23:31:14,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:14,580 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 610 transitions. [2021-05-02 23:31:14,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 23:31:14,580 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 610 transitions. [2021-05-02 23:31:14,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-05-02 23:31:14,580 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:14,581 INFO L523 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:14,581 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-02 23:31:14,581 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:14,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:14,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1319777776, now seen corresponding path program 1 times [2021-05-02 23:31:14,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:14,581 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1443293052] [2021-05-02 23:31:14,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:14,583 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:14,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:14,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-02 23:31:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:14,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-05-02 23:31:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:14,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-05-02 23:31:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-05-02 23:31:14,688 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:14,688 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1443293052] [2021-05-02 23:31:14,688 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1443293052] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:14,688 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:14,688 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:31:14,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9153479] [2021-05-02 23:31:14,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:31:14,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:14,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:31:14,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:31:14,690 INFO L87 Difference]: Start difference. First operand 368 states and 610 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-05-02 23:31:15,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:15,259 INFO L93 Difference]: Finished difference Result 445 states and 727 transitions. [2021-05-02 23:31:15,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:31:15,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2021-05-02 23:31:15,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:15,264 INFO L225 Difference]: With dead ends: 445 [2021-05-02 23:31:15,264 INFO L226 Difference]: Without dead ends: 443 [2021-05-02 23:31:15,265 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 138.1ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:31:15,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-05-02 23:31:15,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 406. [2021-05-02 23:31:15,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 182 states have (on average 1.39010989010989) internal successors, (253), 198 states have internal predecessors, (253), 210 states have call successors, (210), 15 states have call predecessors, (210), 13 states have return successors, (209), 192 states have call predecessors, (209), 209 states have call successors, (209) [2021-05-02 23:31:15,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 672 transitions. [2021-05-02 23:31:15,348 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 672 transitions. Word has length 30 [2021-05-02 23:31:15,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:15,348 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 672 transitions. [2021-05-02 23:31:15,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-05-02 23:31:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 672 transitions. [2021-05-02 23:31:15,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-05-02 23:31:15,350 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:15,350 INFO L523 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:15,351 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-02 23:31:15,351 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:15,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:15,351 INFO L82 PathProgramCache]: Analyzing trace with hash 154781133, now seen corresponding path program 1 times [2021-05-02 23:31:15,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:15,352 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1134464250] [2021-05-02 23:31:15,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:15,354 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:15,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:15,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-02 23:31:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:15,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-05-02 23:31:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:15,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-05-02 23:31:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:15,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-05-02 23:31:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:15,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-05-02 23:31:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-05-02 23:31:15,456 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:15,457 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1134464250] [2021-05-02 23:31:15,457 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1134464250] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:15,457 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:15,457 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 23:31:15,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588149508] [2021-05-02 23:31:15,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 23:31:15,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:15,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 23:31:15,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:31:15,459 INFO L87 Difference]: Start difference. First operand 406 states and 672 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-05-02 23:31:16,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:16,096 INFO L93 Difference]: Finished difference Result 468 states and 760 transitions. [2021-05-02 23:31:16,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 23:31:16,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2021-05-02 23:31:16,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:16,105 INFO L225 Difference]: With dead ends: 468 [2021-05-02 23:31:16,105 INFO L226 Difference]: Without dead ends: 466 [2021-05-02 23:31:16,105 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 173.6ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-05-02 23:31:16,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-05-02 23:31:16,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 410. [2021-05-02 23:31:16,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 185 states have (on average 1.3837837837837839) internal successors, (256), 201 states have internal predecessors, (256), 210 states have call successors, (210), 16 states have call predecessors, (210), 14 states have return successors, (209), 192 states have call predecessors, (209), 209 states have call successors, (209) [2021-05-02 23:31:16,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 675 transitions. [2021-05-02 23:31:16,179 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 675 transitions. Word has length 42 [2021-05-02 23:31:16,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:16,180 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 675 transitions. [2021-05-02 23:31:16,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-05-02 23:31:16,180 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 675 transitions. [2021-05-02 23:31:16,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-05-02 23:31:16,181 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:16,181 INFO L523 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:16,181 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-02 23:31:16,181 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:16,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:16,181 INFO L82 PathProgramCache]: Analyzing trace with hash -145623726, now seen corresponding path program 1 times [2021-05-02 23:31:16,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:16,183 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2102092982] [2021-05-02 23:31:16,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:16,220 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (* 2 v_main_~l~0_23))) (and (<= 0 (+ |v_main_#t~nondet7_7| 2147483648)) (<= |v_main_#t~nondet7_7| 2147483647) (<= .cse0 v_main_~r~0_21) (<= .cse0 v_main_~n~0_24) (<= v_main_~r~0_21 .cse0) (<= v_main_~r~0_21 v_main_~n~0_24) (< 1 v_main_~r~0_21) (<= 1 .cse0) (<= v_main_~l~0_23 1) (not (= |v_main_#t~nondet7_7| 0)))) InVars {main_~l~0=v_main_~l~0_23, main_#t~nondet7=|v_main_#t~nondet7_7|, main_~n~0=v_main_~n~0_24, main_~r~0=v_main_~r~0_21} OutVars{main_~l~0=v_main_~l~0_23, main_#t~nondet7=|v_main_#t~nondet7_7|, main_~n~0=v_main_~n~0_24, main_~r~0=v_main_~r~0_21} AuxVars[] AssignedVars[] [2021-05-02 23:31:16,240 WARN L240 tifierPushTermWalker]: treesize reduction 54, result has 79.1 percent of original size [2021-05-02 23:31:16,249 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:16,251 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:16,280 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-02 23:31:16,287 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-05-02 23:31:16,395 WARN L245 tifierPushTermWalker]: treesize reduction 54, result has 79.1 percent of original size 204 [2021-05-02 23:31:16,441 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:16,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:16,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-02 23:31:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:16,508 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-02 23:31:16,513 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:16,520 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:16,602 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:16,699 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:16,729 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:16,731 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:16,757 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:16,761 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:16,791 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:16,793 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:16,824 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:16,827 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:16,858 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:16,860 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:16,863 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:16,866 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:16,875 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:17,587 WARN L205 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2021-05-02 23:31:17,589 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:17,949 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-05-02 23:31:17,960 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:17,963 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:18,322 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:18,711 WARN L205 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-05-02 23:31:18,713 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:18,716 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:18,717 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:18,751 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:18,756 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:19,153 WARN L205 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2021-05-02 23:31:19,156 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:19,161 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:19,596 WARN L205 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-02 23:31:19,598 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:19,599 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:19,647 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:19,649 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:19,651 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:19,652 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:19,679 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:19,697 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:19,719 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:19,723 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:19,730 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:19,731 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:19,743 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:19,744 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:19,746 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:19,747 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:19,751 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:20,122 WARN L205 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2021-05-02 23:31:20,126 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:20,510 WARN L205 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2021-05-02 23:31:20,512 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:20,512 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2102092982] [2021-05-02 23:31:20,512 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2102092982] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:20,512 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:20,512 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-02 23:31:20,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459766041] [2021-05-02 23:31:20,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-02 23:31:20,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:20,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-02 23:31:20,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=576, Unknown=1, NotChecked=0, Total=702 [2021-05-02 23:31:20,514 INFO L87 Difference]: Start difference. First operand 410 states and 675 transitions. Second operand has 26 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 18 states have internal predecessors, (30), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-05-02 23:31:26,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:26,111 INFO L93 Difference]: Finished difference Result 897 states and 1479 transitions. [2021-05-02 23:31:26,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-05-02 23:31:26,112 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 18 states have internal predecessors, (30), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2021-05-02 23:31:26,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:26,119 INFO L225 Difference]: With dead ends: 897 [2021-05-02 23:31:26,119 INFO L226 Difference]: Without dead ends: 838 [2021-05-02 23:31:26,122 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1367 ImplicationChecksByTransitivity, 6624.2ms TimeCoverageRelationStatistics Valid=912, Invalid=3643, Unknown=1, NotChecked=0, Total=4556 [2021-05-02 23:31:26,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2021-05-02 23:31:26,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 486. [2021-05-02 23:31:26,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 219 states have (on average 1.3835616438356164) internal successors, (303), 247 states have internal predecessors, (303), 249 states have call successors, (249), 19 states have call predecessors, (249), 17 states have return successors, (248), 219 states have call predecessors, (248), 248 states have call successors, (248) [2021-05-02 23:31:26,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 800 transitions. [2021-05-02 23:31:26,265 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 800 transitions. Word has length 47 [2021-05-02 23:31:26,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:26,266 INFO L480 AbstractCegarLoop]: Abstraction has 486 states and 800 transitions. [2021-05-02 23:31:26,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 18 states have internal predecessors, (30), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-05-02 23:31:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 800 transitions. [2021-05-02 23:31:26,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-05-02 23:31:26,268 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:26,268 INFO L523 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:26,268 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-02 23:31:26,268 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:26,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:26,269 INFO L82 PathProgramCache]: Analyzing trace with hash -108519480, now seen corresponding path program 1 times [2021-05-02 23:31:26,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:26,269 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1390191433] [2021-05-02 23:31:26,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:26,271 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:26,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:26,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-02 23:31:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:26,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-05-02 23:31:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:26,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-05-02 23:31:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:26,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-05-02 23:31:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:26,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-05-02 23:31:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:26,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-02 23:31:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:26,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-05-02 23:31:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:26,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-05-02 23:31:26,403 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:26,403 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1390191433] [2021-05-02 23:31:26,403 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1390191433] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:26,403 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:26,403 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 23:31:26,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170062299] [2021-05-02 23:31:26,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 23:31:26,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:26,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 23:31:26,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:31:26,404 INFO L87 Difference]: Start difference. First operand 486 states and 800 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-02 23:31:27,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:27,124 INFO L93 Difference]: Finished difference Result 542 states and 873 transitions. [2021-05-02 23:31:27,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 23:31:27,125 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2021-05-02 23:31:27,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:27,129 INFO L225 Difference]: With dead ends: 542 [2021-05-02 23:31:27,129 INFO L226 Difference]: Without dead ends: 540 [2021-05-02 23:31:27,129 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 228.5ms TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-05-02 23:31:27,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-05-02 23:31:27,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 487. [2021-05-02 23:31:27,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 222 states have (on average 1.3783783783783783) internal successors, (306), 250 states have internal predecessors, (306), 246 states have call successors, (246), 20 states have call predecessors, (246), 18 states have return successors, (245), 216 states have call predecessors, (245), 245 states have call successors, (245) [2021-05-02 23:31:27,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 797 transitions. [2021-05-02 23:31:27,247 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 797 transitions. Word has length 54 [2021-05-02 23:31:27,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:27,247 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 797 transitions. [2021-05-02 23:31:27,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-02 23:31:27,247 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 797 transitions. [2021-05-02 23:31:27,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-02 23:31:27,249 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:27,249 INFO L523 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:27,249 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-02 23:31:27,249 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:27,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:27,250 INFO L82 PathProgramCache]: Analyzing trace with hash -667500302, now seen corresponding path program 1 times [2021-05-02 23:31:27,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:27,250 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1382969811] [2021-05-02 23:31:27,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:27,264 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2021-05-02 23:31:27,266 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:27,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:27,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-02 23:31:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:27,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-05-02 23:31:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:27,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-05-02 23:31:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:27,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-05-02 23:31:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:27,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-05-02 23:31:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:27,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-02 23:31:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:27,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-05-02 23:31:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:27,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-05-02 23:31:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-05-02 23:31:27,330 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:27,330 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1382969811] [2021-05-02 23:31:27,330 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1382969811] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:27,330 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:27,330 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:31:27,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20548395] [2021-05-02 23:31:27,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:31:27,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:27,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:31:27,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:31:27,331 INFO L87 Difference]: Start difference. First operand 487 states and 797 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-02 23:31:27,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:27,747 INFO L93 Difference]: Finished difference Result 885 states and 1426 transitions. [2021-05-02 23:31:27,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:31:27,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2021-05-02 23:31:27,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:27,752 INFO L225 Difference]: With dead ends: 885 [2021-05-02 23:31:27,752 INFO L226 Difference]: Without dead ends: 484 [2021-05-02 23:31:27,754 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 118.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:31:27,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-05-02 23:31:27,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 440. [2021-05-02 23:31:27,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 210 states have (on average 1.3333333333333333) internal successors, (280), 231 states have internal predecessors, (280), 211 states have call successors, (211), 20 states have call predecessors, (211), 18 states have return successors, (210), 188 states have call predecessors, (210), 210 states have call successors, (210) [2021-05-02 23:31:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 701 transitions. [2021-05-02 23:31:27,864 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 701 transitions. Word has length 62 [2021-05-02 23:31:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:27,864 INFO L480 AbstractCegarLoop]: Abstraction has 440 states and 701 transitions. [2021-05-02 23:31:27,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-02 23:31:27,865 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 701 transitions. [2021-05-02 23:31:27,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-05-02 23:31:27,866 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:27,866 INFO L523 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:27,866 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-02 23:31:27,866 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:27,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:27,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1001616427, now seen corresponding path program 1 times [2021-05-02 23:31:27,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:27,867 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1959815440] [2021-05-02 23:31:27,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:27,880 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~r~0_27 (* 2 v_main_~l~0_27)) (< 1 v_main_~r~0_27) (<= v_main_~l~0_27 v_main_~n~0_32) (< 1 v_main_~l~0_27)) InVars {main_~l~0=v_main_~l~0_27, main_~n~0=v_main_~n~0_32, main_~r~0=v_main_~r~0_27} OutVars{main_~l~0=v_main_~l~0_27, main_~n~0=v_main_~n~0_32, main_~r~0=v_main_~r~0_27} AuxVars[] AssignedVars[] [2021-05-02 23:31:27,884 WARN L240 tifierPushTermWalker]: treesize reduction 24, result has 83.8 percent of original size [2021-05-02 23:31:27,886 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:27,888 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:27,911 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-05-02 23:31:27,914 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-05-02 23:31:27,977 WARN L245 tifierPushTermWalker]: treesize reduction 24, result has 83.8 percent of original size 124 [2021-05-02 23:31:28,018 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:28,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:28,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-02 23:31:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:28,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 23:31:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:28,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-05-02 23:31:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:28,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-05-02 23:31:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:28,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-05-02 23:31:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:28,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-05-02 23:31:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:28,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-05-02 23:31:28,146 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:28,191 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:28,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1959815440] [2021-05-02 23:31:28,192 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1959815440] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:28,192 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:28,192 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 23:31:28,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875984548] [2021-05-02 23:31:28,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 23:31:28,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:28,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 23:31:28,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:31:28,193 INFO L87 Difference]: Start difference. First operand 440 states and 701 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-02 23:31:29,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:29,055 INFO L93 Difference]: Finished difference Result 729 states and 1109 transitions. [2021-05-02 23:31:29,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-02 23:31:29,055 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 63 [2021-05-02 23:31:29,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:29,059 INFO L225 Difference]: With dead ends: 729 [2021-05-02 23:31:29,059 INFO L226 Difference]: Without dead ends: 432 [2021-05-02 23:31:29,061 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 283.9ms TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2021-05-02 23:31:29,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-05-02 23:31:29,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 389. [2021-05-02 23:31:29,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 197 states have (on average 1.2741116751269035) internal successors, (251), 216 states have internal predecessors, (251), 165 states have call successors, (165), 28 states have call predecessors, (165), 26 states have return successors, (164), 144 states have call predecessors, (164), 164 states have call successors, (164) [2021-05-02 23:31:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 580 transitions. [2021-05-02 23:31:29,186 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 580 transitions. Word has length 63 [2021-05-02 23:31:29,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:29,186 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 580 transitions. [2021-05-02 23:31:29,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-02 23:31:29,186 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 580 transitions. [2021-05-02 23:31:29,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-02 23:31:29,188 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:29,188 INFO L523 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:29,188 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-02 23:31:29,188 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:29,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:29,188 INFO L82 PathProgramCache]: Analyzing trace with hash 152819220, now seen corresponding path program 1 times [2021-05-02 23:31:29,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:29,189 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1429429997] [2021-05-02 23:31:29,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:29,207 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (* 2 v_main_~l~0_32))) (and (< 1 v_main_~l~0_32) (<= |v_main_#t~nondet7_13| 2147483647) (not (= |v_main_#t~nondet7_13| 0)) (<= 0 (+ |v_main_#t~nondet7_13| 2147483648)) (<= v_main_~r~0_28 .cse0) (< 1 v_main_~r~0_28) (<= 1 .cse0) (<= .cse0 v_main_~n~0_35) (<= v_main_~l~0_32 v_main_~n~0_35) (<= .cse0 v_main_~r~0_28))) InVars {main_~l~0=v_main_~l~0_32, main_#t~nondet7=|v_main_#t~nondet7_13|, main_~n~0=v_main_~n~0_35, main_~r~0=v_main_~r~0_28} OutVars{main_~l~0=v_main_~l~0_32, main_#t~nondet7=|v_main_#t~nondet7_13|, main_~n~0=v_main_~n~0_35, main_~r~0=v_main_~r~0_28} AuxVars[] AssignedVars[] [2021-05-02 23:31:29,215 WARN L240 tifierPushTermWalker]: treesize reduction 34, result has 88.4 percent of original size [2021-05-02 23:31:29,301 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:29,302 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:29,324 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-05-02 23:31:29,329 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 70 [2021-05-02 23:31:29,392 WARN L245 tifierPushTermWalker]: treesize reduction 34, result has 88.4 percent of original size 258 [2021-05-02 23:31:29,440 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:29,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:29,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-02 23:31:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:29,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 23:31:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:29,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-05-02 23:31:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:29,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-05-02 23:31:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:29,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-05-02 23:31:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:29,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-05-02 23:31:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-05-02 23:31:29,521 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:29,603 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:29,666 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:29,683 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:29,684 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:29,706 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:29,707 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:29,732 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:29,733 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:29,754 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:29,755 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:29,786 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:29,787 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:29,788 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:29,789 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:29,792 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:30,125 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-05-02 23:31:30,127 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:30,447 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-05-02 23:31:30,450 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:30,450 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:30,471 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:30,509 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:30,510 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:30,529 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:30,556 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:30,587 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:30,611 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:30,612 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:30,613 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:30,619 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:32,655 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:34,679 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:34,704 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:34,705 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:34,707 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:34,708 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:34,710 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:34,711 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:34,713 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:35,055 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-05-02 23:31:35,057 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:35,393 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-05-02 23:31:35,394 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:35,394 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1429429997] [2021-05-02 23:31:35,394 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1429429997] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:35,394 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:35,395 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-02 23:31:35,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184410490] [2021-05-02 23:31:35,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-02 23:31:35,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:35,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-02 23:31:35,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=494, Unknown=1, NotChecked=0, Total=600 [2021-05-02 23:31:35,396 INFO L87 Difference]: Start difference. First operand 389 states and 580 transitions. Second operand has 24 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2021-05-02 23:31:38,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:38,324 INFO L93 Difference]: Finished difference Result 612 states and 938 transitions. [2021-05-02 23:31:38,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-02 23:31:38,325 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 76 [2021-05-02 23:31:38,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:38,329 INFO L225 Difference]: With dead ends: 612 [2021-05-02 23:31:38,329 INFO L226 Difference]: Without dead ends: 610 [2021-05-02 23:31:38,330 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 25 SyntacticMatches, 9 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 7246.9ms TimeCoverageRelationStatistics Valid=524, Invalid=2231, Unknown=1, NotChecked=0, Total=2756 [2021-05-02 23:31:38,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2021-05-02 23:31:38,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 378. [2021-05-02 23:31:38,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 193 states have (on average 1.2694300518134716) internal successors, (245), 211 states have internal predecessors, (245), 158 states have call successors, (158), 28 states have call predecessors, (158), 26 states have return successors, (157), 138 states have call predecessors, (157), 157 states have call successors, (157) [2021-05-02 23:31:38,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 560 transitions. [2021-05-02 23:31:38,461 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 560 transitions. Word has length 76 [2021-05-02 23:31:38,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:38,461 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 560 transitions. [2021-05-02 23:31:38,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2021-05-02 23:31:38,462 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 560 transitions. [2021-05-02 23:31:38,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-05-02 23:31:38,463 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:38,463 INFO L523 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:38,463 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-02 23:31:38,463 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:38,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:38,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1287577935, now seen corresponding path program 1 times [2021-05-02 23:31:38,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:38,464 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1189136334] [2021-05-02 23:31:38,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:38,483 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (* 2 v_main_~l~0_37))) (and (<= 0 (+ |v_main_#t~nondet7_17| 2147483648)) (<= |v_main_#t~nondet7_17| 2147483647) (<= v_main_~l~0_37 1) (not (= |v_main_#t~nondet7_17| 0)) (<= .cse0 v_main_~n~0_40) (<= .cse0 v_main_~r~0_32) (<= 1 .cse0) (<= v_main_~r~0_32 v_main_~n~0_40) (< 1 v_main_~r~0_32) (<= v_main_~r~0_32 .cse0))) InVars {main_~l~0=v_main_~l~0_37, main_#t~nondet7=|v_main_#t~nondet7_17|, main_~n~0=v_main_~n~0_40, main_~r~0=v_main_~r~0_32} OutVars{main_~l~0=v_main_~l~0_37, main_#t~nondet7=|v_main_#t~nondet7_17|, main_~n~0=v_main_~n~0_40, main_~r~0=v_main_~r~0_32} AuxVars[] AssignedVars[] [2021-05-02 23:31:38,490 WARN L240 tifierPushTermWalker]: treesize reduction 54, result has 79.1 percent of original size [2021-05-02 23:31:38,561 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:38,562 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:38,579 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-02 23:31:38,584 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-05-02 23:31:38,632 WARN L245 tifierPushTermWalker]: treesize reduction 54, result has 79.1 percent of original size 204 [2021-05-02 23:31:38,676 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:38,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:38,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-02 23:31:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:38,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 23:31:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:38,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-05-02 23:31:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:38,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-05-02 23:31:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:38,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-05-02 23:31:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:38,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-05-02 23:31:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:38,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-05-02 23:31:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:38,762 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-05-02 23:31:38,765 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:38,766 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:38,820 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:38,901 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:38,924 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:38,925 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:38,945 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:38,946 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:38,975 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:38,976 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,005 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,007 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,037 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,038 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,040 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,040 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,043 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,072 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,100 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,100 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,272 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,310 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,313 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,314 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,344 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,354 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,393 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,401 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,438 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,439 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,490 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,491 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,493 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,494 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,495 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,544 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,569 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,588 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,589 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,593 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,594 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,596 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,597 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,599 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,599 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:39,602 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:40,014 WARN L205 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2021-05-02 23:31:40,016 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:40,056 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:40,056 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1189136334] [2021-05-02 23:31:40,056 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1189136334] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:40,056 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:40,056 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-02 23:31:40,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832093860] [2021-05-02 23:31:40,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-02 23:31:40,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:40,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-02 23:31:40,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2021-05-02 23:31:40,057 INFO L87 Difference]: Start difference. First operand 378 states and 560 transitions. Second operand has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 18 states have internal predecessors, (34), 6 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2021-05-02 23:31:45,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:45,691 INFO L93 Difference]: Finished difference Result 669 states and 1032 transitions. [2021-05-02 23:31:45,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-05-02 23:31:45,692 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 18 states have internal predecessors, (34), 6 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 81 [2021-05-02 23:31:45,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:45,698 INFO L225 Difference]: With dead ends: 669 [2021-05-02 23:31:45,698 INFO L226 Difference]: Without dead ends: 667 [2021-05-02 23:31:45,699 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1990 ImplicationChecksByTransitivity, 4194.5ms TimeCoverageRelationStatistics Valid=1185, Invalid=4977, Unknown=0, NotChecked=0, Total=6162 [2021-05-02 23:31:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2021-05-02 23:31:45,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 422. [2021-05-02 23:31:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 209 states have (on average 1.291866028708134) internal successors, (270), 231 states have internal predecessors, (270), 186 states have call successors, (186), 28 states have call predecessors, (186), 26 states have return successors, (185), 162 states have call predecessors, (185), 185 states have call successors, (185) [2021-05-02 23:31:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 641 transitions. [2021-05-02 23:31:45,865 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 641 transitions. Word has length 81 [2021-05-02 23:31:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:45,865 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 641 transitions. [2021-05-02 23:31:45,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 18 states have internal predecessors, (34), 6 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2021-05-02 23:31:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 641 transitions. [2021-05-02 23:31:45,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-05-02 23:31:45,867 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:45,867 INFO L523 BasicCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:45,867 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-02 23:31:45,867 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:45,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:45,868 INFO L82 PathProgramCache]: Analyzing trace with hash -578278577, now seen corresponding path program 1 times [2021-05-02 23:31:45,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:45,868 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2129162599] [2021-05-02 23:31:45,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:45,889 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2021-05-02 23:31:45,890 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:31:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:45,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:45,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-02 23:31:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:45,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-05-02 23:31:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:45,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-05-02 23:31:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:45,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-05-02 23:31:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:45,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-05-02 23:31:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:45,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-02 23:31:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:45,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-05-02 23:31:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:45,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-05-02 23:31:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:46,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-05-02 23:31:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:46,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-05-02 23:31:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:46,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-05-02 23:31:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:46,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-05-02 23:31:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:46,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-05-02 23:31:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-05-02 23:31:46,011 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:46,011 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2129162599] [2021-05-02 23:31:46,011 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2129162599] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:46,011 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:46,011 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 23:31:46,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140985657] [2021-05-02 23:31:46,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 23:31:46,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:46,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 23:31:46,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:31:46,012 INFO L87 Difference]: Start difference. First operand 422 states and 641 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-05-02 23:31:46,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:46,629 INFO L93 Difference]: Finished difference Result 465 states and 689 transitions. [2021-05-02 23:31:46,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 23:31:46,630 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 89 [2021-05-02 23:31:46,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:46,633 INFO L225 Difference]: With dead ends: 465 [2021-05-02 23:31:46,633 INFO L226 Difference]: Without dead ends: 463 [2021-05-02 23:31:46,633 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 218.0ms TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2021-05-02 23:31:46,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-05-02 23:31:46,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 441. [2021-05-02 23:31:46,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 222 states have (on average 1.2702702702702702) internal successors, (282), 246 states have internal predecessors, (282), 187 states have call successors, (187), 33 states have call predecessors, (187), 31 states have return successors, (186), 161 states have call predecessors, (186), 186 states have call successors, (186) [2021-05-02 23:31:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 655 transitions. [2021-05-02 23:31:46,759 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 655 transitions. Word has length 89 [2021-05-02 23:31:46,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:46,759 INFO L480 AbstractCegarLoop]: Abstraction has 441 states and 655 transitions. [2021-05-02 23:31:46,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-05-02 23:31:46,759 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 655 transitions. [2021-05-02 23:31:46,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-05-02 23:31:46,761 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:46,762 INFO L523 BasicCegarLoop]: trace histogram [18, 17, 17, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:46,762 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-02 23:31:46,762 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:46,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:46,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1339863026, now seen corresponding path program 1 times [2021-05-02 23:31:46,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:46,762 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1627106586] [2021-05-02 23:31:46,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:46,783 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (* 2 v_main_~l~0_38))) (and (<= v_main_~l~0_38 1) (<= 1 .cse0) (<= .cse0 v_main_~r~0_41) (not (= |v_main_#t~nondet7_23| 0)) (<= v_main_~r~0_41 v_main_~n~0_51) (< 1 v_main_~r~0_41) (<= |v_main_#t~nondet7_23| 2147483647) (<= .cse0 v_main_~n~0_51) (<= v_main_~r~0_41 .cse0) (<= 0 (+ |v_main_#t~nondet7_23| 2147483648)))) InVars {main_~l~0=v_main_~l~0_38, main_#t~nondet7=|v_main_#t~nondet7_23|, main_~n~0=v_main_~n~0_51, main_~r~0=v_main_~r~0_41} OutVars{main_~l~0=v_main_~l~0_38, main_#t~nondet7=|v_main_#t~nondet7_23|, main_~n~0=v_main_~n~0_51, main_~r~0=v_main_~r~0_41} AuxVars[] AssignedVars[] [2021-05-02 23:31:46,788 WARN L240 tifierPushTermWalker]: treesize reduction 54, result has 79.1 percent of original size [2021-05-02 23:31:46,854 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:46,854 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:46,866 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-02 23:31:46,869 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-05-02 23:31:46,920 WARN L245 tifierPushTermWalker]: treesize reduction 54, result has 79.1 percent of original size 204 [2021-05-02 23:31:46,960 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:47,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:47,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-02 23:31:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:47,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-02 23:31:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:47,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-05-02 23:31:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:47,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-05-02 23:31:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:47,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-05-02 23:31:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:47,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-05-02 23:31:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:47,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-05-02 23:31:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:47,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-05-02 23:31:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:47,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-05-02 23:31:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:47,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-05-02 23:31:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:47,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-05-02 23:31:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:47,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-05-02 23:31:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:47,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-05-02 23:31:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:47,096 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-05-02 23:31:47,098 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:47,271 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:47,368 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:47,408 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:47,409 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:47,439 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:47,440 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:47,476 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:47,477 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:47,528 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:47,529 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:47,567 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:47,568 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:47,570 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:47,571 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:47,576 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:47,617 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:47,654 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:47,655 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,084 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,128 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,129 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,130 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,172 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,173 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,219 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,221 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,269 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,271 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,316 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,317 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,320 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,321 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,322 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,378 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,511 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,533 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,533 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,536 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,536 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,538 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,539 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,541 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,542 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:48,545 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:50,598 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:50,632 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:51,548 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:52,171 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:52,182 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:31:52,227 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:52,227 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1627106586] [2021-05-02 23:31:52,227 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1627106586] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:52,227 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:52,228 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-02 23:31:52,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405792636] [2021-05-02 23:31:52,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-02 23:31:52,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:52,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-02 23:31:52,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=780, Unknown=5, NotChecked=0, Total=930 [2021-05-02 23:31:52,229 INFO L87 Difference]: Start difference. First operand 441 states and 655 transitions. Second operand has 28 states, 23 states have (on average 1.608695652173913) internal successors, (37), 20 states have internal predecessors, (37), 8 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2021-05-02 23:31:59,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:59,712 INFO L93 Difference]: Finished difference Result 873 states and 1296 transitions. [2021-05-02 23:31:59,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-05-02 23:31:59,712 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.608695652173913) internal successors, (37), 20 states have internal predecessors, (37), 8 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) Word has length 114 [2021-05-02 23:31:59,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:59,713 INFO L225 Difference]: With dead ends: 873 [2021-05-02 23:31:59,713 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 23:31:59,722 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 44 SyntacticMatches, 11 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2384 ImplicationChecksByTransitivity, 8547.4ms TimeCoverageRelationStatistics Valid=982, Invalid=5819, Unknown=5, NotChecked=0, Total=6806 [2021-05-02 23:31:59,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 23:31:59,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 23:31:59,722 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-02 23:31:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 23:31:59,723 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 114 [2021-05-02 23:31:59,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:59,723 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 23:31:59,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 23 states have (on average 1.608695652173913) internal successors, (37), 20 states have internal predecessors, (37), 8 states have call successors, (20), 6 states have call predecessors, (20), 4 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2021-05-02 23:31:59,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 23:31:59,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 23:31:59,723 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-02 23:31:59,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 23:31:59,898 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 232 [2021-05-02 23:32:00,423 WARN L205 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 342 DAG size of output: 321 [2021-05-02 23:32:01,308 WARN L205 SmtUtils]: Spent 881.00 ms on a formula simplification. DAG size of input: 360 DAG size of output: 338 [2021-05-02 23:32:02,284 WARN L205 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 395 DAG size of output: 366 [2021-05-02 23:32:02,399 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 224 [2021-05-02 23:32:02,591 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 319 DAG size of output: 285 [2021-05-02 23:32:03,142 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 253 [2021-05-02 23:32:03,332 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 289 [2021-05-02 23:32:03,588 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 253 [2021-05-02 23:32:04,688 WARN L205 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 356 DAG size of output: 332 [2021-05-02 23:32:04,983 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 342 DAG size of output: 321 [2021-05-02 23:32:05,386 WARN L205 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 359 DAG size of output: 332 [2021-05-02 23:32:05,724 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 364 DAG size of output: 344 [2021-05-02 23:32:06,050 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 369 DAG size of output: 313 [2021-05-02 23:32:06,199 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 310 DAG size of output: 284 [2021-05-02 23:32:06,352 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 282 [2021-05-02 23:32:06,579 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 253 [2021-05-02 23:32:07,109 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 335 DAG size of output: 301 [2021-05-02 23:32:07,316 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 310 DAG size of output: 284 [2021-05-02 23:32:08,191 WARN L205 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 72 [2021-05-02 23:32:09,933 WARN L205 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 307 DAG size of output: 62 [2021-05-02 23:32:11,797 WARN L205 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 328 DAG size of output: 15 [2021-05-02 23:32:13,004 WARN L205 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 282 DAG size of output: 39 [2021-05-02 23:32:14,961 WARN L205 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 353 DAG size of output: 33 [2021-05-02 23:32:15,511 WARN L205 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 62 [2021-05-02 23:32:16,489 WARN L205 SmtUtils]: Spent 975.00 ms on a formula simplification. DAG size of input: 262 DAG size of output: 50 [2021-05-02 23:32:18,925 WARN L205 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 283 DAG size of output: 36 [2021-05-02 23:32:19,525 WARN L205 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 21 [2021-05-02 23:32:20,684 WARN L205 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 267 DAG size of output: 71 [2021-05-02 23:32:21,234 WARN L205 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 21 [2021-05-02 23:32:21,817 WARN L205 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 83 [2021-05-02 23:32:22,964 WARN L205 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 282 DAG size of output: 39 [2021-05-02 23:32:23,497 WARN L205 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 85 [2021-05-02 23:32:23,803 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 33 [2021-05-02 23:32:25,591 WARN L205 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 322 DAG size of output: 75 [2021-05-02 23:32:26,117 WARN L205 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 72 [2021-05-02 23:32:27,761 WARN L205 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 307 DAG size of output: 62 [2021-05-02 23:32:29,514 WARN L205 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 320 DAG size of output: 55 [2021-05-02 23:32:30,068 WARN L205 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 72 [2021-05-02 23:32:31,743 WARN L205 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 332 DAG size of output: 59 [2021-05-02 23:32:33,385 WARN L205 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 294 DAG size of output: 83 [2021-05-02 23:32:34,446 WARN L205 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 261 DAG size of output: 60 [2021-05-02 23:32:35,405 WARN L205 SmtUtils]: Spent 956.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 70 [2021-05-02 23:32:35,859 WARN L205 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 70 [2021-05-02 23:32:36,428 WARN L205 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 21 [2021-05-02 23:32:36,929 WARN L205 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 277 DAG size of output: 1 [2021-05-02 23:32:38,059 WARN L205 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 276 DAG size of output: 66 [2021-05-02 23:32:38,639 WARN L205 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 72 [2021-05-02 23:32:39,732 WARN L205 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 261 DAG size of output: 60 [2021-05-02 23:32:40,068 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 38 [2021-05-02 23:32:40,072 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2021-05-02 23:32:40,072 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2021-05-02 23:32:40,072 INFO L198 CegarLoopUtils]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-05-02 23:32:40,072 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:32:40,072 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-02 23:32:40,072 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:32:40,073 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:32:40,073 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-02 23:32:40,073 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 23:32:40,073 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:32:40,073 INFO L198 CegarLoopUtils]: For program point L15(line 15) no Hoare annotation was computed. [2021-05-02 23:32:40,073 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2021-05-02 23:32:40,073 INFO L198 CegarLoopUtils]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2021-05-02 23:32:40,073 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2021-05-02 23:32:40,073 INFO L194 CegarLoopUtils]: At program point L64(line 64) the Hoare annotation is: (let ((.cse0 (<= 1 main_~j~0)) (.cse1 (<= 1 main_~i~0)) (.cse2 (<= 2 main_~r~0)) (.cse3 (<= main_~l~0 1)) (.cse4 (<= main_~r~0 main_~n~0))) (or (and (= main_~n~0 main_~r~0) .cse0 .cse1 .cse2 .cse3 (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0)) .cse4) (and .cse0 (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~n~0_BEFORE_CALL_15 Int) (v_main_~i~0_BEFORE_RETURN_5 Int) (v_main_~j~0_BEFORE_CALL_12 Int)) (let ((.cse5 (* 2 v_main_~i~0_BEFORE_RETURN_5)) (.cse6 (ite (<= v_main_~j~0_BEFORE_CALL_12 v_main_~n~0_BEFORE_CALL_15) 1 0))) (and (<= .cse5 v_main_~r~0_BEFORE_RETURN_5) (= (ite (<= (+ main_~r~0 1) main_~n~0) 1 0) .cse6) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse5) (= (ite (<= 1 .cse5) 1 0) (ite (<= 1 v_main_~j~0_BEFORE_CALL_12) 1 0)) (not (= .cse6 0))))) .cse1 .cse2 .cse3 (<= (+ main_~r~0 2) (* 2 main_~j~0)) .cse4))) [2021-05-02 23:32:40,074 INFO L194 CegarLoopUtils]: At program point L64-1(line 64) the Hoare annotation is: (let ((.cse4 (<= 2 main_~r~0)) (.cse6 (<= (+ main_~r~0 2) (* 2 main_~j~0))) (.cse0 (<= 1 main_~j~0)) (.cse3 (<= 1 main_~i~0)) (.cse5 (<= main_~l~0 1)) (.cse10 (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0))) (.cse7 (<= 1 main_~r~0)) (.cse8 (<= main_~r~0 main_~n~0)) (.cse9 (exists ((v_main_~n~0_BEFORE_CALL_1 Int) (v_main_~l~0_BEFORE_CALL_2 Int)) (let ((.cse11 (ite (<= v_main_~l~0_BEFORE_CALL_2 v_main_~n~0_BEFORE_CALL_1) 1 0))) (and (= (ite (<= (+ main_~l~0 1) main_~n~0) 1 0) .cse11) (not (= 0 .cse11)) (<= 1 v_main_~l~0_BEFORE_CALL_2)))))) (or (and .cse0 (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~n~0_BEFORE_CALL_15 Int) (v_main_~i~0_BEFORE_RETURN_5 Int) (v_main_~j~0_BEFORE_CALL_12 Int)) (let ((.cse1 (* 2 v_main_~i~0_BEFORE_RETURN_5)) (.cse2 (ite (<= v_main_~j~0_BEFORE_CALL_12 v_main_~n~0_BEFORE_CALL_15) 1 0))) (and (<= .cse1 v_main_~r~0_BEFORE_RETURN_5) (= (ite (<= (+ main_~r~0 1) main_~n~0) 1 0) .cse2) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse1) (= (ite (<= 1 .cse1) 1 0) (ite (<= 1 v_main_~j~0_BEFORE_CALL_12) 1 0)) (not (= .cse2 0))))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse8 .cse9) (and (= main_~n~0 main_~r~0) .cse0 (not (= (ite (<= main_~j~0 main_~n~0) 1 0) 0)) .cse3 .cse5 .cse10 .cse7 .cse8 .cse9))) [2021-05-02 23:32:40,074 INFO L194 CegarLoopUtils]: At program point L60(line 60) the Hoare annotation is: (and (<= 1 main_~j~0) (= main_~n~0 main_~r~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= (* 2 main_~l~0) main_~n~0) (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0))) [2021-05-02 23:32:40,074 INFO L201 CegarLoopUtils]: At program point L27(line 27) the Hoare annotation is: true [2021-05-02 23:32:40,074 INFO L194 CegarLoopUtils]: At program point L60-1(line 60) the Hoare annotation is: (and (<= 1 main_~j~0) (= main_~n~0 main_~r~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= (* 2 main_~l~0) main_~n~0) (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0))) [2021-05-02 23:32:40,074 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 24 70) the Hoare annotation is: true [2021-05-02 23:32:40,074 INFO L194 CegarLoopUtils]: At program point L52(line 52) the Hoare annotation is: (let ((.cse0 (= main_~n~0 main_~r~0)) (.cse1 (<= 1 main_~i~0)) (.cse2 (<= (* 2 main_~l~0) main_~n~0)) (.cse3 (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0)))) (or (and .cse0 (<= main_~j~0 main_~r~0) .cse1 .cse2 .cse3 (<= 2 main_~j~0)) (and (not (= (ite (<= (+ main_~r~0 1) main_~n~0) 1 0) 0)) (not (= (ite (<= main_~j~0 main_~n~0) 1 0) 0)) .cse1 (<= main_~l~0 1) (<= 2 main_~r~0) (<= (+ main_~i~0 1) main_~n~0) (<= (+ main_~r~0 2) (* 2 main_~j~0))) (and .cse0 .cse1 .cse2 (<= (+ main_~j~0 1) main_~n~0) (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~i~0_BEFORE_RETURN_5 Int)) (let ((.cse4 (* 2 v_main_~i~0_BEFORE_RETURN_5))) (and (<= .cse4 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse4) (= (ite (<= 1 .cse4) 1 0) (ite (<= 1 main_~j~0) 1 0))))) .cse3))) [2021-05-02 23:32:40,074 INFO L194 CegarLoopUtils]: At program point L52-1(line 52) the Hoare annotation is: (let ((.cse0 (<= 1 main_~i~0))) (or (and (not (= (ite (<= (+ main_~r~0 1) main_~n~0) 1 0) 0)) .cse0 (<= main_~l~0 1) (<= 2 main_~r~0) (<= (+ main_~i~0 1) main_~n~0) (<= (+ main_~r~0 2) (* 2 main_~j~0)) (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~n~0_BEFORE_CALL_15 Int) (v_main_~i~0_BEFORE_RETURN_5 Int) (v_main_~j~0_BEFORE_CALL_12 Int)) (let ((.cse1 (* 2 v_main_~i~0_BEFORE_RETURN_5)) (.cse2 (ite (<= v_main_~j~0_BEFORE_CALL_12 v_main_~n~0_BEFORE_CALL_15) 1 0))) (and (<= .cse1 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse1) (= (ite (<= 1 .cse1) 1 0) (ite (<= 1 v_main_~j~0_BEFORE_CALL_12) 1 0)) (= .cse2 (ite (<= main_~j~0 main_~n~0) 1 0)) (not (= .cse2 0)))))) (and (= main_~n~0 main_~r~0) (<= main_~j~0 main_~r~0) .cse0 (<= (* 2 main_~l~0) main_~n~0) (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~i~0_BEFORE_RETURN_5 Int)) (let ((.cse3 (* 2 v_main_~i~0_BEFORE_RETURN_5))) (and (<= .cse3 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse3) (= (ite (<= 1 .cse3) 1 0) (ite (<= 1 main_~j~0) 1 0))))) (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0))))) [2021-05-02 23:32:40,074 INFO L194 CegarLoopUtils]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 (= main_~n~0 main_~r~0)) (.cse1 (<= 1 main_~i~0)) (.cse2 (<= (* 2 main_~l~0) main_~n~0)) (.cse3 (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0)))) (or (and .cse0 (<= main_~j~0 main_~r~0) .cse1 .cse2 .cse3 (<= 2 main_~j~0)) (and (not (= (ite (<= (+ main_~r~0 1) main_~n~0) 1 0) 0)) (not (= (ite (<= main_~j~0 main_~n~0) 1 0) 0)) .cse1 (<= main_~l~0 1) (<= 2 main_~r~0) (<= (+ main_~i~0 1) main_~n~0) (<= (+ main_~r~0 2) (* 2 main_~j~0))) (and .cse0 .cse1 .cse2 (<= (+ main_~j~0 1) main_~n~0) (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~i~0_BEFORE_RETURN_5 Int)) (let ((.cse4 (* 2 v_main_~i~0_BEFORE_RETURN_5))) (and (<= .cse4 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse4) (= (ite (<= 1 .cse4) 1 0) (ite (<= 1 main_~j~0) 1 0))))) .cse3))) [2021-05-02 23:32:40,075 INFO L194 CegarLoopUtils]: At program point L44(lines 44 45) the Hoare annotation is: (let ((.cse0 (not (= (ite (<= (+ main_~r~0 1) main_~n~0) 1 0) 0))) (.cse1 (<= main_~l~0 1)) (.cse2 (<= 2 main_~r~0)) (.cse3 (* 2 main_~j~0)) (.cse4 (<= 1 main_~i~0))) (or (and .cse0 .cse1 .cse2 (<= (+ main_~r~0 2) .cse3) (= (* main_~l~0 2) main_~j~0) (= main_~i~0 main_~l~0)) (and .cse0 .cse4 .cse1 .cse2 (<= (+ main_~r~0 4) .cse3) (<= (+ main_~i~0 1) main_~n~0) (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~n~0_BEFORE_CALL_15 Int) (v_main_~i~0_BEFORE_RETURN_5 Int) (v_main_~j~0_BEFORE_CALL_12 Int)) (let ((.cse5 (* 2 v_main_~i~0_BEFORE_RETURN_5)) (.cse6 (ite (<= v_main_~j~0_BEFORE_CALL_12 v_main_~n~0_BEFORE_CALL_15) 1 0))) (and (<= .cse5 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse5) (= (ite (<= 1 .cse5) 1 0) (ite (<= 1 v_main_~j~0_BEFORE_CALL_12) 1 0)) (= .cse6 (ite (<= main_~j~0 main_~n~0) 1 0)) (not (= .cse6 0)))))) (and (= main_~n~0 main_~r~0) .cse4 (<= (* 2 main_~l~0) main_~n~0) (<= (+ main_~j~0 1) main_~n~0) (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~i~0_BEFORE_RETURN_5 Int)) (let ((.cse7 (* 2 v_main_~i~0_BEFORE_RETURN_5))) (and (<= .cse7 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse7) (= (ite (<= 1 .cse7) 1 0) (ite (<= 1 main_~j~0) 1 0))))) (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0))))) [2021-05-02 23:32:40,075 INFO L194 CegarLoopUtils]: At program point L40(line 40) the Hoare annotation is: (let ((.cse0 (<= 1 main_~i~0)) (.cse1 (<= main_~l~0 1)) (.cse2 (* 2 main_~j~0))) (or (and (not (= (ite (<= (+ main_~r~0 1) main_~n~0) 1 0) 0)) .cse0 .cse1 (<= 2 main_~r~0) (<= (+ main_~r~0 4) .cse2) (<= (+ main_~i~0 1) main_~n~0) (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~n~0_BEFORE_CALL_15 Int) (v_main_~i~0_BEFORE_RETURN_5 Int) (v_main_~j~0_BEFORE_CALL_12 Int)) (let ((.cse3 (* 2 v_main_~i~0_BEFORE_RETURN_5)) (.cse4 (ite (<= v_main_~j~0_BEFORE_CALL_12 v_main_~n~0_BEFORE_CALL_15) 1 0))) (and (<= .cse3 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse3) (= (ite (<= 1 .cse3) 1 0) (ite (<= 1 v_main_~j~0_BEFORE_CALL_12) 1 0)) (= .cse4 (ite (<= main_~j~0 main_~n~0) 1 0)) (not (= .cse4 0)))))) (and (= main_~n~0 main_~r~0) (exists ((v_main_~n~0_BEFORE_RETURN_1 Int) (v_main_~l~0_BEFORE_RETURN_1 Int) (v_main_~r~0_BEFORE_RETURN_2 Int)) (let ((.cse5 (* 2 v_main_~l~0_BEFORE_RETURN_1))) (and (<= v_main_~r~0_BEFORE_RETURN_2 .cse5) (<= .cse5 v_main_~r~0_BEFORE_RETURN_2) (<= .cse5 v_main_~n~0_BEFORE_RETURN_1) (< 1 v_main_~r~0_BEFORE_RETURN_2) (= (ite (<= 1 .cse5) 1 0) (ite (<= 1 main_~j~0) 1 0))))) .cse0 (<= (* 2 main_~l~0) main_~n~0) (<= (+ main_~j~0 1) main_~n~0) (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0))) (and (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~n~0_BEFORE_CALL_15 Int) (v_main_~i~0_BEFORE_RETURN_5 Int) (v_main_~j~0_BEFORE_CALL_12 Int)) (let ((.cse6 (* 2 v_main_~i~0_BEFORE_RETURN_5)) (.cse7 (ite (<= v_main_~j~0_BEFORE_CALL_12 v_main_~n~0_BEFORE_CALL_15) 1 0))) (and (<= .cse6 v_main_~r~0_BEFORE_RETURN_5) (= (ite (<= (+ main_~r~0 1) main_~n~0) 1 0) .cse7) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse6) (= (ite (<= 1 .cse6) 1 0) (ite (<= 1 v_main_~j~0_BEFORE_CALL_12) 1 0)) (not (= .cse7 0))))) .cse1 (<= (+ main_~r~0 2) .cse2) (= (* main_~l~0 2) main_~j~0) (< 1 main_~r~0) (= main_~i~0 main_~l~0)))) [2021-05-02 23:32:40,075 INFO L194 CegarLoopUtils]: At program point L40-1(line 40) the Hoare annotation is: (let ((.cse0 (not (= (ite (<= (+ main_~r~0 1) main_~n~0) 1 0) 0))) (.cse1 (<= main_~l~0 1)) (.cse2 (<= 2 main_~r~0)) (.cse3 (* 2 main_~j~0)) (.cse4 (<= 1 main_~i~0))) (or (and .cse0 .cse1 .cse2 (<= (+ main_~r~0 2) .cse3) (= (* main_~l~0 2) main_~j~0) (= main_~i~0 main_~l~0)) (and .cse0 .cse4 .cse1 .cse2 (<= (+ main_~r~0 4) .cse3) (<= (+ main_~i~0 1) main_~n~0) (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~n~0_BEFORE_CALL_15 Int) (v_main_~i~0_BEFORE_RETURN_5 Int) (v_main_~j~0_BEFORE_CALL_12 Int)) (let ((.cse5 (* 2 v_main_~i~0_BEFORE_RETURN_5)) (.cse6 (ite (<= v_main_~j~0_BEFORE_CALL_12 v_main_~n~0_BEFORE_CALL_15) 1 0))) (and (<= .cse5 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse5) (= (ite (<= 1 .cse5) 1 0) (ite (<= 1 v_main_~j~0_BEFORE_CALL_12) 1 0)) (= .cse6 (ite (<= main_~j~0 main_~n~0) 1 0)) (not (= .cse6 0)))))) (and (= main_~n~0 main_~r~0) (exists ((v_main_~n~0_BEFORE_RETURN_1 Int) (v_main_~l~0_BEFORE_RETURN_1 Int) (v_main_~r~0_BEFORE_RETURN_2 Int)) (let ((.cse7 (* 2 v_main_~l~0_BEFORE_RETURN_1))) (and (<= v_main_~r~0_BEFORE_RETURN_2 .cse7) (<= .cse7 v_main_~r~0_BEFORE_RETURN_2) (<= .cse7 v_main_~n~0_BEFORE_RETURN_1) (< 1 v_main_~r~0_BEFORE_RETURN_2) (= (ite (<= 1 .cse7) 1 0) (ite (<= 1 main_~j~0) 1 0))))) .cse4 (<= (* 2 main_~l~0) main_~n~0) (<= (+ main_~j~0 1) main_~n~0) (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0))))) [2021-05-02 23:32:40,075 INFO L194 CegarLoopUtils]: At program point L65(line 65) the Hoare annotation is: (and (<= 1 main_~j~0) (<= 1 main_~i~0) (<= 2 main_~r~0) (<= main_~l~0 1) (<= main_~r~0 main_~n~0)) [2021-05-02 23:32:40,075 INFO L194 CegarLoopUtils]: At program point L61(line 61) the Hoare annotation is: (and (<= 1 main_~j~0) (= main_~n~0 main_~r~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= (* 2 main_~l~0) main_~n~0) (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0))) [2021-05-02 23:32:40,076 INFO L194 CegarLoopUtils]: At program point L53(line 53) the Hoare annotation is: (let ((.cse0 (<= 1 main_~i~0)) (.cse2 (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~n~0_BEFORE_CALL_15 Int) (v_main_~i~0_BEFORE_RETURN_5 Int) (v_main_~j~0_BEFORE_CALL_12 Int)) (let ((.cse3 (* 2 v_main_~i~0_BEFORE_RETURN_5)) (.cse4 (ite (<= v_main_~j~0_BEFORE_CALL_12 v_main_~n~0_BEFORE_CALL_15) 1 0))) (and (<= .cse3 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse3) (= (ite (<= 1 .cse3) 1 0) (ite (<= 1 v_main_~j~0_BEFORE_CALL_12) 1 0)) (= .cse4 (ite (<= main_~j~0 main_~n~0) 1 0)) (not (= .cse4 0))))))) (or (and (= main_~n~0 main_~r~0) .cse0 (<= (* 2 main_~l~0) main_~n~0) (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~i~0_BEFORE_RETURN_5 Int)) (let ((.cse1 (* 2 v_main_~i~0_BEFORE_RETURN_5))) (and (<= .cse1 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse1) (= (ite (<= 1 .cse1) 1 0) (ite (<= 1 main_~j~0) 1 0))))) (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0)) .cse2) (and (not (= (ite (<= (+ main_~r~0 1) main_~n~0) 1 0) 0)) .cse0 (<= 2 main_~r~0) (<= main_~l~0 1) (<= (+ main_~r~0 2) (* 2 main_~j~0)) .cse2))) [2021-05-02 23:32:40,076 INFO L194 CegarLoopUtils]: At program point L49(lines 49 51) the Hoare annotation is: (let ((.cse0 (<= 1 main_~i~0)) (.cse1 (<= 0 (+ |main_#t~nondet7| 2147483648))) (.cse3 (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~n~0_BEFORE_CALL_15 Int) (v_main_~i~0_BEFORE_RETURN_5 Int) (v_main_~j~0_BEFORE_CALL_12 Int)) (let ((.cse5 (* 2 v_main_~i~0_BEFORE_RETURN_5)) (.cse6 (ite (<= v_main_~j~0_BEFORE_CALL_12 v_main_~n~0_BEFORE_CALL_15) 1 0))) (and (<= .cse5 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse5) (= (ite (<= 1 .cse5) 1 0) (ite (<= 1 v_main_~j~0_BEFORE_CALL_12) 1 0)) (= .cse6 (ite (<= main_~j~0 main_~n~0) 1 0)) (not (= .cse6 0)))))) (.cse4 (<= |main_#t~nondet7| 2147483647))) (or (and (= main_~n~0 main_~r~0) .cse0 .cse1 (<= (* 2 main_~l~0) main_~n~0) (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~i~0_BEFORE_RETURN_5 Int)) (let ((.cse2 (* 2 v_main_~i~0_BEFORE_RETURN_5))) (and (<= .cse2 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse2) (= (ite (<= 1 .cse2) 1 0) (ite (<= 1 main_~j~0) 1 0))))) (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0)) .cse3 .cse4) (and (not (= (ite (<= (+ main_~r~0 1) main_~n~0) 1 0) 0)) .cse0 (<= main_~l~0 1) .cse1 (<= 2 main_~r~0) (<= (+ main_~i~0 1) main_~n~0) (<= (+ main_~r~0 2) (* 2 main_~j~0)) .cse3 .cse4))) [2021-05-02 23:32:40,076 INFO L194 CegarLoopUtils]: At program point L41(line 41) the Hoare annotation is: (let ((.cse0 (not (= (ite (<= (+ main_~r~0 1) main_~n~0) 1 0) 0))) (.cse1 (<= main_~l~0 1)) (.cse2 (<= 2 main_~r~0)) (.cse3 (* 2 main_~j~0)) (.cse4 (<= 1 main_~i~0))) (or (and .cse0 .cse1 .cse2 (<= (+ main_~r~0 2) .cse3) (= (* main_~l~0 2) main_~j~0) (= main_~i~0 main_~l~0)) (and .cse0 .cse4 .cse1 .cse2 (<= (+ main_~r~0 4) .cse3) (<= (+ main_~i~0 1) main_~n~0) (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~n~0_BEFORE_CALL_15 Int) (v_main_~i~0_BEFORE_RETURN_5 Int) (v_main_~j~0_BEFORE_CALL_12 Int)) (let ((.cse5 (* 2 v_main_~i~0_BEFORE_RETURN_5)) (.cse6 (ite (<= v_main_~j~0_BEFORE_CALL_12 v_main_~n~0_BEFORE_CALL_15) 1 0))) (and (<= .cse5 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse5) (= (ite (<= 1 .cse5) 1 0) (ite (<= 1 v_main_~j~0_BEFORE_CALL_12) 1 0)) (= .cse6 (ite (<= main_~j~0 main_~n~0) 1 0)) (not (= .cse6 0)))))) (and (= main_~n~0 main_~r~0) .cse4 (<= (* 2 main_~l~0) main_~n~0) (<= (+ main_~j~0 1) main_~n~0) (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~i~0_BEFORE_RETURN_5 Int)) (let ((.cse7 (* 2 v_main_~i~0_BEFORE_RETURN_5))) (and (<= .cse7 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse7) (= (ite (<= 1 .cse7) 1 0) (ite (<= 1 main_~j~0) 1 0))))) (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0))))) [2021-05-02 23:32:40,076 INFO L194 CegarLoopUtils]: At program point L54(line 54) the Hoare annotation is: (let ((.cse0 (<= 1 main_~i~0)) (.cse2 (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~n~0_BEFORE_CALL_15 Int) (v_main_~i~0_BEFORE_RETURN_5 Int) (v_main_~j~0_BEFORE_CALL_12 Int)) (let ((.cse3 (* 2 v_main_~i~0_BEFORE_RETURN_5)) (.cse4 (ite (<= v_main_~j~0_BEFORE_CALL_12 v_main_~n~0_BEFORE_CALL_15) 1 0))) (and (<= .cse3 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse3) (= (ite (<= 1 .cse3) 1 0) (ite (<= 1 v_main_~j~0_BEFORE_CALL_12) 1 0)) (= .cse4 (ite (<= main_~j~0 main_~n~0) 1 0)) (not (= .cse4 0))))))) (or (and (= main_~n~0 main_~r~0) .cse0 (<= (* 2 main_~l~0) main_~n~0) (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~i~0_BEFORE_RETURN_5 Int)) (let ((.cse1 (* 2 v_main_~i~0_BEFORE_RETURN_5))) (and (<= .cse1 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse1) (= (ite (<= 1 .cse1) 1 0) (ite (<= 1 main_~j~0) 1 0))))) (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0)) .cse2) (and (not (= (ite (<= (+ main_~r~0 1) main_~n~0) 1 0) 0)) .cse0 (<= 2 main_~r~0) (<= main_~l~0 1) (<= (+ main_~r~0 2) (* 2 main_~j~0)) .cse2))) [2021-05-02 23:32:40,076 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 24 70) the Hoare annotation is: true [2021-05-02 23:32:40,077 INFO L194 CegarLoopUtils]: At program point L42(line 42) the Hoare annotation is: (let ((.cse0 (not (= (ite (<= (+ main_~r~0 1) main_~n~0) 1 0) 0))) (.cse1 (<= main_~l~0 1)) (.cse2 (<= 2 main_~r~0)) (.cse3 (* 2 main_~j~0)) (.cse4 (<= 1 main_~i~0))) (or (and .cse0 .cse1 .cse2 (<= (+ main_~r~0 2) .cse3) (= (* main_~l~0 2) main_~j~0) (= main_~i~0 main_~l~0)) (and .cse0 .cse4 .cse1 .cse2 (<= (+ main_~r~0 4) .cse3) (<= (+ main_~i~0 1) main_~n~0) (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~n~0_BEFORE_CALL_15 Int) (v_main_~i~0_BEFORE_RETURN_5 Int) (v_main_~j~0_BEFORE_CALL_12 Int)) (let ((.cse5 (* 2 v_main_~i~0_BEFORE_RETURN_5)) (.cse6 (ite (<= v_main_~j~0_BEFORE_CALL_12 v_main_~n~0_BEFORE_CALL_15) 1 0))) (and (<= .cse5 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse5) (= (ite (<= 1 .cse5) 1 0) (ite (<= 1 v_main_~j~0_BEFORE_CALL_12) 1 0)) (= .cse6 (ite (<= main_~j~0 main_~n~0) 1 0)) (not (= .cse6 0)))))) (and (= main_~n~0 main_~r~0) .cse4 (<= (* 2 main_~l~0) main_~n~0) (<= (+ main_~j~0 1) main_~n~0) (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~i~0_BEFORE_RETURN_5 Int)) (let ((.cse7 (* 2 v_main_~i~0_BEFORE_RETURN_5))) (and (<= .cse7 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse7) (= (ite (<= 1 .cse7) 1 0) (ite (<= 1 main_~j~0) 1 0))))) (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0))))) [2021-05-02 23:32:40,077 INFO L194 CegarLoopUtils]: At program point L38-2(lines 38 58) the Hoare annotation is: (let ((.cse0 (not (= (ite (<= (+ main_~r~0 1) main_~n~0) 1 0) 0))) (.cse1 (<= 1 main_~i~0)) (.cse2 (<= main_~l~0 1)) (.cse3 (<= 2 main_~r~0)) (.cse5 (+ main_~r~0 2)) (.cse4 (* 2 main_~j~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= (+ main_~r~0 4) .cse4) (<= (+ main_~i~0 1) main_~n~0)) (and .cse0 (<= .cse5 main_~j~0) .cse1 .cse2 .cse3) (and (= main_~n~0 main_~r~0) .cse1 (<= (* 2 main_~l~0) main_~n~0) .cse3 (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~i~0_BEFORE_RETURN_5 Int)) (let ((.cse6 (* 2 v_main_~i~0_BEFORE_RETURN_5))) (and (<= .cse6 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse6) (= (ite (<= 1 .cse6) 1 0) (ite (<= 1 main_~j~0) 1 0))))) (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0))) (and .cse2 .cse3 (not (= (ite (<= (+ main_~l~0 1) main_~n~0) 1 0) 0)) (<= .cse5 .cse4) (= (* main_~l~0 2) main_~j~0) (= main_~i~0 main_~l~0)))) [2021-05-02 23:32:40,077 INFO L194 CegarLoopUtils]: At program point L38-3(lines 35 68) the Hoare annotation is: (let ((.cse0 (<= 1 main_~i~0)) (.cse1 (<= 2 main_~r~0))) (or (and (not (= (ite (<= (+ main_~r~0 1) main_~n~0) 1 0) 0)) .cse0 (<= main_~l~0 1) .cse1 (<= (+ main_~r~0 2) (* 2 main_~j~0))) (and (= main_~n~0 main_~r~0) (<= 1 main_~j~0) .cse0 (<= (* 2 main_~l~0) main_~n~0) .cse1 (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0))))) [2021-05-02 23:32:40,077 INFO L194 CegarLoopUtils]: At program point L30(lines 30 34) the Hoare annotation is: (let ((.cse0 (* 2 main_~l~0))) (and (= main_~n~0 main_~r~0) (<= (+ main_~n~0 1) .cse0) (<= .cse0 (+ main_~n~0 2)) (<= main_~l~0 main_~n~0))) [2021-05-02 23:32:40,077 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 24 70) the Hoare annotation is: true [2021-05-02 23:32:40,077 INFO L194 CegarLoopUtils]: At program point L59-1(lines 24 70) the Hoare annotation is: (let ((.cse6 (* 2 main_~l~0))) (let ((.cse0 (= main_~n~0 main_~r~0)) (.cse3 (<= .cse6 main_~n~0)) (.cse4 (+ main_~r~0 1)) (.cse2 (<= 1 main_~i~0)) (.cse5 (<= main_~l~0 1))) (or (and .cse0 (exists ((v_main_~r~0_BEFORE_RETURN_4 Int) (v_main_~i~0_BEFORE_RETURN_4 Int) (v_main_~n~0_BEFORE_RETURN_4 Int)) (let ((.cse1 (* 2 v_main_~i~0_BEFORE_RETURN_4))) (and (= (ite (<= 1 main_~j~0) 1 0) (ite (<= 1 .cse1) 1 0)) (<= .cse1 v_main_~r~0_BEFORE_RETURN_4) (< 1 v_main_~r~0_BEFORE_RETURN_4) (<= v_main_~r~0_BEFORE_RETURN_4 .cse1) (<= (+ v_main_~i~0_BEFORE_RETURN_4 1) v_main_~n~0_BEFORE_RETURN_4)))) .cse2 .cse3 (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0)) (<= 2 main_~n~0)) (and (<= 1 main_~l~0) (= .cse4 main_~n~0) .cse5 (<= main_~n~0 1)) (and .cse0 .cse3 (<= main_~n~0 (+ .cse6 1)) (<= (+ main_~n~0 1) (* 4 main_~l~0))) (and (not (= (ite (<= .cse4 main_~n~0) 1 0) 0)) (exists ((v_main_~n~0_BEFORE_RETURN_1 Int) (v_main_~l~0_BEFORE_RETURN_1 Int) (v_main_~r~0_BEFORE_RETURN_2 Int)) (let ((.cse7 (* 2 v_main_~l~0_BEFORE_RETURN_1))) (and (<= v_main_~r~0_BEFORE_RETURN_2 .cse7) (<= .cse7 v_main_~r~0_BEFORE_RETURN_2) (<= .cse7 v_main_~n~0_BEFORE_RETURN_1) (< 1 v_main_~r~0_BEFORE_RETURN_2) (= (ite (<= 1 .cse7) 1 0) (ite (<= 1 main_~j~0) 1 0))))) .cse2 .cse5 (exists ((v_main_~n~0_BEFORE_CALL_1 Int) (v_main_~l~0_BEFORE_CALL_2 Int)) (let ((.cse8 (ite (<= v_main_~l~0_BEFORE_CALL_2 v_main_~n~0_BEFORE_CALL_1) 1 0))) (and (= (ite (<= (+ main_~l~0 1) main_~n~0) 1 0) .cse8) (not (= 0 .cse8)) (<= 1 v_main_~l~0_BEFORE_CALL_2)))))))) [2021-05-02 23:32:40,078 INFO L194 CegarLoopUtils]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 (<= 1 main_~i~0)) (.cse1 (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~n~0_BEFORE_CALL_15 Int) (v_main_~i~0_BEFORE_RETURN_5 Int) (v_main_~j~0_BEFORE_CALL_12 Int)) (let ((.cse2 (* 2 v_main_~i~0_BEFORE_RETURN_5)) (.cse3 (ite (<= v_main_~j~0_BEFORE_CALL_12 v_main_~n~0_BEFORE_CALL_15) 1 0))) (and (<= .cse2 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse2) (= (ite (<= 1 .cse2) 1 0) (ite (<= 1 v_main_~j~0_BEFORE_CALL_12) 1 0)) (= .cse3 (ite (<= main_~j~0 main_~n~0) 1 0)) (not (= .cse3 0))))))) (or (and (= main_~n~0 main_~r~0) (<= 1 main_~j~0) .cse0 (<= (* 2 main_~l~0) main_~n~0) (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0)) .cse1) (and (not (= (ite (<= (+ main_~r~0 1) main_~n~0) 1 0) 0)) .cse0 (<= main_~l~0 1) (<= 2 main_~r~0) (<= (+ main_~r~0 2) (* 2 main_~j~0)) .cse1))) [2021-05-02 23:32:40,078 INFO L194 CegarLoopUtils]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 (<= 1 main_~i~0))) (or (and (= main_~n~0 main_~r~0) .cse0 (<= (* 2 main_~l~0) main_~n~0) (<= main_~j~0 main_~n~0) (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~i~0_BEFORE_RETURN_5 Int)) (let ((.cse1 (* 2 v_main_~i~0_BEFORE_RETURN_5))) (and (<= .cse1 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse1) (= (ite (<= 1 .cse1) 1 0) (ite (<= 1 main_~j~0) 1 0))))) (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0))) (and (not (= (ite (<= (+ main_~r~0 1) main_~n~0) 1 0) 0)) .cse0 (<= main_~l~0 1) (<= 2 main_~r~0) (<= (+ main_~i~0 1) main_~n~0) (<= (+ main_~r~0 2) (* 2 main_~j~0))))) [2021-05-02 23:32:40,078 INFO L194 CegarLoopUtils]: At program point L43(line 43) the Hoare annotation is: (let ((.cse0 (not (= (ite (<= (+ main_~r~0 1) main_~n~0) 1 0) 0))) (.cse1 (<= main_~l~0 1)) (.cse2 (<= 2 main_~r~0)) (.cse3 (* 2 main_~j~0)) (.cse4 (<= 1 main_~i~0))) (or (and .cse0 .cse1 .cse2 (<= (+ main_~r~0 2) .cse3) (= (* main_~l~0 2) main_~j~0) (= main_~i~0 main_~l~0)) (and .cse0 .cse4 .cse1 .cse2 (<= (+ main_~r~0 4) .cse3) (<= (+ main_~i~0 1) main_~n~0) (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~n~0_BEFORE_CALL_15 Int) (v_main_~i~0_BEFORE_RETURN_5 Int) (v_main_~j~0_BEFORE_CALL_12 Int)) (let ((.cse5 (* 2 v_main_~i~0_BEFORE_RETURN_5)) (.cse6 (ite (<= v_main_~j~0_BEFORE_CALL_12 v_main_~n~0_BEFORE_CALL_15) 1 0))) (and (<= .cse5 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse5) (= (ite (<= 1 .cse5) 1 0) (ite (<= 1 v_main_~j~0_BEFORE_CALL_12) 1 0)) (= .cse6 (ite (<= main_~j~0 main_~n~0) 1 0)) (not (= .cse6 0)))))) (and (= main_~n~0 main_~r~0) .cse4 (<= (* 2 main_~l~0) main_~n~0) (<= (+ main_~j~0 1) main_~n~0) (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~i~0_BEFORE_RETURN_5 Int)) (let ((.cse7 (* 2 v_main_~i~0_BEFORE_RETURN_5))) (and (<= .cse7 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse7) (= (ite (<= 1 .cse7) 1 0) (ite (<= 1 main_~j~0) 1 0))))) (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0))))) [2021-05-02 23:32:40,078 INFO L194 CegarLoopUtils]: At program point L39(lines 39 46) the Hoare annotation is: (let ((.cse0 (<= 1 main_~i~0)) (.cse1 (<= main_~l~0 1)) (.cse2 (* 2 main_~j~0)) (.cse3 (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~n~0_BEFORE_CALL_15 Int) (v_main_~i~0_BEFORE_RETURN_5 Int) (v_main_~j~0_BEFORE_CALL_12 Int)) (let ((.cse5 (* 2 v_main_~i~0_BEFORE_RETURN_5)) (.cse6 (ite (<= v_main_~j~0_BEFORE_CALL_12 v_main_~n~0_BEFORE_CALL_15) 1 0))) (and (<= .cse5 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse5) (= (ite (<= 1 .cse5) 1 0) (ite (<= 1 v_main_~j~0_BEFORE_CALL_12) 1 0)) (= .cse6 (ite (<= main_~j~0 main_~n~0) 1 0)) (not (= .cse6 0))))))) (or (and (not (= (ite (<= (+ main_~r~0 1) main_~n~0) 1 0) 0)) .cse0 .cse1 (<= 2 main_~r~0) (<= (+ main_~r~0 4) .cse2) (<= (+ main_~i~0 1) main_~n~0) .cse3) (and (= main_~n~0 main_~r~0) .cse0 (<= (* 2 main_~l~0) main_~n~0) (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~i~0_BEFORE_RETURN_5 Int)) (let ((.cse4 (* 2 v_main_~i~0_BEFORE_RETURN_5))) (and (<= .cse4 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse4) (= (ite (<= 1 .cse4) 1 0) (ite (<= 1 main_~j~0) 1 0))))) (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0)) .cse3) (and .cse1 (<= (+ main_~r~0 2) .cse2) (= (* main_~l~0 2) main_~j~0) .cse3 (< 1 main_~r~0) (= main_~i~0 main_~l~0)))) [2021-05-02 23:32:40,078 INFO L194 CegarLoopUtils]: At program point L39-1(lines 39 46) the Hoare annotation is: (let ((.cse0 (<= main_~l~0 1)) (.cse1 (<= 2 main_~r~0)) (.cse2 (* 2 main_~j~0)) (.cse5 (<= 1 main_~i~0))) (or (and .cse0 .cse1 (<= (+ main_~r~0 2) .cse2) (= (* main_~l~0 2) main_~j~0) (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~n~0_BEFORE_CALL_15 Int) (v_main_~i~0_BEFORE_RETURN_5 Int) (v_main_~j~0_BEFORE_CALL_12 Int)) (let ((.cse3 (* 2 v_main_~i~0_BEFORE_RETURN_5)) (.cse4 (ite (<= v_main_~j~0_BEFORE_CALL_12 v_main_~n~0_BEFORE_CALL_15) 1 0))) (and (<= .cse3 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse3) (= (ite (<= 1 .cse3) 1 0) (ite (<= 1 v_main_~j~0_BEFORE_CALL_12) 1 0)) (= .cse4 (ite (<= main_~j~0 main_~n~0) 1 0)) (not (= .cse4 0))))) (= main_~i~0 main_~l~0)) (and (not (= (ite (<= (+ main_~r~0 1) main_~n~0) 1 0) 0)) .cse5 .cse0 .cse1 (<= (+ main_~r~0 4) .cse2) (<= (+ main_~i~0 1) main_~n~0)) (and (= main_~n~0 main_~r~0) .cse5 (<= (* 2 main_~l~0) main_~n~0) (<= main_~j~0 main_~n~0) (exists ((v_main_~r~0_BEFORE_RETURN_5 Int) (v_main_~i~0_BEFORE_RETURN_5 Int)) (let ((.cse6 (* 2 v_main_~i~0_BEFORE_RETURN_5))) (and (<= .cse6 v_main_~r~0_BEFORE_RETURN_5) (<= (+ v_main_~r~0_BEFORE_RETURN_5 1) (* 4 v_main_~i~0_BEFORE_RETURN_5)) (<= v_main_~r~0_BEFORE_RETURN_5 .cse6) (= (ite (<= 1 .cse6) 1 0) (ite (<= 1 main_~j~0) 1 0))))) (<= (+ (* 2 main_~i~0) 2) (+ main_~j~0 main_~n~0))))) [2021-05-02 23:32:40,078 INFO L201 CegarLoopUtils]: At program point L35-1(lines 35 68) the Hoare annotation is: true [2021-05-02 23:32:40,079 INFO L194 CegarLoopUtils]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (= __VERIFIER_assert_~cond 0))) (forall ((v_main_~n~0_BEFORE_CALL_11 Int) (v_main_~j~0_BEFORE_CALL_9 Int)) (or (forall ((v_main_~r~0_BEFORE_RETURN_4 Int) (v_main_~i~0_BEFORE_RETURN_4 Int) (v_main_~n~0_BEFORE_RETURN_4 Int)) (let ((.cse0 (* 2 v_main_~i~0_BEFORE_RETURN_4))) (or (not (<= .cse0 v_main_~r~0_BEFORE_RETURN_4)) (not (<= v_main_~r~0_BEFORE_RETURN_4 .cse0)) (not (= (ite (<= 1 v_main_~j~0_BEFORE_CALL_9) 1 0) (ite (<= 1 .cse0) 1 0))) (not (<= (+ v_main_~i~0_BEFORE_RETURN_4 1) v_main_~n~0_BEFORE_RETURN_4)) (not (< 1 v_main_~r~0_BEFORE_RETURN_4))))) (not (= (ite (<= v_main_~j~0_BEFORE_CALL_9 v_main_~n~0_BEFORE_CALL_11) 1 0) |__VERIFIER_assert_#in~cond|))))) [2021-05-02 23:32:40,079 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2021-05-02 23:32:40,079 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (= __VERIFIER_assert_~cond 0))) (forall ((v_main_~n~0_BEFORE_CALL_11 Int) (v_main_~j~0_BEFORE_CALL_9 Int)) (or (forall ((v_main_~r~0_BEFORE_RETURN_4 Int) (v_main_~i~0_BEFORE_RETURN_4 Int) (v_main_~n~0_BEFORE_RETURN_4 Int)) (let ((.cse0 (* 2 v_main_~i~0_BEFORE_RETURN_4))) (or (not (<= .cse0 v_main_~r~0_BEFORE_RETURN_4)) (not (<= v_main_~r~0_BEFORE_RETURN_4 .cse0)) (not (= (ite (<= 1 v_main_~j~0_BEFORE_CALL_9) 1 0) (ite (<= 1 .cse0) 1 0))) (not (<= (+ v_main_~i~0_BEFORE_RETURN_4 1) v_main_~n~0_BEFORE_RETURN_4)) (not (< 1 v_main_~r~0_BEFORE_RETURN_4))))) (not (= (ite (<= v_main_~j~0_BEFORE_CALL_9 v_main_~n~0_BEFORE_CALL_11) 1 0) |__VERIFIER_assert_#in~cond|))))) [2021-05-02 23:32:40,079 INFO L194 CegarLoopUtils]: At program point L19(line 19) the Hoare annotation is: (or (and (= __VERIFIER_assert_~cond 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (forall ((v_main_~n~0_BEFORE_CALL_11 Int) (v_main_~j~0_BEFORE_CALL_9 Int)) (or (forall ((v_main_~r~0_BEFORE_RETURN_4 Int) (v_main_~i~0_BEFORE_RETURN_4 Int) (v_main_~n~0_BEFORE_RETURN_4 Int)) (let ((.cse0 (* 2 v_main_~i~0_BEFORE_RETURN_4))) (or (not (<= .cse0 v_main_~r~0_BEFORE_RETURN_4)) (not (<= v_main_~r~0_BEFORE_RETURN_4 .cse0)) (not (= (ite (<= 1 v_main_~j~0_BEFORE_CALL_9) 1 0) (ite (<= 1 .cse0) 1 0))) (not (<= (+ v_main_~i~0_BEFORE_RETURN_4 1) v_main_~n~0_BEFORE_RETURN_4)) (not (< 1 v_main_~r~0_BEFORE_RETURN_4))))) (not (= (ite (<= v_main_~j~0_BEFORE_CALL_9 v_main_~n~0_BEFORE_CALL_11) 1 0) |__VERIFIER_assert_#in~cond|))))) [2021-05-02 23:32:40,079 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (forall ((v_main_~n~0_BEFORE_CALL_11 Int) (v_main_~j~0_BEFORE_CALL_9 Int)) (or (forall ((v_main_~r~0_BEFORE_RETURN_4 Int) (v_main_~i~0_BEFORE_RETURN_4 Int) (v_main_~n~0_BEFORE_RETURN_4 Int)) (let ((.cse0 (* 2 v_main_~i~0_BEFORE_RETURN_4))) (or (not (<= .cse0 v_main_~r~0_BEFORE_RETURN_4)) (not (<= v_main_~r~0_BEFORE_RETURN_4 .cse0)) (not (= (ite (<= 1 v_main_~j~0_BEFORE_CALL_9) 1 0) (ite (<= 1 .cse0) 1 0))) (not (<= (+ v_main_~i~0_BEFORE_RETURN_4 1) v_main_~n~0_BEFORE_RETURN_4)) (not (< 1 v_main_~r~0_BEFORE_RETURN_4))))) (not (= (ite (<= v_main_~j~0_BEFORE_CALL_9 v_main_~n~0_BEFORE_CALL_11) 1 0) |__VERIFIER_assert_#in~cond|)))) [2021-05-02 23:32:40,079 INFO L194 CegarLoopUtils]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (forall ((v_main_~n~0_BEFORE_CALL_11 Int) (v_main_~j~0_BEFORE_CALL_9 Int)) (or (forall ((v_main_~r~0_BEFORE_RETURN_4 Int) (v_main_~i~0_BEFORE_RETURN_4 Int) (v_main_~n~0_BEFORE_RETURN_4 Int)) (let ((.cse0 (* 2 v_main_~i~0_BEFORE_RETURN_4))) (or (not (<= .cse0 v_main_~r~0_BEFORE_RETURN_4)) (not (<= v_main_~r~0_BEFORE_RETURN_4 .cse0)) (not (= (ite (<= 1 v_main_~j~0_BEFORE_CALL_9) 1 0) (ite (<= 1 .cse0) 1 0))) (not (<= (+ v_main_~i~0_BEFORE_RETURN_4 1) v_main_~n~0_BEFORE_RETURN_4)) (not (< 1 v_main_~r~0_BEFORE_RETURN_4))))) (not (= (ite (<= v_main_~j~0_BEFORE_CALL_9 v_main_~n~0_BEFORE_CALL_11) 1 0) |__VERIFIER_assert_#in~cond|))))) [2021-05-02 23:32:40,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,102 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,103 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,103 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,103 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,103 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,104 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,104 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,104 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,105 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,105 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_CALL_9,QUANTIFIED] [2021-05-02 23:32:40,105 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,105 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,105 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~n~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,105 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,105 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_CALL_9,QUANTIFIED] [2021-05-02 23:32:40,105 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~n~0_BEFORE_CALL_11,QUANTIFIED] [2021-05-02 23:32:40,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 11:32:40 BoogieIcfgContainer [2021-05-02 23:32:40,106 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 23:32:40,106 INFO L168 Benchmark]: Toolchain (without parser) took 94232.99 ms. Allocated memory was 182.5 MB in the beginning and 733.0 MB in the end (delta: 550.5 MB). Free memory was 147.6 MB in the beginning and 493.4 MB in the end (delta: -345.8 MB). Peak memory consumption was 440.5 MB. Max. memory is 8.0 GB. [2021-05-02 23:32:40,106 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 182.5 MB. Free memory is still 164.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 23:32:40,106 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.98 ms. Allocated memory is still 182.5 MB. Free memory was 147.4 MB in the beginning and 165.6 MB in the end (delta: -18.2 MB). Peak memory consumption was 11.7 MB. Max. memory is 8.0 GB. [2021-05-02 23:32:40,106 INFO L168 Benchmark]: Boogie Preprocessor took 45.10 ms. Allocated memory is still 182.5 MB. Free memory was 165.6 MB in the beginning and 164.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-02 23:32:40,107 INFO L168 Benchmark]: RCFGBuilder took 468.01 ms. Allocated memory is still 182.5 MB. Free memory was 163.5 MB in the beginning and 145.1 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. [2021-05-02 23:32:40,107 INFO L168 Benchmark]: TraceAbstraction took 93459.21 ms. Allocated memory was 182.5 MB in the beginning and 733.0 MB in the end (delta: 550.5 MB). Free memory was 145.1 MB in the beginning and 493.4 MB in the end (delta: -348.2 MB). Peak memory consumption was 438.2 MB. Max. memory is 8.0 GB. [2021-05-02 23:32:40,107 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.12 ms. Allocated memory is still 182.5 MB. Free memory is still 164.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 250.98 ms. Allocated memory is still 182.5 MB. Free memory was 147.4 MB in the beginning and 165.6 MB in the end (delta: -18.2 MB). Peak memory consumption was 11.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 45.10 ms. Allocated memory is still 182.5 MB. Free memory was 165.6 MB in the beginning and 164.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 468.01 ms. Allocated memory is still 182.5 MB. Free memory was 163.5 MB in the beginning and 145.1 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 93459.21 ms. Allocated memory was 182.5 MB in the beginning and 733.0 MB in the end (delta: 550.5 MB). Free memory was 145.1 MB in the beginning and 493.4 MB in the end (delta: -348.2 MB). Peak memory consumption was 438.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_CALL_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~n~0_BEFORE_RETURN_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_CALL_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~n~0_BEFORE_CALL_11,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: 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 6 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 53013.6ms, OverallIterations: 21, TraceHistogramMax: 18, EmptinessCheckTime: 37.8ms, AutomataDifference: 31232.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 40347.5ms, InitialAbstractionConstructionTime: 8.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 929 SDtfs, 2101 SDslu, 2763 SDs, 0 SdLazy, 10738 SolverSat, 5843 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 13498.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 807 GetRequests, 292 SyntacticMatches, 39 SemanticMatches, 476 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7035 ImplicationChecksByTransitivity, 29725.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=487occurred in iteration=15, InterpolantAutomatonStates: 337, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1481.9ms AutomataMinimizationTime, 21 MinimizatonAttempts, 1251 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 44 LocationsWithAnnotation, 5108 PreInvPairs, 5948 NumberOfFragments, 4051 HoareAnnotationTreeSize, 5108 FomulaSimplifications, 34713494572 FormulaSimplificationTreeSizeReduction, 7720.8ms HoareSimplificationTime, 44 FomulaSimplificationsInter, 2371042281 FormulaSimplificationTreeSizeReductionInter, 32381.3ms 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: 38]: Loop Invariant [2021-05-02 23:32:40,109 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,109 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,109 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,109 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] [2021-05-02 23:32:40,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_5,QUANTIFIED] Derived loop invariant: (((((((!((if r + 1 <= n then 1 else 0) == 0) && 1 <= i) && l <= 1) && 2 <= r) && r + 4 <= 2 * j) && i + 1 <= n) || ((((!((if r + 1 <= n then 1 else 0) == 0) && r + 2 <= j) && 1 <= i) && l <= 1) && 2 <= r)) || (((((n == r && 1 <= i) && 2 * l <= n) && 2 <= r) && (\exists v_main_~r~0_BEFORE_RETURN_5 : int, v_main_~i~0_BEFORE_RETURN_5 : int :: ((2 * v_main_~i~0_BEFORE_RETURN_5 <= v_main_~r~0_BEFORE_RETURN_5 && v_main_~r~0_BEFORE_RETURN_5 + 1 <= 4 * v_main_~i~0_BEFORE_RETURN_5) && v_main_~r~0_BEFORE_RETURN_5 <= 2 * v_main_~i~0_BEFORE_RETURN_5) && (if 1 <= 2 * v_main_~i~0_BEFORE_RETURN_5 then 1 else 0) == (if 1 <= j then 1 else 0))) && 2 * i + 2 <= j + n)) || (((((l <= 1 && 2 <= r) && !((if l + 1 <= n then 1 else 0) == 0)) && r + 2 <= 2 * j) && l * 2 == j) && i == l) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert [2021-05-02 23:32:40,115 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,115 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,115 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,115 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,115 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_CALL_9,QUANTIFIED] [2021-05-02 23:32:40,115 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,115 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,116 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~n~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,116 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,116 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_CALL_9,QUANTIFIED] [2021-05-02 23:32:40,116 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~n~0_BEFORE_CALL_11,QUANTIFIED] [2021-05-02 23:32:40,116 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,116 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,116 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,116 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,117 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_CALL_9,QUANTIFIED] [2021-05-02 23:32:40,117 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,117 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,117 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~n~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,117 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~r~0_BEFORE_RETURN_4,QUANTIFIED] [2021-05-02 23:32:40,117 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~j~0_BEFORE_CALL_9,QUANTIFIED] [2021-05-02 23:32:40,117 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~n~0_BEFORE_CALL_11,QUANTIFIED] Derived contract for procedure __VERIFIER_assert: (\old(cond) == cond && !(cond == 0)) || (forall v_main_~n~0_BEFORE_CALL_11 : int, v_main_~j~0_BEFORE_CALL_9 : int :: (forall v_main_~r~0_BEFORE_RETURN_4 : int, v_main_~i~0_BEFORE_RETURN_4 : int, v_main_~n~0_BEFORE_RETURN_4 : int :: (((!(2 * v_main_~i~0_BEFORE_RETURN_4 <= v_main_~r~0_BEFORE_RETURN_4) || !(v_main_~r~0_BEFORE_RETURN_4 <= 2 * v_main_~i~0_BEFORE_RETURN_4)) || !((if 1 <= v_main_~j~0_BEFORE_CALL_9 then 1 else 0) == (if 1 <= 2 * v_main_~i~0_BEFORE_RETURN_4 then 1 else 0))) || !(v_main_~i~0_BEFORE_RETURN_4 + 1 <= v_main_~n~0_BEFORE_RETURN_4)) || !(1 < v_main_~r~0_BEFORE_RETURN_4)) || !((if v_main_~j~0_BEFORE_CALL_9 <= v_main_~n~0_BEFORE_CALL_11 then 1 else 0) == \old(cond))) RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...