/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/loops-crafted-1/nested_delay_notd2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-03 00:16:20,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-03 00:16:20,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-03 00:16:20,911 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-03 00:16:20,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-03 00:16:20,916 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-03 00:16:20,920 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-03 00:16:20,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-03 00:16:20,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-03 00:16:20,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-03 00:16:20,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-03 00:16:20,940 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-03 00:16:20,940 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-03 00:16:20,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-03 00:16:20,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-03 00:16:20,947 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-03 00:16:20,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-03 00:16:20,952 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-03 00:16:20,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-03 00:16:20,962 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-03 00:16:20,964 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-03 00:16:20,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-03 00:16:20,967 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-03 00:16:20,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-03 00:16:20,975 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-03 00:16:20,975 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-03 00:16:20,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-03 00:16:20,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-03 00:16:20,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-03 00:16:20,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-03 00:16:20,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-03 00:16:20,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-03 00:16:20,980 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-03 00:16:20,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-03 00:16:20,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-03 00:16:20,982 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-03 00:16:20,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-03 00:16:20,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-03 00:16:20,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-03 00:16:20,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-03 00:16:20,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-03 00:16:20,990 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-03 00:16:21,016 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-03 00:16:21,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-03 00:16:21,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-03 00:16:21,021 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-03 00:16:21,022 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-03 00:16:21,022 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-03 00:16:21,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-03 00:16:21,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-03 00:16:21,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-03 00:16:21,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-03 00:16:21,023 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-03 00:16:21,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-03 00:16:21,024 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-03 00:16:21,024 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-03 00:16:21,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-03 00:16:21,024 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-03 00:16:21,024 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-03 00:16:21,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-03 00:16:21,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-03 00:16:21,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-03 00:16:21,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-03 00:16:21,025 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-03 00:16:21,025 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-03 00:16:21,025 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-03 00:16:21,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-03 00:16:21,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-03 00:16:21,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-03 00:16:21,404 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-03 00:16:21,405 INFO L275 PluginConnector]: CDTParser initialized [2021-05-03 00:16:21,406 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c [2021-05-03 00:16:21,474 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d1e5b4c4/17ffb913fd52494ca2d6f77dadc5dd83/FLAGd02089b0c [2021-05-03 00:16:22,053 INFO L306 CDTParser]: Found 1 translation units. [2021-05-03 00:16:22,054 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c [2021-05-03 00:16:22,061 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d1e5b4c4/17ffb913fd52494ca2d6f77dadc5dd83/FLAGd02089b0c [2021-05-03 00:16:22,428 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d1e5b4c4/17ffb913fd52494ca2d6f77dadc5dd83 [2021-05-03 00:16:22,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-03 00:16:22,435 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-03 00:16:22,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-03 00:16:22,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-03 00:16:22,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-03 00:16:22,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:16:22" (1/1) ... [2021-05-03 00:16:22,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fbe945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:16:22, skipping insertion in model container [2021-05-03 00:16:22,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:16:22" (1/1) ... [2021-05-03 00:16:22,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-03 00:16:22,472 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-03 00:16:22,651 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c[468,481] [2021-05-03 00:16:22,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:16:22,687 INFO L203 MainTranslator]: Completed pre-run [2021-05-03 00:16:22,701 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c[468,481] [2021-05-03 00:16:22,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:16:22,734 INFO L208 MainTranslator]: Completed translation [2021-05-03 00:16:22,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:16:22 WrapperNode [2021-05-03 00:16:22,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-03 00:16:22,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-03 00:16:22,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-03 00:16:22,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-03 00:16:22,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:16:22" (1/1) ... [2021-05-03 00:16:22,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:16:22" (1/1) ... [2021-05-03 00:16:22,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:16:22" (1/1) ... [2021-05-03 00:16:22,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:16:22" (1/1) ... [2021-05-03 00:16:22,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:16:22" (1/1) ... [2021-05-03 00:16:22,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:16:22" (1/1) ... [2021-05-03 00:16:22,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:16:22" (1/1) ... [2021-05-03 00:16:22,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-03 00:16:22,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-03 00:16:22,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-03 00:16:22,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-03 00:16:22,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:16:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-03 00:16:22,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-03 00:16:22,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-03 00:16:22,916 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-03 00:16:22,916 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-03 00:16:22,916 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-03 00:16:22,916 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-03 00:16:22,916 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-03 00:16:22,917 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-03 00:16:22,917 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-03 00:16:22,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-03 00:16:22,918 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-03 00:16:22,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-03 00:16:22,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-03 00:16:22,918 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-03 00:16:22,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-03 00:16:22,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-03 00:16:22,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-03 00:16:22,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-03 00:16:22,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-03 00:16:22,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-03 00:16:23,258 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-03 00:16:23,258 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-03 00:16:23,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:16:23 BoogieIcfgContainer [2021-05-03 00:16:23,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-03 00:16:23,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-03 00:16:23,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-03 00:16:23,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-03 00:16:23,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 12:16:22" (1/3) ... [2021-05-03 00:16:23,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc3b427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:16:23, skipping insertion in model container [2021-05-03 00:16:23,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:16:22" (2/3) ... [2021-05-03 00:16:23,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc3b427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:16:23, skipping insertion in model container [2021-05-03 00:16:23,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:16:23" (3/3) ... [2021-05-03 00:16:23,267 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.c [2021-05-03 00:16:23,273 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-03 00:16:23,277 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-03 00:16:23,293 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-03 00:16:23,312 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-03 00:16:23,312 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-03 00:16:23,313 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-03 00:16:23,313 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-03 00:16:23,313 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-03 00:16:23,313 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-03 00:16:23,313 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-03 00:16:23,313 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-03 00:16:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-03 00:16:23,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-03 00:16:23,351 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:23,352 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:23,352 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:23,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:23,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1039138334, now seen corresponding path program 1 times [2021-05-03 00:16:23,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:23,366 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1355473003] [2021-05-03 00:16:23,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:23,423 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:16:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:23,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:23,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:23,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:23,704 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:23,704 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1355473003] [2021-05-03 00:16:23,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1355473003] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:23,707 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:23,707 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-03 00:16:23,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960600492] [2021-05-03 00:16:23,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-03 00:16:23,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:23,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-03 00:16:23,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-03 00:16:23,738 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-03 00:16:23,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:23,888 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2021-05-03 00:16:23,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-03 00:16:23,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2021-05-03 00:16:23,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:23,897 INFO L225 Difference]: With dead ends: 50 [2021-05-03 00:16:23,898 INFO L226 Difference]: Without dead ends: 27 [2021-05-03 00:16:23,901 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 88.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-03 00:16:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-05-03 00:16:23,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-05-03 00:16:23,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-03 00:16:23,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2021-05-03 00:16:23,942 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 21 [2021-05-03 00:16:23,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:23,942 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2021-05-03 00:16:23,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-03 00:16:23,943 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2021-05-03 00:16:23,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-03 00:16:23,944 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:23,944 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:23,944 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-03 00:16:23,944 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:23,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:23,945 INFO L82 PathProgramCache]: Analyzing trace with hash 677978447, now seen corresponding path program 1 times [2021-05-03 00:16:23,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:23,946 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [190032663] [2021-05-03 00:16:23,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:23,948 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:16:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:24,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:24,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:24,162 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:24,162 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [190032663] [2021-05-03 00:16:24,163 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [190032663] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:24,163 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:24,163 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-03 00:16:24,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121123024] [2021-05-03 00:16:24,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-03 00:16:24,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:24,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-03 00:16:24,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-03 00:16:24,166 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:24,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:24,361 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2021-05-03 00:16:24,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-03 00:16:24,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2021-05-03 00:16:24,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:24,363 INFO L225 Difference]: With dead ends: 46 [2021-05-03 00:16:24,363 INFO L226 Difference]: Without dead ends: 31 [2021-05-03 00:16:24,364 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 129.4ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-03 00:16:24,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-05-03 00:16:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2021-05-03 00:16:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-03 00:16:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-05-03 00:16:24,374 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 21 [2021-05-03 00:16:24,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:24,374 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-05-03 00:16:24,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:24,374 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2021-05-03 00:16:24,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-03 00:16:24,375 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:24,375 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:24,375 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-03 00:16:24,376 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:24,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:24,376 INFO L82 PathProgramCache]: Analyzing trace with hash -673447056, now seen corresponding path program 1 times [2021-05-03 00:16:24,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:24,377 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [287568712] [2021-05-03 00:16:24,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:24,420 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_16 v_~SIZE~0_12) (<= v_~last~0_17 v_main_~c~0_16)) InVars {~SIZE~0=v_~SIZE~0_12, main_~c~0=v_main_~c~0_16, ~last~0=v_~last~0_17} OutVars{~SIZE~0=v_~SIZE~0_12, main_~c~0=v_main_~c~0_16, ~last~0=v_~last~0_17} AuxVars[] AssignedVars[] [2021-05-03 00:16:24,439 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:24,444 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:24,468 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:24,500 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:24,507 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:24,584 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:24,617 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:24,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:24,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:24,796 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:24,851 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:24,851 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [287568712] [2021-05-03 00:16:24,852 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [287568712] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:24,852 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:24,852 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-03 00:16:24,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260416736] [2021-05-03 00:16:24,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-03 00:16:24,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:24,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-03 00:16:24,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-03 00:16:24,860 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-03 00:16:25,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:25,121 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2021-05-03 00:16:25,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-03 00:16:25,121 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-05-03 00:16:25,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:25,126 INFO L225 Difference]: With dead ends: 59 [2021-05-03 00:16:25,126 INFO L226 Difference]: Without dead ends: 43 [2021-05-03 00:16:25,127 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 88.9ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-05-03 00:16:25,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-05-03 00:16:25,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2021-05-03 00:16:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-03 00:16:25,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2021-05-03 00:16:25,150 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 24 [2021-05-03 00:16:25,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:25,151 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2021-05-03 00:16:25,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-03 00:16:25,151 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2021-05-03 00:16:25,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-03 00:16:25,153 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:25,153 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:25,153 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-03 00:16:25,154 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:25,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:25,155 INFO L82 PathProgramCache]: Analyzing trace with hash 708533296, now seen corresponding path program 1 times [2021-05-03 00:16:25,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:25,155 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1574674525] [2021-05-03 00:16:25,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:25,170 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_20 v_~last~0_18) (< v_main_~c~0_20 v_~SIZE~0_13)) InVars {~SIZE~0=v_~SIZE~0_13, main_~c~0=v_main_~c~0_20, ~last~0=v_~last~0_18} OutVars{~SIZE~0=v_~SIZE~0_13, main_~c~0=v_main_~c~0_20, ~last~0=v_~last~0_18} AuxVars[] AssignedVars[] [2021-05-03 00:16:25,179 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:25,204 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:25,210 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:25,233 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:25,241 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:25,268 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:25,306 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:25,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:25,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:25,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:25,447 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:25,492 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:25,495 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1574674525] [2021-05-03 00:16:25,495 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1574674525] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:25,495 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:25,495 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-03 00:16:25,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020114631] [2021-05-03 00:16:25,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-03 00:16:25,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:25,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-03 00:16:25,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-05-03 00:16:25,498 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-03 00:16:25,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:25,717 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2021-05-03 00:16:25,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-03 00:16:25,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-05-03 00:16:25,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:25,720 INFO L225 Difference]: With dead ends: 64 [2021-05-03 00:16:25,720 INFO L226 Difference]: Without dead ends: 41 [2021-05-03 00:16:25,722 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 89.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-03 00:16:25,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-05-03 00:16:25,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2021-05-03 00:16:25,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-03 00:16:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2021-05-03 00:16:25,743 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 24 [2021-05-03 00:16:25,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:25,744 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2021-05-03 00:16:25,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-03 00:16:25,744 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2021-05-03 00:16:25,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-03 00:16:25,745 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:25,745 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:25,746 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-03 00:16:25,746 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:25,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:25,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2061972965, now seen corresponding path program 1 times [2021-05-03 00:16:25,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:25,748 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1525071545] [2021-05-03 00:16:25,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:25,761 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_19 v_main_~c~0_24) (< v_main_~c~0_24 v_~SIZE~0_14)) InVars {~SIZE~0=v_~SIZE~0_14, main_~c~0=v_main_~c~0_24, ~last~0=v_~last~0_19} OutVars{~SIZE~0=v_~SIZE~0_14, main_~c~0=v_main_~c~0_24, ~last~0=v_~last~0_19} AuxVars[] AssignedVars[] [2021-05-03 00:16:25,775 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:25,785 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:25,790 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:25,813 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:25,817 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:25,876 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:25,905 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:26,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:26,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:26,032 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:26,092 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:26,092 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1525071545] [2021-05-03 00:16:26,093 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1525071545] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:26,093 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:26,093 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-03 00:16:26,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833216484] [2021-05-03 00:16:26,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-03 00:16:26,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:26,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-03 00:16:26,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-05-03 00:16:26,095 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:26,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:26,391 INFO L93 Difference]: Finished difference Result 77 states and 98 transitions. [2021-05-03 00:16:26,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-03 00:16:26,392 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-05-03 00:16:26,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:26,396 INFO L225 Difference]: With dead ends: 77 [2021-05-03 00:16:26,396 INFO L226 Difference]: Without dead ends: 55 [2021-05-03 00:16:26,397 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 227.8ms TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:16:26,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-05-03 00:16:26,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2021-05-03 00:16:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 42 states have internal predecessors, (53), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-03 00:16:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2021-05-03 00:16:26,408 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 25 [2021-05-03 00:16:26,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:26,408 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2021-05-03 00:16:26,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:26,408 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2021-05-03 00:16:26,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-03 00:16:26,410 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:26,410 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:26,410 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-03 00:16:26,410 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:26,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:26,411 INFO L82 PathProgramCache]: Analyzing trace with hash -2060125923, now seen corresponding path program 1 times [2021-05-03 00:16:26,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:26,411 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [913119286] [2021-05-03 00:16:26,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:26,419 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_20 v_main_~c~0_28) (< v_main_~c~0_28 v_~SIZE~0_15)) InVars {~SIZE~0=v_~SIZE~0_15, main_~c~0=v_main_~c~0_28, ~last~0=v_~last~0_20} OutVars{~SIZE~0=v_~SIZE~0_15, main_~c~0=v_main_~c~0_28, ~last~0=v_~last~0_20} AuxVars[] AssignedVars[] [2021-05-03 00:16:26,430 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:26,434 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:26,437 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:26,456 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:26,464 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:26,511 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:26,541 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:26,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:26,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:26,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:26,805 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:26,805 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [913119286] [2021-05-03 00:16:26,805 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [913119286] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:26,806 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:26,806 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-03 00:16:26,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961236203] [2021-05-03 00:16:26,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-03 00:16:26,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:26,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-03 00:16:26,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-03 00:16:26,807 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:27,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:27,041 INFO L93 Difference]: Finished difference Result 101 states and 129 transitions. [2021-05-03 00:16:27,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-03 00:16:27,045 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-05-03 00:16:27,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:27,046 INFO L225 Difference]: With dead ends: 101 [2021-05-03 00:16:27,046 INFO L226 Difference]: Without dead ends: 63 [2021-05-03 00:16:27,047 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 178.5ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-05-03 00:16:27,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-03 00:16:27,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2021-05-03 00:16:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.297872340425532) internal successors, (61), 48 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-03 00:16:27,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2021-05-03 00:16:27,057 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 25 [2021-05-03 00:16:27,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:27,057 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2021-05-03 00:16:27,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:27,058 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2021-05-03 00:16:27,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-03 00:16:27,058 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:27,058 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:27,059 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-03 00:16:27,059 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:27,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:27,059 INFO L82 PathProgramCache]: Analyzing trace with hash 2067453981, now seen corresponding path program 1 times [2021-05-03 00:16:27,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:27,060 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [25979913] [2021-05-03 00:16:27,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:27,065 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_32 v_~SIZE~0_16) (< v_main_~c~0_32 v_~last~0_21)) InVars {~SIZE~0=v_~SIZE~0_16, main_~c~0=v_main_~c~0_32, ~last~0=v_~last~0_21} OutVars{~SIZE~0=v_~SIZE~0_16, main_~c~0=v_main_~c~0_32, ~last~0=v_~last~0_21} AuxVars[] AssignedVars[] [2021-05-03 00:16:27,069 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:27,072 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:27,075 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:27,094 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:27,106 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:27,155 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:27,175 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:27,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:27,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:27,255 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:27,308 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:27,311 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [25979913] [2021-05-03 00:16:27,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [25979913] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:27,312 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:27,312 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-03 00:16:27,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172946461] [2021-05-03 00:16:27,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-03 00:16:27,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:27,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-03 00:16:27,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-05-03 00:16:27,315 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:27,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:27,622 INFO L93 Difference]: Finished difference Result 105 states and 135 transitions. [2021-05-03 00:16:27,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-03 00:16:27,623 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-05-03 00:16:27,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:27,628 INFO L225 Difference]: With dead ends: 105 [2021-05-03 00:16:27,628 INFO L226 Difference]: Without dead ends: 80 [2021-05-03 00:16:27,629 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 142.2ms TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-05-03 00:16:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-05-03 00:16:27,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2021-05-03 00:16:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 66 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:27,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2021-05-03 00:16:27,657 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 25 [2021-05-03 00:16:27,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:27,658 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2021-05-03 00:16:27,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2021-05-03 00:16:27,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-03 00:16:27,665 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:27,665 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:27,665 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-03 00:16:27,666 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:27,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:27,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2069301023, now seen corresponding path program 1 times [2021-05-03 00:16:27,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:27,666 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [307742758] [2021-05-03 00:16:27,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:27,676 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_36 v_~SIZE~0_17) (< v_main_~c~0_36 v_~last~0_22)) InVars {~SIZE~0=v_~SIZE~0_17, main_~c~0=v_main_~c~0_36, ~last~0=v_~last~0_22} OutVars{~SIZE~0=v_~SIZE~0_17, main_~c~0=v_main_~c~0_36, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[] [2021-05-03 00:16:27,686 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:27,689 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:27,695 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:27,731 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:27,737 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:27,769 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:27,788 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:27,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:27,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:28,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:28,188 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:28,188 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [307742758] [2021-05-03 00:16:28,188 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [307742758] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:28,188 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:28,189 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-03 00:16:28,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197942916] [2021-05-03 00:16:28,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-03 00:16:28,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:28,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-03 00:16:28,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-05-03 00:16:28,190 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:28,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:28,575 INFO L93 Difference]: Finished difference Result 156 states and 205 transitions. [2021-05-03 00:16:28,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-03 00:16:28,576 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2021-05-03 00:16:28,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:28,577 INFO L225 Difference]: With dead ends: 156 [2021-05-03 00:16:28,577 INFO L226 Difference]: Without dead ends: 93 [2021-05-03 00:16:28,578 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 364.6ms TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:16:28,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-03 00:16:28,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 80. [2021-05-03 00:16:28,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:28,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2021-05-03 00:16:28,598 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 25 [2021-05-03 00:16:28,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:28,598 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2021-05-03 00:16:28,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:28,599 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2021-05-03 00:16:28,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-05-03 00:16:28,599 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:28,600 INFO L523 BasicCegarLoop]: trace histogram [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] [2021-05-03 00:16:28,600 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-03 00:16:28,600 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:28,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:28,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1640504642, now seen corresponding path program 2 times [2021-05-03 00:16:28,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:28,601 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [502408379] [2021-05-03 00:16:28,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:28,610 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_40 v_~SIZE~0_18) (<= v_~last~0_23 v_main_~c~0_40)) InVars {~SIZE~0=v_~SIZE~0_18, main_~c~0=v_main_~c~0_40, ~last~0=v_~last~0_23} OutVars{~SIZE~0=v_~SIZE~0_18, main_~c~0=v_main_~c~0_40, ~last~0=v_~last~0_23} AuxVars[] AssignedVars[] [2021-05-03 00:16:28,614 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:28,640 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:28,644 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:28,659 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:28,663 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:28,685 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:28,709 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:28,714 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_24 v_main_~c~0_42) (< (+ v_main_~c~0_42 1) v_~SIZE~0_19)) InVars {~SIZE~0=v_~SIZE~0_19, main_~c~0=v_main_~c~0_42, ~last~0=v_~last~0_24} OutVars{~SIZE~0=v_~SIZE~0_19, main_~c~0=v_main_~c~0_42, ~last~0=v_~last~0_24} AuxVars[] AssignedVars[] [2021-05-03 00:16:28,719 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:28,752 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:28,756 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:28,774 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:28,778 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:28,797 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:28,817 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:28,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:28,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:28,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:29,002 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:29,003 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [502408379] [2021-05-03 00:16:29,003 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [502408379] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:29,003 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:29,003 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-03 00:16:29,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057680446] [2021-05-03 00:16:29,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-03 00:16:29,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:29,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-03 00:16:29,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-05-03 00:16:29,004 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:29,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:29,225 INFO L93 Difference]: Finished difference Result 161 states and 207 transitions. [2021-05-03 00:16:29,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-03 00:16:29,229 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2021-05-03 00:16:29,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:29,231 INFO L225 Difference]: With dead ends: 161 [2021-05-03 00:16:29,231 INFO L226 Difference]: Without dead ends: 98 [2021-05-03 00:16:29,232 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 133.6ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-05-03 00:16:29,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-05-03 00:16:29,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2021-05-03 00:16:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 111 transitions. [2021-05-03 00:16:29,245 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 111 transitions. Word has length 28 [2021-05-03 00:16:29,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:29,245 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 111 transitions. [2021-05-03 00:16:29,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:29,245 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2021-05-03 00:16:29,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-05-03 00:16:29,246 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:29,246 INFO L523 BasicCegarLoop]: trace histogram [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] [2021-05-03 00:16:29,246 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-03 00:16:29,246 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:29,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:29,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1643345404, now seen corresponding path program 1 times [2021-05-03 00:16:29,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:29,247 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1665363990] [2021-05-03 00:16:29,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:29,256 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_25 v_main_~c~0_47) (< v_main_~c~0_47 v_~SIZE~0_20)) InVars {~SIZE~0=v_~SIZE~0_20, main_~c~0=v_main_~c~0_47, ~last~0=v_~last~0_25} OutVars{~SIZE~0=v_~SIZE~0_20, main_~c~0=v_main_~c~0_47, ~last~0=v_~last~0_25} AuxVars[] AssignedVars[] [2021-05-03 00:16:29,259 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:29,282 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:29,285 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:29,298 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:29,303 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:29,327 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:29,350 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_49 v_~SIZE~0_21) (< v_main_~c~0_49 v_~last~0_26)) InVars {~SIZE~0=v_~SIZE~0_21, main_~c~0=v_main_~c~0_49, ~last~0=v_~last~0_26} OutVars{~SIZE~0=v_~SIZE~0_21, main_~c~0=v_main_~c~0_49, ~last~0=v_~last~0_26} AuxVars[] AssignedVars[] [2021-05-03 00:16:29,367 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:29,384 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:29,396 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:29,413 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:29,419 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:29,438 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:29,456 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:29,461 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_51 1) v_~SIZE~0_22) (< v_main_~c~0_51 v_~last~0_27)) InVars {~SIZE~0=v_~SIZE~0_22, main_~c~0=v_main_~c~0_51, ~last~0=v_~last~0_27} OutVars{~SIZE~0=v_~SIZE~0_22, main_~c~0=v_main_~c~0_51, ~last~0=v_~last~0_27} AuxVars[] AssignedVars[] [2021-05-03 00:16:29,464 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:29,482 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:29,491 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:29,511 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:29,517 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:29,543 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:29,565 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:29,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:29,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:29,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:29,756 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:29,972 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:29,973 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1665363990] [2021-05-03 00:16:29,973 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1665363990] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:29,973 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:29,973 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-03 00:16:29,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415945983] [2021-05-03 00:16:29,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-03 00:16:29,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:29,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-03 00:16:29,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:16:29,975 INFO L87 Difference]: Start difference. First operand 89 states and 111 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 14 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:30,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:30,393 INFO L93 Difference]: Finished difference Result 180 states and 229 transitions. [2021-05-03 00:16:30,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-03 00:16:30,394 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 14 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2021-05-03 00:16:30,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:30,395 INFO L225 Difference]: With dead ends: 180 [2021-05-03 00:16:30,395 INFO L226 Difference]: Without dead ends: 108 [2021-05-03 00:16:30,396 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 359.1ms TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:16:30,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-05-03 00:16:30,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2021-05-03 00:16:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 80 states have (on average 1.275) internal successors, (102), 80 states have internal predecessors, (102), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2021-05-03 00:16:30,409 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 28 [2021-05-03 00:16:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:30,410 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2021-05-03 00:16:30,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 14 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2021-05-03 00:16:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-05-03 00:16:30,411 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:30,411 INFO L523 BasicCegarLoop]: trace histogram [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] [2021-05-03 00:16:30,411 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-03 00:16:30,411 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:30,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:30,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1477805054, now seen corresponding path program 2 times [2021-05-03 00:16:30,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:30,412 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [940584587] [2021-05-03 00:16:30,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:30,417 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_57 v_~SIZE~0_23) (< v_main_~c~0_57 v_~last~0_28)) InVars {~SIZE~0=v_~SIZE~0_23, main_~c~0=v_main_~c~0_57, ~last~0=v_~last~0_28} OutVars{~SIZE~0=v_~SIZE~0_23, main_~c~0=v_main_~c~0_57, ~last~0=v_~last~0_28} AuxVars[] AssignedVars[] [2021-05-03 00:16:30,421 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:30,437 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:30,440 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:30,456 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:30,461 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:30,478 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:30,497 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:30,501 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_59 v_~last~0_29) (< (+ v_main_~c~0_59 1) v_~SIZE~0_24)) InVars {~SIZE~0=v_~SIZE~0_24, main_~c~0=v_main_~c~0_59, ~last~0=v_~last~0_29} OutVars{~SIZE~0=v_~SIZE~0_24, main_~c~0=v_main_~c~0_59, ~last~0=v_~last~0_29} AuxVars[] AssignedVars[] [2021-05-03 00:16:30,504 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:30,519 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:30,522 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:30,538 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:30,543 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:30,560 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:30,578 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:30,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:30,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:30,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:30,969 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:30,969 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [940584587] [2021-05-03 00:16:30,969 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [940584587] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:30,969 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:30,969 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-03 00:16:30,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70184195] [2021-05-03 00:16:30,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-03 00:16:30,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:30,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-03 00:16:30,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:16:30,971 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 14 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:31,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:31,359 INFO L93 Difference]: Finished difference Result 181 states and 231 transitions. [2021-05-03 00:16:31,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-03 00:16:31,359 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 14 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2021-05-03 00:16:31,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:31,361 INFO L225 Difference]: With dead ends: 181 [2021-05-03 00:16:31,361 INFO L226 Difference]: Without dead ends: 109 [2021-05-03 00:16:31,362 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 408.8ms TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:16:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-05-03 00:16:31,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 92. [2021-05-03 00:16:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 82 states have internal predecessors, (104), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2021-05-03 00:16:31,380 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 28 [2021-05-03 00:16:31,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:31,382 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2021-05-03 00:16:31,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 14 states have internal predecessors, (22), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2021-05-03 00:16:31,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-03 00:16:31,384 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:31,384 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:31,384 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-03 00:16:31,384 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:31,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:31,385 INFO L82 PathProgramCache]: Analyzing trace with hash 942246269, now seen corresponding path program 3 times [2021-05-03 00:16:31,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:31,385 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [833180723] [2021-05-03 00:16:31,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:31,394 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_30 v_main_~c~0_64) (< v_main_~c~0_64 v_~SIZE~0_25)) InVars {~SIZE~0=v_~SIZE~0_25, main_~c~0=v_main_~c~0_64, ~last~0=v_~last~0_30} OutVars{~SIZE~0=v_~SIZE~0_25, main_~c~0=v_main_~c~0_64, ~last~0=v_~last~0_30} AuxVars[] AssignedVars[] [2021-05-03 00:16:31,397 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:31,400 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:31,403 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:31,417 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:31,420 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:31,453 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:31,480 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:31,491 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_31 v_main_~c~0_66) (< (+ v_main_~c~0_66 1) v_~SIZE~0_26)) InVars {~SIZE~0=v_~SIZE~0_26, main_~c~0=v_main_~c~0_66, ~last~0=v_~last~0_31} OutVars{~SIZE~0=v_~SIZE~0_26, main_~c~0=v_main_~c~0_66, ~last~0=v_~last~0_31} AuxVars[] AssignedVars[] [2021-05-03 00:16:31,499 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:31,500 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:31,503 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:31,516 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:31,519 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:31,549 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:31,577 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:31,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:31,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:31,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:31,794 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:31,794 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [833180723] [2021-05-03 00:16:31,794 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [833180723] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:31,794 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:31,795 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-03 00:16:31,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692708358] [2021-05-03 00:16:31,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-03 00:16:31,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:31,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-03 00:16:31,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-05-03 00:16:31,796 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:32,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:32,071 INFO L93 Difference]: Finished difference Result 184 states and 231 transitions. [2021-05-03 00:16:32,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-03 00:16:32,072 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2021-05-03 00:16:32,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:32,073 INFO L225 Difference]: With dead ends: 184 [2021-05-03 00:16:32,073 INFO L226 Difference]: Without dead ends: 112 [2021-05-03 00:16:32,074 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 174.0ms TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-05-03 00:16:32,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-05-03 00:16:32,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 101. [2021-05-03 00:16:32,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 91 states have internal predecessors, (113), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:32,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2021-05-03 00:16:32,090 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 31 [2021-05-03 00:16:32,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:32,090 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2021-05-03 00:16:32,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:32,091 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2021-05-03 00:16:32,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-03 00:16:32,091 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:32,091 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:32,092 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-03 00:16:32,092 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:32,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:32,092 INFO L82 PathProgramCache]: Analyzing trace with hash -646101633, now seen corresponding path program 2 times [2021-05-03 00:16:32,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:32,093 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1116185470] [2021-05-03 00:16:32,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:32,103 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_32 v_main_~c~0_72) (< v_main_~c~0_72 v_~SIZE~0_27)) InVars {~SIZE~0=v_~SIZE~0_27, main_~c~0=v_main_~c~0_72, ~last~0=v_~last~0_32} OutVars{~SIZE~0=v_~SIZE~0_27, main_~c~0=v_main_~c~0_72, ~last~0=v_~last~0_32} AuxVars[] AssignedVars[] [2021-05-03 00:16:32,106 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:32,127 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:32,130 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:32,144 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:32,148 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:32,166 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:32,187 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_74 v_~last~0_33) (< v_main_~c~0_74 v_~SIZE~0_28)) InVars {~SIZE~0=v_~SIZE~0_28, main_~c~0=v_main_~c~0_74, ~last~0=v_~last~0_33} OutVars{~SIZE~0=v_~SIZE~0_28, main_~c~0=v_main_~c~0_74, ~last~0=v_~last~0_33} AuxVars[] AssignedVars[] [2021-05-03 00:16:32,190 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:32,192 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:32,195 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:32,213 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:32,219 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:32,252 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:32,270 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:32,274 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_34 v_main_~c~0_76) (< (+ v_main_~c~0_76 1) v_~SIZE~0_29)) InVars {~SIZE~0=v_~SIZE~0_29, main_~c~0=v_main_~c~0_76, ~last~0=v_~last~0_34} OutVars{~SIZE~0=v_~SIZE~0_29, main_~c~0=v_main_~c~0_76, ~last~0=v_~last~0_34} AuxVars[] AssignedVars[] [2021-05-03 00:16:32,281 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:32,282 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:32,285 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:32,299 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:32,302 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:32,337 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:32,358 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_78 1) v_~SIZE~0_30) (< v_main_~c~0_78 v_~last~0_35)) InVars {~SIZE~0=v_~SIZE~0_30, main_~c~0=v_main_~c~0_78, ~last~0=v_~last~0_35} OutVars{~SIZE~0=v_~SIZE~0_30, main_~c~0=v_main_~c~0_78, ~last~0=v_~last~0_35} AuxVars[] AssignedVars[] [2021-05-03 00:16:32,361 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:32,362 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:32,364 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:32,381 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:32,389 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:32,419 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:32,437 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:32,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:32,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:32,607 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:32,873 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:32,873 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1116185470] [2021-05-03 00:16:32,874 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1116185470] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:32,874 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:32,874 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-03 00:16:32,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552079322] [2021-05-03 00:16:32,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-03 00:16:32,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:32,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-03 00:16:32,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:16:32,875 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:33,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:33,214 INFO L93 Difference]: Finished difference Result 205 states and 254 transitions. [2021-05-03 00:16:33,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-03 00:16:33,215 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2021-05-03 00:16:33,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:33,216 INFO L225 Difference]: With dead ends: 205 [2021-05-03 00:16:33,217 INFO L226 Difference]: Without dead ends: 124 [2021-05-03 00:16:33,217 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 395.2ms TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:16:33,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-05-03 00:16:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 101. [2021-05-03 00:16:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 91 states have internal predecessors, (113), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2021-05-03 00:16:33,231 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 31 [2021-05-03 00:16:33,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:33,231 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2021-05-03 00:16:33,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:33,232 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2021-05-03 00:16:33,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-03 00:16:33,232 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:33,232 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:33,233 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-05-03 00:16:33,233 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:33,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:33,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1657218883, now seen corresponding path program 3 times [2021-05-03 00:16:33,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:33,233 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [63734485] [2021-05-03 00:16:33,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:33,243 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_36 v_main_~c~0_85) (< v_main_~c~0_85 v_~SIZE~0_31)) InVars {~SIZE~0=v_~SIZE~0_31, main_~c~0=v_main_~c~0_85, ~last~0=v_~last~0_36} OutVars{~SIZE~0=v_~SIZE~0_31, main_~c~0=v_main_~c~0_85, ~last~0=v_~last~0_36} AuxVars[] AssignedVars[] [2021-05-03 00:16:33,246 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:33,267 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:33,277 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:33,295 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:33,299 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:33,320 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:33,346 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_87 v_~SIZE~0_32) (< v_main_~c~0_87 v_~last~0_37)) InVars {~SIZE~0=v_~SIZE~0_32, main_~c~0=v_main_~c~0_87, ~last~0=v_~last~0_37} OutVars{~SIZE~0=v_~SIZE~0_32, main_~c~0=v_main_~c~0_87, ~last~0=v_~last~0_37} AuxVars[] AssignedVars[] [2021-05-03 00:16:33,348 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:33,350 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:33,352 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:33,369 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:33,374 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:33,406 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:33,434 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:33,441 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_89 v_~last~0_38) (< (+ v_main_~c~0_89 1) v_~SIZE~0_33)) InVars {~SIZE~0=v_~SIZE~0_33, main_~c~0=v_main_~c~0_89, ~last~0=v_~last~0_38} OutVars{~SIZE~0=v_~SIZE~0_33, main_~c~0=v_main_~c~0_89, ~last~0=v_~last~0_38} AuxVars[] AssignedVars[] [2021-05-03 00:16:33,444 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:33,445 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:33,448 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:33,467 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:33,472 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:33,506 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:33,525 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:33,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:33,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:33,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:33,692 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:33,987 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:33,987 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [63734485] [2021-05-03 00:16:33,987 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [63734485] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:33,987 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:33,988 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-03 00:16:33,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992297396] [2021-05-03 00:16:33,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-03 00:16:33,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:33,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-03 00:16:33,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:16:33,989 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:34,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:34,345 INFO L93 Difference]: Finished difference Result 204 states and 254 transitions. [2021-05-03 00:16:34,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-03 00:16:34,346 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2021-05-03 00:16:34,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:34,347 INFO L225 Difference]: With dead ends: 204 [2021-05-03 00:16:34,347 INFO L226 Difference]: Without dead ends: 123 [2021-05-03 00:16:34,348 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 380.6ms TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:16:34,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-05-03 00:16:34,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 102. [2021-05-03 00:16:34,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 92 states have (on average 1.25) internal successors, (115), 92 states have internal predecessors, (115), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:34,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2021-05-03 00:16:34,360 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 31 [2021-05-03 00:16:34,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:34,360 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2021-05-03 00:16:34,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:34,360 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2021-05-03 00:16:34,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-03 00:16:34,361 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:34,361 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:34,361 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-05-03 00:16:34,361 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:34,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:34,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1822759233, now seen corresponding path program 3 times [2021-05-03 00:16:34,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:34,362 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1032520927] [2021-05-03 00:16:34,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:34,374 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_96 v_~SIZE~0_34) (< v_main_~c~0_96 v_~last~0_39)) InVars {~SIZE~0=v_~SIZE~0_34, main_~c~0=v_main_~c~0_96, ~last~0=v_~last~0_39} OutVars{~SIZE~0=v_~SIZE~0_34, main_~c~0=v_main_~c~0_96, ~last~0=v_~last~0_39} AuxVars[] AssignedVars[] [2021-05-03 00:16:34,377 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:34,378 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:34,380 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:34,398 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:34,404 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:34,433 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:34,454 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:34,456 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_98 1) v_~SIZE~0_35) (< v_main_~c~0_98 v_~last~0_40)) InVars {~SIZE~0=v_~SIZE~0_35, main_~c~0=v_main_~c~0_98, ~last~0=v_~last~0_40} OutVars{~SIZE~0=v_~SIZE~0_35, main_~c~0=v_main_~c~0_98, ~last~0=v_~last~0_40} AuxVars[] AssignedVars[] [2021-05-03 00:16:34,459 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:34,476 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:34,479 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:34,495 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:34,501 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:34,522 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:34,538 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:34,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:34,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:34,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:35,007 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:35,007 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1032520927] [2021-05-03 00:16:35,007 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1032520927] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:35,007 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:35,007 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-03 00:16:35,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726190047] [2021-05-03 00:16:35,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-03 00:16:35,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:35,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-03 00:16:35,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:16:35,009 INFO L87 Difference]: Start difference. First operand 102 states and 126 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:35,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:35,416 INFO L93 Difference]: Finished difference Result 206 states and 257 transitions. [2021-05-03 00:16:35,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-03 00:16:35,417 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2021-05-03 00:16:35,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:35,418 INFO L225 Difference]: With dead ends: 206 [2021-05-03 00:16:35,418 INFO L226 Difference]: Without dead ends: 125 [2021-05-03 00:16:35,419 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 530.4ms TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:16:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-05-03 00:16:35,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2021-05-03 00:16:35,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 94 states have internal predecessors, (117), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2021-05-03 00:16:35,432 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 128 transitions. Word has length 31 [2021-05-03 00:16:35,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:35,432 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 128 transitions. [2021-05-03 00:16:35,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:35,433 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2021-05-03 00:16:35,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-03 00:16:35,433 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:35,433 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:35,433 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-05-03 00:16:35,433 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:35,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:35,434 INFO L82 PathProgramCache]: Analyzing trace with hash -664471970, now seen corresponding path program 4 times [2021-05-03 00:16:35,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:35,434 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [583777673] [2021-05-03 00:16:35,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:35,441 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_41 v_main_~c~0_104) (< v_main_~c~0_104 v_~SIZE~0_36)) InVars {~SIZE~0=v_~SIZE~0_36, main_~c~0=v_main_~c~0_104, ~last~0=v_~last~0_41} OutVars{~SIZE~0=v_~SIZE~0_36, main_~c~0=v_main_~c~0_104, ~last~0=v_~last~0_41} AuxVars[] AssignedVars[] [2021-05-03 00:16:35,445 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:35,465 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:35,468 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:35,485 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:35,488 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:35,504 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:35,530 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:35,533 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_106 1) v_~SIZE~0_37) (<= v_~last~0_42 v_main_~c~0_106)) InVars {~SIZE~0=v_~SIZE~0_37, main_~c~0=v_main_~c~0_106, ~last~0=v_~last~0_42} OutVars{~SIZE~0=v_~SIZE~0_37, main_~c~0=v_main_~c~0_106, ~last~0=v_~last~0_42} AuxVars[] AssignedVars[] [2021-05-03 00:16:35,537 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:35,558 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:35,562 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:35,578 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:35,582 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:35,613 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:35,634 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:35,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:35,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:35,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:36,159 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:36,159 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [583777673] [2021-05-03 00:16:36,160 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [583777673] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:36,160 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:36,160 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-03 00:16:36,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025725542] [2021-05-03 00:16:36,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-03 00:16:36,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:36,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-03 00:16:36,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:16:36,162 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 15 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:36,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:36,502 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2021-05-03 00:16:36,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-03 00:16:36,502 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 15 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2021-05-03 00:16:36,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:36,503 INFO L225 Difference]: With dead ends: 211 [2021-05-03 00:16:36,504 INFO L226 Difference]: Without dead ends: 130 [2021-05-03 00:16:36,506 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 448.0ms TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:16:36,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-05-03 00:16:36,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 107. [2021-05-03 00:16:36,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 97 states have (on average 1.2371134020618557) internal successors, (120), 97 states have internal predecessors, (120), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:36,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2021-05-03 00:16:36,522 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 34 [2021-05-03 00:16:36,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:36,522 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2021-05-03 00:16:36,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 15 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:36,522 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2021-05-03 00:16:36,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-03 00:16:36,523 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:36,523 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 3, 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-03 00:16:36,524 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-05-03 00:16:36,524 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:36,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:36,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1482120420, now seen corresponding path program 4 times [2021-05-03 00:16:36,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:36,524 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1114357683] [2021-05-03 00:16:36,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:36,536 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_43 v_main_~c~0_113) (< v_main_~c~0_113 v_~SIZE~0_38)) InVars {~SIZE~0=v_~SIZE~0_38, main_~c~0=v_main_~c~0_113, ~last~0=v_~last~0_43} OutVars{~SIZE~0=v_~SIZE~0_38, main_~c~0=v_main_~c~0_113, ~last~0=v_~last~0_43} AuxVars[] AssignedVars[] [2021-05-03 00:16:36,540 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:36,542 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:36,547 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:36,560 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:36,563 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:36,597 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:36,617 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_115 v_~SIZE~0_39) (< v_main_~c~0_115 v_~last~0_44)) InVars {~SIZE~0=v_~SIZE~0_39, main_~c~0=v_main_~c~0_115, ~last~0=v_~last~0_44} OutVars{~SIZE~0=v_~SIZE~0_39, main_~c~0=v_main_~c~0_115, ~last~0=v_~last~0_44} AuxVars[] AssignedVars[] [2021-05-03 00:16:36,620 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:36,635 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:36,638 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:36,652 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:36,657 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:36,671 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:36,687 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:36,690 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_117 1) v_~SIZE~0_40) (<= v_~last~0_45 v_main_~c~0_117)) InVars {~SIZE~0=v_~SIZE~0_40, main_~c~0=v_main_~c~0_117, ~last~0=v_~last~0_45} OutVars{~SIZE~0=v_~SIZE~0_40, main_~c~0=v_main_~c~0_117, ~last~0=v_~last~0_45} AuxVars[] AssignedVars[] [2021-05-03 00:16:36,693 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:36,695 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:36,697 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:36,710 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:36,727 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:36,760 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:36,779 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_119 1) v_~SIZE~0_41) (< v_main_~c~0_119 v_~last~0_46)) InVars {~SIZE~0=v_~SIZE~0_41, main_~c~0=v_main_~c~0_119, ~last~0=v_~last~0_46} OutVars{~SIZE~0=v_~SIZE~0_41, main_~c~0=v_main_~c~0_119, ~last~0=v_~last~0_46} AuxVars[] AssignedVars[] [2021-05-03 00:16:36,782 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:36,798 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:36,801 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:36,818 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:36,823 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:36,838 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:36,858 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:37,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:37,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:37,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:37,023 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:37,388 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:37,388 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1114357683] [2021-05-03 00:16:37,388 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1114357683] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:37,388 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:37,388 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-03 00:16:37,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86010137] [2021-05-03 00:16:37,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-03 00:16:37,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:37,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-03 00:16:37,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:16:37,391 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 16 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:37,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:37,835 INFO L93 Difference]: Finished difference Result 214 states and 264 transitions. [2021-05-03 00:16:37,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-03 00:16:37,836 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 16 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2021-05-03 00:16:37,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:37,837 INFO L225 Difference]: With dead ends: 214 [2021-05-03 00:16:37,838 INFO L226 Difference]: Without dead ends: 133 [2021-05-03 00:16:37,839 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 475.7ms TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:16:37,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-05-03 00:16:37,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 107. [2021-05-03 00:16:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 97 states have (on average 1.2371134020618557) internal successors, (120), 97 states have internal predecessors, (120), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2021-05-03 00:16:37,859 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 34 [2021-05-03 00:16:37,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:37,861 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2021-05-03 00:16:37,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 16 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2021-05-03 00:16:37,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-03 00:16:37,861 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:37,861 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:37,862 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-05-03 00:16:37,862 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:37,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:37,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1224498974, now seen corresponding path program 5 times [2021-05-03 00:16:37,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:37,863 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [193956485] [2021-05-03 00:16:37,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:37,891 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_47 v_main_~c~0_127) (< v_main_~c~0_127 v_~SIZE~0_42)) InVars {~SIZE~0=v_~SIZE~0_42, main_~c~0=v_main_~c~0_127, ~last~0=v_~last~0_47} OutVars{~SIZE~0=v_~SIZE~0_42, main_~c~0=v_main_~c~0_127, ~last~0=v_~last~0_47} AuxVars[] AssignedVars[] [2021-05-03 00:16:37,894 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:37,895 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:37,899 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:37,914 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:37,917 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:37,947 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:37,965 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_129 v_~SIZE~0_43) (< v_main_~c~0_129 v_~last~0_48)) InVars {~SIZE~0=v_~SIZE~0_43, main_~c~0=v_main_~c~0_129, ~last~0=v_~last~0_48} OutVars{~SIZE~0=v_~SIZE~0_43, main_~c~0=v_main_~c~0_129, ~last~0=v_~last~0_48} AuxVars[] AssignedVars[] [2021-05-03 00:16:37,968 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:37,985 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:37,988 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:38,005 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:38,011 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:38,029 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:38,049 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:38,052 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_49 v_main_~c~0_131) (< (+ v_main_~c~0_131 1) v_~SIZE~0_44)) InVars {~SIZE~0=v_~SIZE~0_44, main_~c~0=v_main_~c~0_131, ~last~0=v_~last~0_49} OutVars{~SIZE~0=v_~SIZE~0_44, main_~c~0=v_main_~c~0_131, ~last~0=v_~last~0_49} AuxVars[] AssignedVars[] [2021-05-03 00:16:38,055 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:38,081 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:38,083 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:38,094 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:38,097 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:38,113 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:38,135 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_133 1) v_~SIZE~0_45) (< v_main_~c~0_133 v_~last~0_50)) InVars {~SIZE~0=v_~SIZE~0_45, main_~c~0=v_main_~c~0_133, ~last~0=v_~last~0_50} OutVars{~SIZE~0=v_~SIZE~0_45, main_~c~0=v_main_~c~0_133, ~last~0=v_~last~0_50} AuxVars[] AssignedVars[] [2021-05-03 00:16:38,137 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:38,150 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:38,152 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:38,173 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:38,178 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:38,193 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:38,209 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:38,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:38,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:38,369 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:38,652 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:38,652 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [193956485] [2021-05-03 00:16:38,652 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [193956485] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:38,652 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:38,652 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-03 00:16:38,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021407726] [2021-05-03 00:16:38,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-03 00:16:38,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:38,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-03 00:16:38,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:16:38,654 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:39,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:39,151 INFO L93 Difference]: Finished difference Result 211 states and 261 transitions. [2021-05-03 00:16:39,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-03 00:16:39,152 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2021-05-03 00:16:39,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:39,153 INFO L225 Difference]: With dead ends: 211 [2021-05-03 00:16:39,154 INFO L226 Difference]: Without dead ends: 130 [2021-05-03 00:16:39,154 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 403.7ms TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:16:39,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-05-03 00:16:39,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 107. [2021-05-03 00:16:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 97 states have (on average 1.2371134020618557) internal successors, (120), 97 states have internal predecessors, (120), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2021-05-03 00:16:39,169 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 34 [2021-05-03 00:16:39,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:39,170 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2021-05-03 00:16:39,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2021-05-03 00:16:39,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-03 00:16:39,170 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:39,171 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 3, 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-03 00:16:39,172 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-05-03 00:16:39,172 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:39,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:39,173 INFO L82 PathProgramCache]: Analyzing trace with hash 213381724, now seen corresponding path program 6 times [2021-05-03 00:16:39,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:39,173 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1863698362] [2021-05-03 00:16:39,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:39,186 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_51 v_main_~c~0_141) (< v_main_~c~0_141 v_~SIZE~0_46)) InVars {~SIZE~0=v_~SIZE~0_46, main_~c~0=v_main_~c~0_141, ~last~0=v_~last~0_51} OutVars{~SIZE~0=v_~SIZE~0_46, main_~c~0=v_main_~c~0_141, ~last~0=v_~last~0_51} AuxVars[] AssignedVars[] [2021-05-03 00:16:39,189 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:39,209 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:39,211 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:39,224 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:39,227 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:39,245 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:39,266 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_143 v_~last~0_52) (< v_main_~c~0_143 v_~SIZE~0_47)) InVars {~SIZE~0=v_~SIZE~0_47, main_~c~0=v_main_~c~0_143, ~last~0=v_~last~0_52} OutVars{~SIZE~0=v_~SIZE~0_47, main_~c~0=v_main_~c~0_143, ~last~0=v_~last~0_52} AuxVars[] AssignedVars[] [2021-05-03 00:16:39,268 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:39,269 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:39,271 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:39,286 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:39,291 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:39,320 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:39,338 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:39,340 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_145 v_~last~0_53) (< (+ v_main_~c~0_145 1) v_~SIZE~0_48)) InVars {~SIZE~0=v_~SIZE~0_48, main_~c~0=v_main_~c~0_145, ~last~0=v_~last~0_53} OutVars{~SIZE~0=v_~SIZE~0_48, main_~c~0=v_main_~c~0_145, ~last~0=v_~last~0_53} AuxVars[] AssignedVars[] [2021-05-03 00:16:39,342 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:39,343 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:39,346 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:39,364 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:39,375 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:39,405 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:39,423 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:39,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:39,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:39,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:39,625 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:40,006 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:40,006 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1863698362] [2021-05-03 00:16:40,006 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1863698362] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:40,006 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:40,006 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-03 00:16:40,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920524568] [2021-05-03 00:16:40,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-03 00:16:40,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:40,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-03 00:16:40,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:16:40,008 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 18 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:40,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:40,455 INFO L93 Difference]: Finished difference Result 210 states and 261 transitions. [2021-05-03 00:16:40,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-03 00:16:40,456 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 18 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2021-05-03 00:16:40,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:40,457 INFO L225 Difference]: With dead ends: 210 [2021-05-03 00:16:40,457 INFO L226 Difference]: Without dead ends: 129 [2021-05-03 00:16:40,458 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 507.4ms TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:16:40,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-05-03 00:16:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2021-05-03 00:16:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 98 states have (on average 1.2448979591836735) internal successors, (122), 98 states have internal predecessors, (122), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:40,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 133 transitions. [2021-05-03 00:16:40,475 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 133 transitions. Word has length 34 [2021-05-03 00:16:40,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:40,475 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 133 transitions. [2021-05-03 00:16:40,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 18 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:40,475 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 133 transitions. [2021-05-03 00:16:40,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-03 00:16:40,476 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:40,476 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:40,476 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-05-03 00:16:40,476 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:40,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:40,477 INFO L82 PathProgramCache]: Analyzing trace with hash 47841374, now seen corresponding path program 4 times [2021-05-03 00:16:40,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:40,477 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [35793343] [2021-05-03 00:16:40,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:40,483 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_153 v_~SIZE~0_49) (< v_main_~c~0_153 v_~last~0_54)) InVars {~SIZE~0=v_~SIZE~0_49, main_~c~0=v_main_~c~0_153, ~last~0=v_~last~0_54} OutVars{~SIZE~0=v_~SIZE~0_49, main_~c~0=v_main_~c~0_153, ~last~0=v_~last~0_54} AuxVars[] AssignedVars[] [2021-05-03 00:16:40,485 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:40,486 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:40,488 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:40,503 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:40,509 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:40,539 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:40,557 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:40,559 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_155 v_~last~0_55) (< (+ v_main_~c~0_155 1) v_~SIZE~0_50)) InVars {~SIZE~0=v_~SIZE~0_50, main_~c~0=v_main_~c~0_155, ~last~0=v_~last~0_55} OutVars{~SIZE~0=v_~SIZE~0_50, main_~c~0=v_main_~c~0_155, ~last~0=v_~last~0_55} AuxVars[] AssignedVars[] [2021-05-03 00:16:40,561 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:40,562 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:40,564 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:40,580 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:40,585 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:40,609 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:40,627 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:40,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:40,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:40,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:41,132 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:41,132 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [35793343] [2021-05-03 00:16:41,132 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [35793343] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:41,132 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:41,132 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-03 00:16:41,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303184598] [2021-05-03 00:16:41,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-03 00:16:41,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:41,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-03 00:16:41,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:16:41,133 INFO L87 Difference]: Start difference. First operand 108 states and 133 transitions. Second operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 18 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:41,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:41,693 INFO L93 Difference]: Finished difference Result 213 states and 265 transitions. [2021-05-03 00:16:41,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-03 00:16:41,694 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 18 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2021-05-03 00:16:41,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:41,695 INFO L225 Difference]: With dead ends: 213 [2021-05-03 00:16:41,695 INFO L226 Difference]: Without dead ends: 132 [2021-05-03 00:16:41,696 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 599.0ms TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:16:41,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-05-03 00:16:41,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 110. [2021-05-03 00:16:41,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 100 states have (on average 1.24) internal successors, (124), 100 states have internal predecessors, (124), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:41,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2021-05-03 00:16:41,712 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 34 [2021-05-03 00:16:41,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:41,712 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2021-05-03 00:16:41,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 18 states have internal predecessors, (28), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:41,713 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2021-05-03 00:16:41,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-03 00:16:41,713 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:41,713 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:41,713 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-05-03 00:16:41,713 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:41,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:41,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1002983901, now seen corresponding path program 5 times [2021-05-03 00:16:41,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:41,714 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1573146247] [2021-05-03 00:16:41,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:41,721 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_162 v_~SIZE~0_51) (<= v_~last~0_56 v_main_~c~0_162)) InVars {~SIZE~0=v_~SIZE~0_51, main_~c~0=v_main_~c~0_162, ~last~0=v_~last~0_56} OutVars{~SIZE~0=v_~SIZE~0_51, main_~c~0=v_main_~c~0_162, ~last~0=v_~last~0_56} AuxVars[] AssignedVars[] [2021-05-03 00:16:41,725 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:41,726 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:41,731 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:41,750 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:41,753 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:41,786 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:41,804 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:41,807 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_164 1) v_~SIZE~0_52) (<= v_~last~0_57 v_main_~c~0_164)) InVars {~SIZE~0=v_~SIZE~0_52, main_~c~0=v_main_~c~0_164, ~last~0=v_~last~0_57} OutVars{~SIZE~0=v_~SIZE~0_52, main_~c~0=v_main_~c~0_164, ~last~0=v_~last~0_57} AuxVars[] AssignedVars[] [2021-05-03 00:16:41,810 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:41,812 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:41,814 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:41,827 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:41,830 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:41,866 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:41,886 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:42,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:42,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:42,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:42,490 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:42,491 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1573146247] [2021-05-03 00:16:42,491 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1573146247] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:42,491 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:42,491 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-03 00:16:42,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105422324] [2021-05-03 00:16:42,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-03 00:16:42,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:42,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-03 00:16:42,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:16:42,494 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 16 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:42,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:42,843 INFO L93 Difference]: Finished difference Result 220 states and 271 transitions. [2021-05-03 00:16:42,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-03 00:16:42,844 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 16 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2021-05-03 00:16:42,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:42,845 INFO L225 Difference]: With dead ends: 220 [2021-05-03 00:16:42,845 INFO L226 Difference]: Without dead ends: 139 [2021-05-03 00:16:42,846 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 536.8ms TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:16:42,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-05-03 00:16:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 113. [2021-05-03 00:16:42,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 103 states have (on average 1.233009708737864) internal successors, (127), 103 states have internal predecessors, (127), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:42,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2021-05-03 00:16:42,865 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 37 [2021-05-03 00:16:42,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:42,865 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2021-05-03 00:16:42,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 16 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:42,865 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2021-05-03 00:16:42,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-03 00:16:42,866 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:42,866 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 4, 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-03 00:16:42,866 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-05-03 00:16:42,866 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:42,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:42,867 INFO L82 PathProgramCache]: Analyzing trace with hash -802454433, now seen corresponding path program 7 times [2021-05-03 00:16:42,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:42,867 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2131015246] [2021-05-03 00:16:42,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:42,878 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_172 v_~SIZE~0_53) (<= v_~last~0_58 v_main_~c~0_172)) InVars {~SIZE~0=v_~SIZE~0_53, main_~c~0=v_main_~c~0_172, ~last~0=v_~last~0_58} OutVars{~SIZE~0=v_~SIZE~0_53, main_~c~0=v_main_~c~0_172, ~last~0=v_~last~0_58} AuxVars[] AssignedVars[] [2021-05-03 00:16:42,881 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:42,883 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:42,885 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:42,897 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:42,900 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:42,935 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:42,956 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_174 v_~last~0_59) (< v_main_~c~0_174 v_~SIZE~0_54)) InVars {~SIZE~0=v_~SIZE~0_54, main_~c~0=v_main_~c~0_174, ~last~0=v_~last~0_59} OutVars{~SIZE~0=v_~SIZE~0_54, main_~c~0=v_main_~c~0_174, ~last~0=v_~last~0_59} AuxVars[] AssignedVars[] [2021-05-03 00:16:42,959 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:42,961 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:42,964 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:42,981 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:42,986 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:43,019 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:43,036 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:43,039 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_176 1) v_~SIZE~0_55) (<= v_~last~0_60 v_main_~c~0_176)) InVars {~SIZE~0=v_~SIZE~0_55, main_~c~0=v_main_~c~0_176, ~last~0=v_~last~0_60} OutVars{~SIZE~0=v_~SIZE~0_55, main_~c~0=v_main_~c~0_176, ~last~0=v_~last~0_60} AuxVars[] AssignedVars[] [2021-05-03 00:16:43,044 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:43,046 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:43,050 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:43,062 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:43,065 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:43,098 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:43,124 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_178 v_~last~0_61) (< (+ v_main_~c~0_178 1) v_~SIZE~0_56)) InVars {~SIZE~0=v_~SIZE~0_56, main_~c~0=v_main_~c~0_178, ~last~0=v_~last~0_61} OutVars{~SIZE~0=v_~SIZE~0_56, main_~c~0=v_main_~c~0_178, ~last~0=v_~last~0_61} AuxVars[] AssignedVars[] [2021-05-03 00:16:43,126 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:43,143 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:43,145 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:43,162 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:43,167 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:43,181 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:43,199 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:43,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:43,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:43,362 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:43,717 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:43,717 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2131015246] [2021-05-03 00:16:43,717 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2131015246] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:43,717 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:43,717 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-03 00:16:43,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503189097] [2021-05-03 00:16:43,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-03 00:16:43,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:43,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-03 00:16:43,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:16:43,718 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 17 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:44,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:44,172 INFO L93 Difference]: Finished difference Result 223 states and 274 transitions. [2021-05-03 00:16:44,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-03 00:16:44,173 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 17 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2021-05-03 00:16:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:44,174 INFO L225 Difference]: With dead ends: 223 [2021-05-03 00:16:44,174 INFO L226 Difference]: Without dead ends: 142 [2021-05-03 00:16:44,175 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 472.8ms TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:16:44,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-05-03 00:16:44,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2021-05-03 00:16:44,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 103 states have (on average 1.233009708737864) internal successors, (127), 103 states have internal predecessors, (127), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2021-05-03 00:16:44,194 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 37 [2021-05-03 00:16:44,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:44,194 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2021-05-03 00:16:44,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 17 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2021-05-03 00:16:44,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-03 00:16:44,195 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:44,195 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:44,195 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-05-03 00:16:44,195 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:44,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:44,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1620102883, now seen corresponding path program 8 times [2021-05-03 00:16:44,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:44,196 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1393769262] [2021-05-03 00:16:44,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:44,210 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_62 v_main_~c~0_187) (< v_main_~c~0_187 v_~SIZE~0_57)) InVars {~SIZE~0=v_~SIZE~0_57, main_~c~0=v_main_~c~0_187, ~last~0=v_~last~0_62} OutVars{~SIZE~0=v_~SIZE~0_57, main_~c~0=v_main_~c~0_187, ~last~0=v_~last~0_62} AuxVars[] AssignedVars[] [2021-05-03 00:16:44,213 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:44,215 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:44,217 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:44,231 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:44,235 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:44,266 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:44,290 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_189 v_~SIZE~0_58) (< v_main_~c~0_189 v_~last~0_63)) InVars {~SIZE~0=v_~SIZE~0_58, main_~c~0=v_main_~c~0_189, ~last~0=v_~last~0_63} OutVars{~SIZE~0=v_~SIZE~0_58, main_~c~0=v_main_~c~0_189, ~last~0=v_~last~0_63} AuxVars[] AssignedVars[] [2021-05-03 00:16:44,292 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:44,308 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:44,311 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:44,327 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:44,333 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:44,348 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:44,364 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:44,367 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_191 1) v_~SIZE~0_59) (<= v_~last~0_64 v_main_~c~0_191)) InVars {~SIZE~0=v_~SIZE~0_59, main_~c~0=v_main_~c~0_191, ~last~0=v_~last~0_64} OutVars{~SIZE~0=v_~SIZE~0_59, main_~c~0=v_main_~c~0_191, ~last~0=v_~last~0_64} AuxVars[] AssignedVars[] [2021-05-03 00:16:44,370 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:44,387 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:44,390 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:44,402 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:44,412 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:44,429 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:44,447 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_193 1) v_~SIZE~0_60) (< v_main_~c~0_193 v_~last~0_65)) InVars {~SIZE~0=v_~SIZE~0_60, main_~c~0=v_main_~c~0_193, ~last~0=v_~last~0_65} OutVars{~SIZE~0=v_~SIZE~0_60, main_~c~0=v_main_~c~0_193, ~last~0=v_~last~0_65} AuxVars[] AssignedVars[] [2021-05-03 00:16:44,449 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:44,450 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:44,453 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:44,467 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:44,472 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:44,524 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:44,548 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:44,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:44,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:44,729 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:45,117 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:45,117 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1393769262] [2021-05-03 00:16:45,117 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1393769262] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:45,117 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:45,117 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-03 00:16:45,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057326845] [2021-05-03 00:16:45,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-03 00:16:45,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:45,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-03 00:16:45,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:16:45,119 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:45,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:45,566 INFO L93 Difference]: Finished difference Result 220 states and 271 transitions. [2021-05-03 00:16:45,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-03 00:16:45,567 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2021-05-03 00:16:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:45,568 INFO L225 Difference]: With dead ends: 220 [2021-05-03 00:16:45,568 INFO L226 Difference]: Without dead ends: 139 [2021-05-03 00:16:45,570 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 477.9ms TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:16:45,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-05-03 00:16:45,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 113. [2021-05-03 00:16:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 103 states have (on average 1.233009708737864) internal successors, (127), 103 states have internal predecessors, (127), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:45,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2021-05-03 00:16:45,589 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 37 [2021-05-03 00:16:45,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:45,589 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2021-05-03 00:16:45,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:45,590 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2021-05-03 00:16:45,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-03 00:16:45,590 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:45,590 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:45,590 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-05-03 00:16:45,590 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:45,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:45,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1086516511, now seen corresponding path program 9 times [2021-05-03 00:16:45,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:45,591 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2007353749] [2021-05-03 00:16:45,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:45,599 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_202 v_~SIZE~0_61) (<= v_~last~0_66 v_main_~c~0_202)) InVars {~SIZE~0=v_~SIZE~0_61, main_~c~0=v_main_~c~0_202, ~last~0=v_~last~0_66} OutVars{~SIZE~0=v_~SIZE~0_61, main_~c~0=v_main_~c~0_202, ~last~0=v_~last~0_66} AuxVars[] AssignedVars[] [2021-05-03 00:16:45,601 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:45,603 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:45,607 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:45,621 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:45,625 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:45,654 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:45,672 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_204 v_~last~0_67) (< v_main_~c~0_204 v_~SIZE~0_62)) InVars {~SIZE~0=v_~SIZE~0_62, main_~c~0=v_main_~c~0_204, ~last~0=v_~last~0_67} OutVars{~SIZE~0=v_~SIZE~0_62, main_~c~0=v_main_~c~0_204, ~last~0=v_~last~0_67} AuxVars[] AssignedVars[] [2021-05-03 00:16:45,674 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:45,675 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:45,677 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:45,695 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:45,700 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:45,725 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:45,741 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:45,744 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_206 1) v_~SIZE~0_63) (<= v_~last~0_68 v_main_~c~0_206)) InVars {~SIZE~0=v_~SIZE~0_63, main_~c~0=v_main_~c~0_206, ~last~0=v_~last~0_68} OutVars{~SIZE~0=v_~SIZE~0_63, main_~c~0=v_main_~c~0_206, ~last~0=v_~last~0_68} AuxVars[] AssignedVars[] [2021-05-03 00:16:45,746 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:45,748 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:45,750 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:45,763 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:45,766 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:45,793 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:45,813 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_208 v_~last~0_69) (< (+ v_main_~c~0_208 1) v_~SIZE~0_64)) InVars {~SIZE~0=v_~SIZE~0_64, main_~c~0=v_main_~c~0_208, ~last~0=v_~last~0_69} OutVars{~SIZE~0=v_~SIZE~0_64, main_~c~0=v_main_~c~0_208, ~last~0=v_~last~0_69} AuxVars[] AssignedVars[] [2021-05-03 00:16:45,815 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:45,818 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:45,820 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:45,837 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:45,842 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:45,868 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:45,884 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:46,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:46,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:46,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:46,031 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:46,413 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:46,414 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2007353749] [2021-05-03 00:16:46,414 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2007353749] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:46,414 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:46,414 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-03 00:16:46,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641997021] [2021-05-03 00:16:46,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-03 00:16:46,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:46,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-03 00:16:46,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:16:46,415 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:46,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:46,843 INFO L93 Difference]: Finished difference Result 217 states and 268 transitions. [2021-05-03 00:16:46,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-03 00:16:46,844 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2021-05-03 00:16:46,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:46,845 INFO L225 Difference]: With dead ends: 217 [2021-05-03 00:16:46,845 INFO L226 Difference]: Without dead ends: 136 [2021-05-03 00:16:46,846 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 477.8ms TimeCoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:16:46,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-05-03 00:16:46,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 113. [2021-05-03 00:16:46,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 103 states have (on average 1.233009708737864) internal successors, (127), 103 states have internal predecessors, (127), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:46,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2021-05-03 00:16:46,865 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 37 [2021-05-03 00:16:46,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:46,865 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2021-05-03 00:16:46,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 19 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:46,866 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2021-05-03 00:16:46,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-03 00:16:46,866 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:46,866 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 4, 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-03 00:16:46,866 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-05-03 00:16:46,866 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:46,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:46,867 INFO L82 PathProgramCache]: Analyzing trace with hash 75399261, now seen corresponding path program 10 times [2021-05-03 00:16:46,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:46,867 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [165747543] [2021-05-03 00:16:46,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:46,873 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_70 v_main_~c~0_217) (< v_main_~c~0_217 v_~SIZE~0_65)) InVars {~SIZE~0=v_~SIZE~0_65, main_~c~0=v_main_~c~0_217, ~last~0=v_~last~0_70} OutVars{~SIZE~0=v_~SIZE~0_65, main_~c~0=v_main_~c~0_217, ~last~0=v_~last~0_70} AuxVars[] AssignedVars[] [2021-05-03 00:16:46,876 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:46,877 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:46,878 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:46,890 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:46,893 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:46,920 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:46,938 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_219 v_~SIZE~0_66) (< v_main_~c~0_219 v_~last~0_71)) InVars {~SIZE~0=v_~SIZE~0_66, main_~c~0=v_main_~c~0_219, ~last~0=v_~last~0_71} OutVars{~SIZE~0=v_~SIZE~0_66, main_~c~0=v_main_~c~0_219, ~last~0=v_~last~0_71} AuxVars[] AssignedVars[] [2021-05-03 00:16:46,940 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:46,953 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:46,955 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:46,968 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:46,973 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:46,986 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:47,004 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:47,014 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_221 v_~last~0_72) (< (+ v_main_~c~0_221 1) v_~SIZE~0_67)) InVars {~SIZE~0=v_~SIZE~0_67, main_~c~0=v_main_~c~0_221, ~last~0=v_~last~0_72} OutVars{~SIZE~0=v_~SIZE~0_67, main_~c~0=v_main_~c~0_221, ~last~0=v_~last~0_72} AuxVars[] AssignedVars[] [2021-05-03 00:16:47,016 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:47,031 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:47,034 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:47,047 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:47,053 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:47,068 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:47,084 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:47,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:47,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:47,253 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:47,641 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:47,641 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [165747543] [2021-05-03 00:16:47,641 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [165747543] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:47,642 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:47,642 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-03 00:16:47,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169714073] [2021-05-03 00:16:47,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-03 00:16:47,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:47,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-03 00:16:47,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:16:47,643 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 20 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:48,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:48,023 INFO L93 Difference]: Finished difference Result 216 states and 268 transitions. [2021-05-03 00:16:48,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-03 00:16:48,024 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 20 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2021-05-03 00:16:48,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:48,025 INFO L225 Difference]: With dead ends: 216 [2021-05-03 00:16:48,025 INFO L226 Difference]: Without dead ends: 135 [2021-05-03 00:16:48,026 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 493.5ms TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:16:48,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-05-03 00:16:48,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2021-05-03 00:16:48,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 104 states have (on average 1.2403846153846154) internal successors, (129), 104 states have internal predecessors, (129), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:48,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 140 transitions. [2021-05-03 00:16:48,045 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 140 transitions. Word has length 37 [2021-05-03 00:16:48,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:48,045 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 140 transitions. [2021-05-03 00:16:48,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 20 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:48,046 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2021-05-03 00:16:48,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-03 00:16:48,046 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:48,046 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:48,046 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-05-03 00:16:48,046 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:48,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:48,047 INFO L82 PathProgramCache]: Analyzing trace with hash -90141089, now seen corresponding path program 5 times [2021-05-03 00:16:48,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:48,047 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1987571752] [2021-05-03 00:16:48,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:48,052 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_230 v_~SIZE~0_68) (< v_main_~c~0_230 v_~last~0_73)) InVars {~SIZE~0=v_~SIZE~0_68, main_~c~0=v_main_~c~0_230, ~last~0=v_~last~0_73} OutVars{~SIZE~0=v_~SIZE~0_68, main_~c~0=v_main_~c~0_230, ~last~0=v_~last~0_73} AuxVars[] AssignedVars[] [2021-05-03 00:16:48,055 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:48,056 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:48,058 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:48,073 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:48,078 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:48,111 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:48,131 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:48,132 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_232 v_~last~0_74) (< (+ v_main_~c~0_232 1) v_~SIZE~0_69)) InVars {~SIZE~0=v_~SIZE~0_69, main_~c~0=v_main_~c~0_232, ~last~0=v_~last~0_74} OutVars{~SIZE~0=v_~SIZE~0_69, main_~c~0=v_main_~c~0_232, ~last~0=v_~last~0_74} AuxVars[] AssignedVars[] [2021-05-03 00:16:48,134 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:48,135 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:48,137 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:48,151 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:48,156 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:48,190 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:48,209 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:48,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:48,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:48,767 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:48,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1987571752] [2021-05-03 00:16:48,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1987571752] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:48,768 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:48,768 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-03 00:16:48,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565323729] [2021-05-03 00:16:48,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-03 00:16:48,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:48,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-03 00:16:48,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:16:48,769 INFO L87 Difference]: Start difference. First operand 114 states and 140 transitions. Second operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 20 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:49,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:49,286 INFO L93 Difference]: Finished difference Result 220 states and 273 transitions. [2021-05-03 00:16:49,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:16:49,287 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 20 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2021-05-03 00:16:49,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:49,288 INFO L225 Difference]: With dead ends: 220 [2021-05-03 00:16:49,288 INFO L226 Difference]: Without dead ends: 139 [2021-05-03 00:16:49,289 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 663.6ms TimeCoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:16:49,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-05-03 00:16:49,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 116. [2021-05-03 00:16:49,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 106 states have (on average 1.2358490566037736) internal successors, (131), 106 states have internal predecessors, (131), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:49,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2021-05-03 00:16:49,309 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 37 [2021-05-03 00:16:49,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:49,309 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2021-05-03 00:16:49,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 20 states have internal predecessors, (31), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:49,310 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2021-05-03 00:16:49,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-03 00:16:49,310 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:49,310 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:49,310 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-05-03 00:16:49,310 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:49,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:49,311 INFO L82 PathProgramCache]: Analyzing trace with hash 589091326, now seen corresponding path program 6 times [2021-05-03 00:16:49,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:49,311 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1153669582] [2021-05-03 00:16:49,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:49,317 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_240 v_~SIZE~0_70) (<= v_~last~0_75 v_main_~c~0_240)) InVars {~SIZE~0=v_~SIZE~0_70, main_~c~0=v_main_~c~0_240, ~last~0=v_~last~0_75} OutVars{~SIZE~0=v_~SIZE~0_70, main_~c~0=v_main_~c~0_240, ~last~0=v_~last~0_75} AuxVars[] AssignedVars[] [2021-05-03 00:16:49,321 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:49,342 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:49,344 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:49,357 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:49,360 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:49,378 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:49,396 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:49,399 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_76 v_main_~c~0_242) (< (+ v_main_~c~0_242 1) v_~SIZE~0_71)) InVars {~SIZE~0=v_~SIZE~0_71, main_~c~0=v_main_~c~0_242, ~last~0=v_~last~0_76} OutVars{~SIZE~0=v_~SIZE~0_71, main_~c~0=v_main_~c~0_242, ~last~0=v_~last~0_76} AuxVars[] AssignedVars[] [2021-05-03 00:16:49,401 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:49,402 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:49,409 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:49,422 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:49,425 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:49,472 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:49,490 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:49,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:49,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:50,086 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:50,087 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1153669582] [2021-05-03 00:16:50,087 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1153669582] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:50,087 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:50,087 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-03 00:16:50,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607664604] [2021-05-03 00:16:50,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-03 00:16:50,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:50,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-03 00:16:50,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:16:50,088 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:50,533 INFO L93 Difference]: Finished difference Result 229 states and 281 transitions. [2021-05-03 00:16:50,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-03 00:16:50,534 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2021-05-03 00:16:50,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:50,535 INFO L225 Difference]: With dead ends: 229 [2021-05-03 00:16:50,535 INFO L226 Difference]: Without dead ends: 148 [2021-05-03 00:16:50,536 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 10 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 551.8ms TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:16:50,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-05-03 00:16:50,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 119. [2021-05-03 00:16:50,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 109 states have (on average 1.2293577981651376) internal successors, (134), 109 states have internal predecessors, (134), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2021-05-03 00:16:50,560 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 40 [2021-05-03 00:16:50,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:50,560 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2021-05-03 00:16:50,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:50,560 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2021-05-03 00:16:50,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-03 00:16:50,561 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:50,561 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 5, 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-03 00:16:50,561 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-05-03 00:16:50,561 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:50,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:50,562 INFO L82 PathProgramCache]: Analyzing trace with hash 651130940, now seen corresponding path program 11 times [2021-05-03 00:16:50,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:50,562 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1454642391] [2021-05-03 00:16:50,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:50,570 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_251 v_~SIZE~0_72) (<= v_~last~0_77 v_main_~c~0_251)) InVars {~SIZE~0=v_~SIZE~0_72, main_~c~0=v_main_~c~0_251, ~last~0=v_~last~0_77} OutVars{~SIZE~0=v_~SIZE~0_72, main_~c~0=v_main_~c~0_251, ~last~0=v_~last~0_77} AuxVars[] AssignedVars[] [2021-05-03 00:16:50,572 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:50,574 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:50,575 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:50,589 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:50,592 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:50,626 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:50,647 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_253 v_~SIZE~0_73) (< v_main_~c~0_253 v_~last~0_78)) InVars {~SIZE~0=v_~SIZE~0_73, main_~c~0=v_main_~c~0_253, ~last~0=v_~last~0_78} OutVars{~SIZE~0=v_~SIZE~0_73, main_~c~0=v_main_~c~0_253, ~last~0=v_~last~0_78} AuxVars[] AssignedVars[] [2021-05-03 00:16:50,649 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:50,665 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:50,667 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:50,685 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:50,690 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:50,711 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:50,730 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:50,733 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_255 1) v_~SIZE~0_74) (<= v_~last~0_79 v_main_~c~0_255)) InVars {~SIZE~0=v_~SIZE~0_74, main_~c~0=v_main_~c~0_255, ~last~0=v_~last~0_79} OutVars{~SIZE~0=v_~SIZE~0_74, main_~c~0=v_main_~c~0_255, ~last~0=v_~last~0_79} AuxVars[] AssignedVars[] [2021-05-03 00:16:50,735 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:50,755 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:50,758 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:50,771 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:50,774 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:50,793 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:50,815 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_257 v_~last~0_80) (< (+ v_main_~c~0_257 1) v_~SIZE~0_75)) InVars {~SIZE~0=v_~SIZE~0_75, main_~c~0=v_main_~c~0_257, ~last~0=v_~last~0_80} OutVars{~SIZE~0=v_~SIZE~0_75, main_~c~0=v_main_~c~0_257, ~last~0=v_~last~0_80} AuxVars[] AssignedVars[] [2021-05-03 00:16:50,822 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:50,824 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:50,827 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:50,848 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:50,854 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:50,884 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:50,908 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:51,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:51,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:51,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:51,081 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:51,544 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:51,544 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1454642391] [2021-05-03 00:16:51,544 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1454642391] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:51,544 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:51,544 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-03 00:16:51,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830636077] [2021-05-03 00:16:51,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-03 00:16:51,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:51,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-03 00:16:51,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:16:51,549 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 18 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:51,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:51,922 INFO L93 Difference]: Finished difference Result 232 states and 284 transitions. [2021-05-03 00:16:51,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-03 00:16:51,923 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 18 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2021-05-03 00:16:51,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:51,924 INFO L225 Difference]: With dead ends: 232 [2021-05-03 00:16:51,924 INFO L226 Difference]: Without dead ends: 151 [2021-05-03 00:16:51,924 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 576.7ms TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:16:51,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-05-03 00:16:51,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 119. [2021-05-03 00:16:51,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 109 states have (on average 1.2293577981651376) internal successors, (134), 109 states have internal predecessors, (134), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2021-05-03 00:16:51,950 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 40 [2021-05-03 00:16:51,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:51,950 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2021-05-03 00:16:51,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 18 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:51,950 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2021-05-03 00:16:51,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-03 00:16:51,950 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:51,951 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:51,951 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-05-03 00:16:51,951 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:51,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:51,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1154307394, now seen corresponding path program 12 times [2021-05-03 00:16:51,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:51,952 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2127020929] [2021-05-03 00:16:51,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:51,962 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_81 v_main_~c~0_267) (< v_main_~c~0_267 v_~SIZE~0_76)) InVars {~SIZE~0=v_~SIZE~0_76, main_~c~0=v_main_~c~0_267, ~last~0=v_~last~0_81} OutVars{~SIZE~0=v_~SIZE~0_76, main_~c~0=v_main_~c~0_267, ~last~0=v_~last~0_81} AuxVars[] AssignedVars[] [2021-05-03 00:16:51,964 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:51,965 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:51,968 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:51,981 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:51,984 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:52,015 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:52,036 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_269 v_~last~0_82) (< v_main_~c~0_269 v_~SIZE~0_77)) InVars {~SIZE~0=v_~SIZE~0_77, main_~c~0=v_main_~c~0_269, ~last~0=v_~last~0_82} OutVars{~SIZE~0=v_~SIZE~0_77, main_~c~0=v_main_~c~0_269, ~last~0=v_~last~0_82} AuxVars[] AssignedVars[] [2021-05-03 00:16:52,038 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:52,053 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:52,057 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:52,072 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:52,077 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:52,094 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:52,111 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:52,114 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_271 1) v_~SIZE~0_78) (<= v_~last~0_83 v_main_~c~0_271)) InVars {~SIZE~0=v_~SIZE~0_78, main_~c~0=v_main_~c~0_271, ~last~0=v_~last~0_83} OutVars{~SIZE~0=v_~SIZE~0_78, main_~c~0=v_main_~c~0_271, ~last~0=v_~last~0_83} AuxVars[] AssignedVars[] [2021-05-03 00:16:52,116 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:52,135 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:52,138 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:52,149 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:52,152 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:52,170 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:52,189 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_273 1) v_~SIZE~0_79) (< v_main_~c~0_273 v_~last~0_84)) InVars {~SIZE~0=v_~SIZE~0_79, main_~c~0=v_main_~c~0_273, ~last~0=v_~last~0_84} OutVars{~SIZE~0=v_~SIZE~0_79, main_~c~0=v_main_~c~0_273, ~last~0=v_~last~0_84} AuxVars[] AssignedVars[] [2021-05-03 00:16:52,191 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:52,192 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:52,198 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:52,214 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:52,220 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:52,252 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:52,271 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:52,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:52,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:52,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:52,444 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:52,880 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:52,880 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2127020929] [2021-05-03 00:16:52,880 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2127020929] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:52,880 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:52,880 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-03 00:16:52,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772724970] [2021-05-03 00:16:52,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-03 00:16:52,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:52,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-03 00:16:52,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:16:52,881 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 19 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:53,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:53,312 INFO L93 Difference]: Finished difference Result 229 states and 281 transitions. [2021-05-03 00:16:53,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-03 00:16:53,312 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 19 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2021-05-03 00:16:53,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:53,313 INFO L225 Difference]: With dead ends: 229 [2021-05-03 00:16:53,313 INFO L226 Difference]: Without dead ends: 148 [2021-05-03 00:16:53,314 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 553.5ms TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:16:53,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-05-03 00:16:53,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 119. [2021-05-03 00:16:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 109 states have (on average 1.2293577981651376) internal successors, (134), 109 states have internal predecessors, (134), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2021-05-03 00:16:53,333 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 40 [2021-05-03 00:16:53,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:53,333 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2021-05-03 00:16:53,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 19 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:53,333 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2021-05-03 00:16:53,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-03 00:16:53,334 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:53,334 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:53,334 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-05-03 00:16:53,334 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:53,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:53,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1971955844, now seen corresponding path program 13 times [2021-05-03 00:16:53,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:53,335 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [287100566] [2021-05-03 00:16:53,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:53,342 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_85 v_main_~c~0_283) (< v_main_~c~0_283 v_~SIZE~0_80)) InVars {~SIZE~0=v_~SIZE~0_80, main_~c~0=v_main_~c~0_283, ~last~0=v_~last~0_85} OutVars{~SIZE~0=v_~SIZE~0_80, main_~c~0=v_main_~c~0_283, ~last~0=v_~last~0_85} AuxVars[] AssignedVars[] [2021-05-03 00:16:53,345 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:53,367 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:53,370 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:53,380 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:53,383 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:53,399 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:53,417 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_285 v_~last~0_86) (< v_main_~c~0_285 v_~SIZE~0_81)) InVars {~SIZE~0=v_~SIZE~0_81, main_~c~0=v_main_~c~0_285, ~last~0=v_~last~0_86} OutVars{~SIZE~0=v_~SIZE~0_81, main_~c~0=v_main_~c~0_285, ~last~0=v_~last~0_86} AuxVars[] AssignedVars[] [2021-05-03 00:16:53,419 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:53,432 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:53,449 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:53,466 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:53,471 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:53,486 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:53,514 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:53,516 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_287 1) v_~SIZE~0_82) (<= v_~last~0_87 v_main_~c~0_287)) InVars {~SIZE~0=v_~SIZE~0_82, main_~c~0=v_main_~c~0_287, ~last~0=v_~last~0_87} OutVars{~SIZE~0=v_~SIZE~0_82, main_~c~0=v_main_~c~0_287, ~last~0=v_~last~0_87} AuxVars[] AssignedVars[] [2021-05-03 00:16:53,519 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:53,520 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:53,522 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:53,532 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:53,535 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:53,567 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:53,585 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_289 v_~last~0_88) (< (+ v_main_~c~0_289 1) v_~SIZE~0_83)) InVars {~SIZE~0=v_~SIZE~0_83, main_~c~0=v_main_~c~0_289, ~last~0=v_~last~0_88} OutVars{~SIZE~0=v_~SIZE~0_83, main_~c~0=v_main_~c~0_289, ~last~0=v_~last~0_88} AuxVars[] AssignedVars[] [2021-05-03 00:16:53,587 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:53,588 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:53,606 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:53,620 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:53,625 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:53,657 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:53,678 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:53,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:53,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:53,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:53,855 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:54,285 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:54,285 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [287100566] [2021-05-03 00:16:54,285 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [287100566] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:54,286 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:54,286 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-03 00:16:54,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441441337] [2021-05-03 00:16:54,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-03 00:16:54,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:54,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-03 00:16:54,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:16:54,287 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:54,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:54,696 INFO L93 Difference]: Finished difference Result 226 states and 278 transitions. [2021-05-03 00:16:54,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-03 00:16:54,697 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2021-05-03 00:16:54,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:54,698 INFO L225 Difference]: With dead ends: 226 [2021-05-03 00:16:54,698 INFO L226 Difference]: Without dead ends: 145 [2021-05-03 00:16:54,699 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 543.5ms TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:16:54,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-05-03 00:16:54,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 119. [2021-05-03 00:16:54,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 109 states have (on average 1.2293577981651376) internal successors, (134), 109 states have internal predecessors, (134), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2021-05-03 00:16:54,736 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 40 [2021-05-03 00:16:54,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:54,736 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2021-05-03 00:16:54,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2021-05-03 00:16:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-03 00:16:54,737 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:54,737 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:54,737 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-05-03 00:16:54,737 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:54,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:54,738 INFO L82 PathProgramCache]: Analyzing trace with hash 734663550, now seen corresponding path program 14 times [2021-05-03 00:16:54,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:54,738 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [346875662] [2021-05-03 00:16:54,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:54,750 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_299 v_~SIZE~0_84) (<= v_~last~0_89 v_main_~c~0_299)) InVars {~SIZE~0=v_~SIZE~0_84, main_~c~0=v_main_~c~0_299, ~last~0=v_~last~0_89} OutVars{~SIZE~0=v_~SIZE~0_84, main_~c~0=v_main_~c~0_299, ~last~0=v_~last~0_89} AuxVars[] AssignedVars[] [2021-05-03 00:16:54,753 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:54,755 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:54,757 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:54,772 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:54,777 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:54,805 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:54,824 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_301 v_~SIZE~0_85) (< v_main_~c~0_301 v_~last~0_90)) InVars {~SIZE~0=v_~SIZE~0_85, main_~c~0=v_main_~c~0_301, ~last~0=v_~last~0_90} OutVars{~SIZE~0=v_~SIZE~0_85, main_~c~0=v_main_~c~0_301, ~last~0=v_~last~0_90} AuxVars[] AssignedVars[] [2021-05-03 00:16:54,826 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:54,827 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:54,829 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:54,842 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:54,847 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:54,872 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:54,890 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:54,892 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_91 v_main_~c~0_303) (< (+ v_main_~c~0_303 1) v_~SIZE~0_86)) InVars {~SIZE~0=v_~SIZE~0_86, main_~c~0=v_main_~c~0_303, ~last~0=v_~last~0_91} OutVars{~SIZE~0=v_~SIZE~0_86, main_~c~0=v_main_~c~0_303, ~last~0=v_~last~0_91} AuxVars[] AssignedVars[] [2021-05-03 00:16:54,894 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:54,911 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:54,913 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:54,924 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:54,927 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:54,943 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:54,961 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_305 1) v_~SIZE~0_87) (< v_main_~c~0_305 v_~last~0_92)) InVars {~SIZE~0=v_~SIZE~0_87, main_~c~0=v_main_~c~0_305, ~last~0=v_~last~0_92} OutVars{~SIZE~0=v_~SIZE~0_87, main_~c~0=v_main_~c~0_305, ~last~0=v_~last~0_92} AuxVars[] AssignedVars[] [2021-05-03 00:16:54,963 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:54,964 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:54,966 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:54,979 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:54,984 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:55,018 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:55,036 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:55,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:55,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:55,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:55,187 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:55,670 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:55,671 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [346875662] [2021-05-03 00:16:55,671 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [346875662] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:55,671 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:55,671 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:16:55,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210043858] [2021-05-03 00:16:55,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:16:55,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:55,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:16:55,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:16:55,672 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:56,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:56,168 INFO L93 Difference]: Finished difference Result 223 states and 275 transitions. [2021-05-03 00:16:56,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-03 00:16:56,169 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2021-05-03 00:16:56,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:56,170 INFO L225 Difference]: With dead ends: 223 [2021-05-03 00:16:56,170 INFO L226 Difference]: Without dead ends: 142 [2021-05-03 00:16:56,171 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 588.7ms TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:16:56,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-05-03 00:16:56,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 119. [2021-05-03 00:16:56,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 109 states have (on average 1.2293577981651376) internal successors, (134), 109 states have internal predecessors, (134), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2021-05-03 00:16:56,197 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 40 [2021-05-03 00:16:56,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:56,198 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2021-05-03 00:16:56,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2021-05-03 00:16:56,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-03 00:16:56,198 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:56,198 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 5, 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-03 00:16:56,198 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-05-03 00:16:56,199 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:56,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:56,199 INFO L82 PathProgramCache]: Analyzing trace with hash -276453700, now seen corresponding path program 15 times [2021-05-03 00:16:56,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:56,199 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [75299424] [2021-05-03 00:16:56,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:56,207 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_93 v_main_~c~0_315) (< v_main_~c~0_315 v_~SIZE~0_88)) InVars {~SIZE~0=v_~SIZE~0_88, main_~c~0=v_main_~c~0_315, ~last~0=v_~last~0_93} OutVars{~SIZE~0=v_~SIZE~0_88, main_~c~0=v_main_~c~0_315, ~last~0=v_~last~0_93} AuxVars[] AssignedVars[] [2021-05-03 00:16:56,210 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:56,227 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:56,237 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:56,254 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:56,257 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:56,276 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:56,294 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_317 v_~last~0_94) (< v_main_~c~0_317 v_~SIZE~0_89)) InVars {~SIZE~0=v_~SIZE~0_89, main_~c~0=v_main_~c~0_317, ~last~0=v_~last~0_94} OutVars{~SIZE~0=v_~SIZE~0_89, main_~c~0=v_main_~c~0_317, ~last~0=v_~last~0_94} AuxVars[] AssignedVars[] [2021-05-03 00:16:56,296 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:56,297 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:56,299 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:56,312 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:56,317 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:56,341 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:56,359 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:56,360 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_319 1) v_~SIZE~0_90) (< v_main_~c~0_319 v_~last~0_95)) InVars {~SIZE~0=v_~SIZE~0_90, main_~c~0=v_main_~c~0_319, ~last~0=v_~last~0_95} OutVars{~SIZE~0=v_~SIZE~0_90, main_~c~0=v_main_~c~0_319, ~last~0=v_~last~0_95} AuxVars[] AssignedVars[] [2021-05-03 00:16:56,362 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:56,375 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:56,377 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:56,390 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:56,395 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:56,409 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:56,435 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:56,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:56,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:56,587 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:57,029 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:57,029 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [75299424] [2021-05-03 00:16:57,029 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [75299424] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:57,030 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:57,030 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-03 00:16:57,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982295824] [2021-05-03 00:16:57,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-03 00:16:57,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:57,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-03 00:16:57,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:16:57,031 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 22 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:57,521 INFO L93 Difference]: Finished difference Result 222 states and 275 transitions. [2021-05-03 00:16:57,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-03 00:16:57,525 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 22 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2021-05-03 00:16:57,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:57,526 INFO L225 Difference]: With dead ends: 222 [2021-05-03 00:16:57,526 INFO L226 Difference]: Without dead ends: 141 [2021-05-03 00:16:57,527 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 549.0ms TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:16:57,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-05-03 00:16:57,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 120. [2021-05-03 00:16:57,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 110 states have (on average 1.2363636363636363) internal successors, (136), 110 states have internal predecessors, (136), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:57,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 147 transitions. [2021-05-03 00:16:57,550 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 147 transitions. Word has length 40 [2021-05-03 00:16:57,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:57,550 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 147 transitions. [2021-05-03 00:16:57,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 22 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:57,550 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2021-05-03 00:16:57,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-03 00:16:57,551 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:57,551 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:57,551 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-05-03 00:16:57,551 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:57,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:57,551 INFO L82 PathProgramCache]: Analyzing trace with hash -441994050, now seen corresponding path program 6 times [2021-05-03 00:16:57,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:57,552 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [726608508] [2021-05-03 00:16:57,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:57,557 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_329 v_~SIZE~0_91) (< v_main_~c~0_329 v_~last~0_96)) InVars {~SIZE~0=v_~SIZE~0_91, main_~c~0=v_main_~c~0_329, ~last~0=v_~last~0_96} OutVars{~SIZE~0=v_~SIZE~0_91, main_~c~0=v_main_~c~0_329, ~last~0=v_~last~0_96} AuxVars[] AssignedVars[] [2021-05-03 00:16:57,559 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:16:57,560 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:57,562 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:57,576 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:57,580 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:57,606 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:16:57,623 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:57,624 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_331 v_~last~0_97) (< (+ v_main_~c~0_331 1) v_~SIZE~0_92)) InVars {~SIZE~0=v_~SIZE~0_92, main_~c~0=v_main_~c~0_331, ~last~0=v_~last~0_97} OutVars{~SIZE~0=v_~SIZE~0_92, main_~c~0=v_main_~c~0_331, ~last~0=v_~last~0_97} AuxVars[] AssignedVars[] [2021-05-03 00:16:57,626 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:57,627 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:57,629 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:57,642 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:57,647 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:57,695 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:57,720 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:57,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:57,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:57,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-03 00:16:58,357 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:58,358 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [726608508] [2021-05-03 00:16:58,358 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [726608508] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:58,358 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:58,358 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:16:58,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86053683] [2021-05-03 00:16:58,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:16:58,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:58,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:16:58,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:16:58,359 INFO L87 Difference]: Start difference. First operand 120 states and 147 transitions. Second operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:59,022 INFO L93 Difference]: Finished difference Result 227 states and 281 transitions. [2021-05-03 00:16:59,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:16:59,023 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2021-05-03 00:16:59,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:59,024 INFO L225 Difference]: With dead ends: 227 [2021-05-03 00:16:59,024 INFO L226 Difference]: Without dead ends: 146 [2021-05-03 00:16:59,025 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 776.2ms TimeCoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:16:59,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-05-03 00:16:59,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2021-05-03 00:16:59,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 112 states have (on average 1.2321428571428572) internal successors, (138), 112 states have internal predecessors, (138), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:16:59,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2021-05-03 00:16:59,046 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 40 [2021-05-03 00:16:59,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:59,046 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2021-05-03 00:16:59,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:16:59,046 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2021-05-03 00:16:59,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-03 00:16:59,046 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:59,046 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:59,046 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-05-03 00:16:59,047 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:59,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:59,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1166496317, now seen corresponding path program 7 times [2021-05-03 00:16:59,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:59,047 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1613027877] [2021-05-03 00:16:59,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:59,053 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_98 v_main_~c~0_340) (< v_main_~c~0_340 v_~SIZE~0_93)) InVars {~SIZE~0=v_~SIZE~0_93, main_~c~0=v_main_~c~0_340, ~last~0=v_~last~0_98} OutVars{~SIZE~0=v_~SIZE~0_93, main_~c~0=v_main_~c~0_340, ~last~0=v_~last~0_98} AuxVars[] AssignedVars[] [2021-05-03 00:16:59,057 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:16:59,058 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:59,059 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:59,069 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:59,072 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:59,099 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:16:59,116 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:59,119 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_99 v_main_~c~0_342) (< (+ v_main_~c~0_342 1) v_~SIZE~0_94)) InVars {~SIZE~0=v_~SIZE~0_94, main_~c~0=v_main_~c~0_342, ~last~0=v_~last~0_99} OutVars{~SIZE~0=v_~SIZE~0_94, main_~c~0=v_main_~c~0_342, ~last~0=v_~last~0_99} AuxVars[] AssignedVars[] [2021-05-03 00:16:59,122 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:16:59,123 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:59,125 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:59,137 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:16:59,140 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:16:59,169 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:16:59,186 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:59,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:59,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:16:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:59,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:59,894 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:59,895 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1613027877] [2021-05-03 00:16:59,895 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1613027877] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:59,895 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:59,895 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-03 00:16:59,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274434637] [2021-05-03 00:16:59,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-03 00:16:59,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:59,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-03 00:16:59,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:16:59,896 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 18 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:00,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:00,372 INFO L93 Difference]: Finished difference Result 238 states and 291 transitions. [2021-05-03 00:17:00,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-03 00:17:00,372 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 18 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2021-05-03 00:17:00,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:00,373 INFO L225 Difference]: With dead ends: 238 [2021-05-03 00:17:00,373 INFO L226 Difference]: Without dead ends: 157 [2021-05-03 00:17:00,374 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 668.8ms TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:17:00,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-05-03 00:17:00,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 125. [2021-05-03 00:17:00,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 115 states have internal predecessors, (141), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:00,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2021-05-03 00:17:00,402 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 43 [2021-05-03 00:17:00,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:00,403 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2021-05-03 00:17:00,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 18 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:00,403 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2021-05-03 00:17:00,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-03 00:17:00,403 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:00,403 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 6, 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-03 00:17:00,403 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-05-03 00:17:00,404 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:00,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:00,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1742267585, now seen corresponding path program 16 times [2021-05-03 00:17:00,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:00,404 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [948657430] [2021-05-03 00:17:00,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:00,416 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_352 v_~SIZE~0_95) (<= v_~last~0_100 v_main_~c~0_352)) InVars {~SIZE~0=v_~SIZE~0_95, main_~c~0=v_main_~c~0_352, ~last~0=v_~last~0_100} OutVars{~SIZE~0=v_~SIZE~0_95, main_~c~0=v_main_~c~0_352, ~last~0=v_~last~0_100} AuxVars[] AssignedVars[] [2021-05-03 00:17:00,420 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:00,421 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:00,429 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:00,441 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:00,445 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:00,479 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:00,499 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_354 v_~SIZE~0_96) (< v_main_~c~0_354 v_~last~0_101)) InVars {~SIZE~0=v_~SIZE~0_96, main_~c~0=v_main_~c~0_354, ~last~0=v_~last~0_101} OutVars{~SIZE~0=v_~SIZE~0_96, main_~c~0=v_main_~c~0_354, ~last~0=v_~last~0_101} AuxVars[] AssignedVars[] [2021-05-03 00:17:00,501 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:00,502 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:00,505 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:00,520 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:00,526 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:00,554 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:00,575 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:00,580 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_102 v_main_~c~0_356) (< (+ v_main_~c~0_356 1) v_~SIZE~0_97)) InVars {~SIZE~0=v_~SIZE~0_97, main_~c~0=v_main_~c~0_356, ~last~0=v_~last~0_102} OutVars{~SIZE~0=v_~SIZE~0_97, main_~c~0=v_main_~c~0_356, ~last~0=v_~last~0_102} AuxVars[] AssignedVars[] [2021-05-03 00:17:00,589 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:00,609 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:00,614 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:00,627 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:00,630 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:00,654 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:00,675 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_358 v_~last~0_103) (< (+ v_main_~c~0_358 1) v_~SIZE~0_98)) InVars {~SIZE~0=v_~SIZE~0_98, main_~c~0=v_main_~c~0_358, ~last~0=v_~last~0_103} OutVars{~SIZE~0=v_~SIZE~0_98, main_~c~0=v_main_~c~0_358, ~last~0=v_~last~0_103} AuxVars[] AssignedVars[] [2021-05-03 00:17:00,677 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:00,678 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:00,680 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:00,695 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:00,701 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:00,730 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:00,749 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:00,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:00,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:00,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:00,908 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:01,501 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:01,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [948657430] [2021-05-03 00:17:01,501 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [948657430] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:01,501 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:01,502 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-03 00:17:01,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193601846] [2021-05-03 00:17:01,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-03 00:17:01,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:01,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-03 00:17:01,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:17:01,503 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:02,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:02,093 INFO L93 Difference]: Finished difference Result 241 states and 294 transitions. [2021-05-03 00:17:02,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-03 00:17:02,102 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2021-05-03 00:17:02,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:02,103 INFO L225 Difference]: With dead ends: 241 [2021-05-03 00:17:02,103 INFO L226 Difference]: Without dead ends: 160 [2021-05-03 00:17:02,104 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 12 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 700.0ms TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:17:02,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-05-03 00:17:02,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 125. [2021-05-03 00:17:02,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 115 states have internal predecessors, (141), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2021-05-03 00:17:02,131 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 43 [2021-05-03 00:17:02,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:02,131 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2021-05-03 00:17:02,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2021-05-03 00:17:02,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-03 00:17:02,132 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:02,132 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:02,132 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2021-05-03 00:17:02,132 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:02,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:02,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1680227971, now seen corresponding path program 17 times [2021-05-03 00:17:02,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:02,133 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [701684223] [2021-05-03 00:17:02,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:02,141 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_369 v_~SIZE~0_99) (<= v_~last~0_104 v_main_~c~0_369)) InVars {~SIZE~0=v_~SIZE~0_99, main_~c~0=v_main_~c~0_369, ~last~0=v_~last~0_104} OutVars{~SIZE~0=v_~SIZE~0_99, main_~c~0=v_main_~c~0_369, ~last~0=v_~last~0_104} AuxVars[] AssignedVars[] [2021-05-03 00:17:02,143 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:02,160 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:02,162 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:02,175 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:02,177 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:02,196 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:02,216 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_371 v_~SIZE~0_100) (< v_main_~c~0_371 v_~last~0_105)) InVars {~SIZE~0=v_~SIZE~0_100, main_~c~0=v_main_~c~0_371, ~last~0=v_~last~0_105} OutVars{~SIZE~0=v_~SIZE~0_100, main_~c~0=v_main_~c~0_371, ~last~0=v_~last~0_105} AuxVars[] AssignedVars[] [2021-05-03 00:17:02,217 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:02,218 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:02,234 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:02,250 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:02,255 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:02,281 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:02,300 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:02,302 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_106 v_main_~c~0_373) (< (+ v_main_~c~0_373 1) v_~SIZE~0_101)) InVars {~SIZE~0=v_~SIZE~0_101, main_~c~0=v_main_~c~0_373, ~last~0=v_~last~0_106} OutVars{~SIZE~0=v_~SIZE~0_101, main_~c~0=v_main_~c~0_373, ~last~0=v_~last~0_106} AuxVars[] AssignedVars[] [2021-05-03 00:17:02,318 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:02,339 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:02,341 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:02,355 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:02,362 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:02,378 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:02,398 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_375 1) v_~SIZE~0_102) (< v_main_~c~0_375 v_~last~0_107)) InVars {~SIZE~0=v_~SIZE~0_102, main_~c~0=v_main_~c~0_375, ~last~0=v_~last~0_107} OutVars{~SIZE~0=v_~SIZE~0_102, main_~c~0=v_main_~c~0_375, ~last~0=v_~last~0_107} AuxVars[] AssignedVars[] [2021-05-03 00:17:02,401 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:02,402 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:02,403 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:02,416 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:02,420 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:02,447 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:02,473 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:02,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:02,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:02,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:02,638 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:03,108 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:03,108 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [701684223] [2021-05-03 00:17:03,108 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [701684223] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:03,108 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:03,108 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-03 00:17:03,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436462729] [2021-05-03 00:17:03,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-03 00:17:03,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:03,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-03 00:17:03,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:17:03,109 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 20 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:03,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:03,693 INFO L93 Difference]: Finished difference Result 238 states and 291 transitions. [2021-05-03 00:17:03,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-03 00:17:03,694 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 20 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2021-05-03 00:17:03,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:03,695 INFO L225 Difference]: With dead ends: 238 [2021-05-03 00:17:03,695 INFO L226 Difference]: Without dead ends: 157 [2021-05-03 00:17:03,695 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 11 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 596.8ms TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:17:03,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-05-03 00:17:03,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 125. [2021-05-03 00:17:03,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 115 states have internal predecessors, (141), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:03,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2021-05-03 00:17:03,730 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 43 [2021-05-03 00:17:03,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:03,730 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2021-05-03 00:17:03,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 20 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:03,730 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2021-05-03 00:17:03,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-03 00:17:03,731 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:03,731 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:03,731 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-05-03 00:17:03,731 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:03,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:03,732 INFO L82 PathProgramCache]: Analyzing trace with hash 809300991, now seen corresponding path program 18 times [2021-05-03 00:17:03,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:03,732 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1124285668] [2021-05-03 00:17:03,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:03,739 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_108 v_main_~c~0_386) (< v_main_~c~0_386 v_~SIZE~0_103)) InVars {~SIZE~0=v_~SIZE~0_103, main_~c~0=v_main_~c~0_386, ~last~0=v_~last~0_108} OutVars{~SIZE~0=v_~SIZE~0_103, main_~c~0=v_main_~c~0_386, ~last~0=v_~last~0_108} AuxVars[] AssignedVars[] [2021-05-03 00:17:03,742 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:03,766 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:03,769 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:03,784 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:03,787 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:03,807 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:03,828 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_388 v_~last~0_109) (< v_main_~c~0_388 v_~SIZE~0_104)) InVars {~SIZE~0=v_~SIZE~0_104, main_~c~0=v_main_~c~0_388, ~last~0=v_~last~0_109} OutVars{~SIZE~0=v_~SIZE~0_104, main_~c~0=v_main_~c~0_388, ~last~0=v_~last~0_109} AuxVars[] AssignedVars[] [2021-05-03 00:17:03,830 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:03,831 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:03,833 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:03,846 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:03,851 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:03,878 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:03,897 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:03,900 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_390 1) v_~SIZE~0_105) (<= v_~last~0_110 v_main_~c~0_390)) InVars {~SIZE~0=v_~SIZE~0_105, main_~c~0=v_main_~c~0_390, ~last~0=v_~last~0_110} OutVars{~SIZE~0=v_~SIZE~0_105, main_~c~0=v_main_~c~0_390, ~last~0=v_~last~0_110} AuxVars[] AssignedVars[] [2021-05-03 00:17:03,903 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:03,905 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:03,908 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:03,923 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:03,927 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:03,964 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:03,986 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_392 v_~last~0_111) (< (+ v_main_~c~0_392 1) v_~SIZE~0_106)) InVars {~SIZE~0=v_~SIZE~0_106, main_~c~0=v_main_~c~0_392, ~last~0=v_~last~0_111} OutVars{~SIZE~0=v_~SIZE~0_106, main_~c~0=v_main_~c~0_392, ~last~0=v_~last~0_111} AuxVars[] AssignedVars[] [2021-05-03 00:17:03,988 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:03,990 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:03,992 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:04,009 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:04,016 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:04,047 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:04,069 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:04,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:04,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:04,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:04,246 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:04,848 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:04,848 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1124285668] [2021-05-03 00:17:04,848 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1124285668] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:04,848 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:04,854 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:17:04,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759023775] [2021-05-03 00:17:04,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:17:04,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:04,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:17:04,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:17:04,855 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 21 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:05,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:05,380 INFO L93 Difference]: Finished difference Result 235 states and 288 transitions. [2021-05-03 00:17:05,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-03 00:17:05,381 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 21 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2021-05-03 00:17:05,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:05,382 INFO L225 Difference]: With dead ends: 235 [2021-05-03 00:17:05,382 INFO L226 Difference]: Without dead ends: 154 [2021-05-03 00:17:05,383 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 719.5ms TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:17:05,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-05-03 00:17:05,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 125. [2021-05-03 00:17:05,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 115 states have internal predecessors, (141), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:05,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2021-05-03 00:17:05,408 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 43 [2021-05-03 00:17:05,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:05,408 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2021-05-03 00:17:05,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 1.608695652173913) internal successors, (37), 21 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2021-05-03 00:17:05,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-03 00:17:05,409 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:05,409 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:05,409 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2021-05-03 00:17:05,409 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:05,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:05,409 INFO L82 PathProgramCache]: Analyzing trace with hash -8347459, now seen corresponding path program 19 times [2021-05-03 00:17:05,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:05,409 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1760429579] [2021-05-03 00:17:05,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:05,417 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_403 v_~SIZE~0_107) (<= v_~last~0_112 v_main_~c~0_403)) InVars {~SIZE~0=v_~SIZE~0_107, main_~c~0=v_main_~c~0_403, ~last~0=v_~last~0_112} OutVars{~SIZE~0=v_~SIZE~0_107, main_~c~0=v_main_~c~0_403, ~last~0=v_~last~0_112} AuxVars[] AssignedVars[] [2021-05-03 00:17:05,419 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:05,448 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:05,453 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:05,469 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:05,472 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:05,489 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:05,508 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_405 v_~SIZE~0_108) (< v_main_~c~0_405 v_~last~0_113)) InVars {~SIZE~0=v_~SIZE~0_108, main_~c~0=v_main_~c~0_405, ~last~0=v_~last~0_113} OutVars{~SIZE~0=v_~SIZE~0_108, main_~c~0=v_main_~c~0_405, ~last~0=v_~last~0_113} AuxVars[] AssignedVars[] [2021-05-03 00:17:05,509 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:05,510 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:05,521 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:05,535 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:05,540 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:05,565 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:05,584 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:05,586 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_407 1) v_~SIZE~0_109) (<= v_~last~0_114 v_main_~c~0_407)) InVars {~SIZE~0=v_~SIZE~0_109, main_~c~0=v_main_~c~0_407, ~last~0=v_~last~0_114} OutVars{~SIZE~0=v_~SIZE~0_109, main_~c~0=v_main_~c~0_407, ~last~0=v_~last~0_114} AuxVars[] AssignedVars[] [2021-05-03 00:17:05,589 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:05,591 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:05,593 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:05,605 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:05,609 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:05,640 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:05,658 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_409 v_~last~0_115) (< (+ v_main_~c~0_409 1) v_~SIZE~0_110)) InVars {~SIZE~0=v_~SIZE~0_110, main_~c~0=v_main_~c~0_409, ~last~0=v_~last~0_115} OutVars{~SIZE~0=v_~SIZE~0_110, main_~c~0=v_main_~c~0_409, ~last~0=v_~last~0_115} AuxVars[] AssignedVars[] [2021-05-03 00:17:05,659 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:05,660 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:05,662 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:05,676 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:05,681 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:05,706 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:05,723 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:05,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:05,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:05,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:05,886 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:06,557 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:06,557 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1760429579] [2021-05-03 00:17:06,557 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1760429579] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:06,557 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:06,557 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-03 00:17:06,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661560827] [2021-05-03 00:17:06,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-03 00:17:06,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:06,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-03 00:17:06,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:17:06,559 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:07,074 INFO L93 Difference]: Finished difference Result 232 states and 285 transitions. [2021-05-03 00:17:07,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-03 00:17:07,075 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2021-05-03 00:17:07,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:07,076 INFO L225 Difference]: With dead ends: 232 [2021-05-03 00:17:07,076 INFO L226 Difference]: Without dead ends: 151 [2021-05-03 00:17:07,077 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 772.9ms TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:17:07,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-05-03 00:17:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 125. [2021-05-03 00:17:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 115 states have internal predecessors, (141), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2021-05-03 00:17:07,101 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 43 [2021-05-03 00:17:07,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:07,101 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2021-05-03 00:17:07,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2021-05-03 00:17:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-03 00:17:07,102 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:07,102 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:07,102 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2021-05-03 00:17:07,102 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:07,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:07,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1596695361, now seen corresponding path program 20 times [2021-05-03 00:17:07,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:07,103 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [99381562] [2021-05-03 00:17:07,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:07,121 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_116 v_main_~c~0_420) (< v_main_~c~0_420 v_~SIZE~0_111)) InVars {~SIZE~0=v_~SIZE~0_111, main_~c~0=v_main_~c~0_420, ~last~0=v_~last~0_116} OutVars{~SIZE~0=v_~SIZE~0_111, main_~c~0=v_main_~c~0_420, ~last~0=v_~last~0_116} AuxVars[] AssignedVars[] [2021-05-03 00:17:07,123 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:07,125 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:07,126 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:07,138 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:07,141 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:07,169 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:07,189 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_422 v_~last~0_117) (< v_main_~c~0_422 v_~SIZE~0_112)) InVars {~SIZE~0=v_~SIZE~0_112, main_~c~0=v_main_~c~0_422, ~last~0=v_~last~0_117} OutVars{~SIZE~0=v_~SIZE~0_112, main_~c~0=v_main_~c~0_422, ~last~0=v_~last~0_117} AuxVars[] AssignedVars[] [2021-05-03 00:17:07,191 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:07,192 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:07,194 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:07,213 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:07,218 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:07,254 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:07,279 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:07,282 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_118 v_main_~c~0_424) (< (+ v_main_~c~0_424 1) v_~SIZE~0_113)) InVars {~SIZE~0=v_~SIZE~0_113, main_~c~0=v_main_~c~0_424, ~last~0=v_~last~0_118} OutVars{~SIZE~0=v_~SIZE~0_113, main_~c~0=v_main_~c~0_424, ~last~0=v_~last~0_118} AuxVars[] AssignedVars[] [2021-05-03 00:17:07,284 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:07,286 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:07,288 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:07,300 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:07,303 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:07,343 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:07,366 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_426 1) v_~SIZE~0_114) (< v_main_~c~0_426 v_~last~0_119)) InVars {~SIZE~0=v_~SIZE~0_114, main_~c~0=v_main_~c~0_426, ~last~0=v_~last~0_119} OutVars{~SIZE~0=v_~SIZE~0_114, main_~c~0=v_main_~c~0_426, ~last~0=v_~last~0_119} AuxVars[] AssignedVars[] [2021-05-03 00:17:07,369 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:07,386 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:07,388 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:07,406 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:07,412 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:07,431 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:07,454 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:07,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:07,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:07,639 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:08,294 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:08,295 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [99381562] [2021-05-03 00:17:08,295 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [99381562] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:08,295 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:08,295 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:17:08,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934923339] [2021-05-03 00:17:08,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:17:08,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:08,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:17:08,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:17:08,296 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand has 25 states, 25 states have (on average 1.48) internal successors, (37), 23 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:08,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:08,929 INFO L93 Difference]: Finished difference Result 229 states and 282 transitions. [2021-05-03 00:17:08,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-03 00:17:08,929 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 23 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2021-05-03 00:17:08,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:08,930 INFO L225 Difference]: With dead ends: 229 [2021-05-03 00:17:08,930 INFO L226 Difference]: Without dead ends: 148 [2021-05-03 00:17:08,931 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 792.0ms TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:17:08,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-05-03 00:17:08,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 125. [2021-05-03 00:17:08,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 115 states have internal predecessors, (141), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2021-05-03 00:17:08,968 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 43 [2021-05-03 00:17:08,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:08,969 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2021-05-03 00:17:08,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 23 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:08,969 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2021-05-03 00:17:08,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-03 00:17:08,969 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:08,969 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 6, 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-03 00:17:08,970 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2021-05-03 00:17:08,970 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:08,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:08,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1687154685, now seen corresponding path program 21 times [2021-05-03 00:17:08,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:08,970 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1617476093] [2021-05-03 00:17:08,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:08,986 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_437 v_~SIZE~0_115) (<= v_~last~0_120 v_main_~c~0_437)) InVars {~SIZE~0=v_~SIZE~0_115, main_~c~0=v_main_~c~0_437, ~last~0=v_~last~0_120} OutVars{~SIZE~0=v_~SIZE~0_115, main_~c~0=v_main_~c~0_437, ~last~0=v_~last~0_120} AuxVars[] AssignedVars[] [2021-05-03 00:17:08,989 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:08,990 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:08,993 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:09,009 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:09,012 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:09,049 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:09,072 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_439 v_~last~0_121) (< v_main_~c~0_439 v_~SIZE~0_116)) InVars {~SIZE~0=v_~SIZE~0_116, main_~c~0=v_main_~c~0_439, ~last~0=v_~last~0_121} OutVars{~SIZE~0=v_~SIZE~0_116, main_~c~0=v_main_~c~0_439, ~last~0=v_~last~0_121} AuxVars[] AssignedVars[] [2021-05-03 00:17:09,074 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:09,076 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:09,078 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:09,094 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:09,100 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:09,137 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:09,158 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:09,160 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_441 v_~last~0_122) (< (+ v_main_~c~0_441 1) v_~SIZE~0_117)) InVars {~SIZE~0=v_~SIZE~0_117, main_~c~0=v_main_~c~0_441, ~last~0=v_~last~0_122} OutVars{~SIZE~0=v_~SIZE~0_117, main_~c~0=v_main_~c~0_441, ~last~0=v_~last~0_122} AuxVars[] AssignedVars[] [2021-05-03 00:17:09,163 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:09,180 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:09,182 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:09,199 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:09,205 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:09,222 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:09,242 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:09,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:09,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:09,427 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:10,028 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:10,029 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1617476093] [2021-05-03 00:17:10,029 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1617476093] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:10,029 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:10,029 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:17:10,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044905269] [2021-05-03 00:17:10,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:17:10,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:10,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:17:10,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:17:10,030 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 24 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:10,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:10,526 INFO L93 Difference]: Finished difference Result 228 states and 282 transitions. [2021-05-03 00:17:10,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:17:10,527 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 24 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2021-05-03 00:17:10,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:10,528 INFO L225 Difference]: With dead ends: 228 [2021-05-03 00:17:10,528 INFO L226 Difference]: Without dead ends: 147 [2021-05-03 00:17:10,529 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 728.1ms TimeCoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:17:10,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-05-03 00:17:10,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 126. [2021-05-03 00:17:10,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 116 states have (on average 1.2327586206896552) internal successors, (143), 116 states have internal predecessors, (143), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2021-05-03 00:17:10,563 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 43 [2021-05-03 00:17:10,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:10,564 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2021-05-03 00:17:10,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 24 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:10,564 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2021-05-03 00:17:10,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-03 00:17:10,564 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:10,564 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:10,565 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2021-05-03 00:17:10,565 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:10,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:10,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1521614335, now seen corresponding path program 7 times [2021-05-03 00:17:10,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:10,565 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [486302755] [2021-05-03 00:17:10,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:10,571 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_452 v_~SIZE~0_118) (< v_main_~c~0_452 v_~last~0_123)) InVars {~SIZE~0=v_~SIZE~0_118, main_~c~0=v_main_~c~0_452, ~last~0=v_~last~0_123} OutVars{~SIZE~0=v_~SIZE~0_118, main_~c~0=v_main_~c~0_452, ~last~0=v_~last~0_123} AuxVars[] AssignedVars[] [2021-05-03 00:17:10,573 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:10,589 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:10,591 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:10,607 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:10,612 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:10,633 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:10,653 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:10,655 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_454 v_~last~0_124) (< (+ v_main_~c~0_454 1) v_~SIZE~0_119)) InVars {~SIZE~0=v_~SIZE~0_119, main_~c~0=v_main_~c~0_454, ~last~0=v_~last~0_124} OutVars{~SIZE~0=v_~SIZE~0_119, main_~c~0=v_main_~c~0_454, ~last~0=v_~last~0_124} AuxVars[] AssignedVars[] [2021-05-03 00:17:10,657 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:10,674 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:10,676 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:10,693 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:10,699 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:10,715 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:10,736 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:10,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:10,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:10,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:11,561 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:11,561 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [486302755] [2021-05-03 00:17:11,561 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [486302755] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:11,561 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:11,561 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:17:11,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318603696] [2021-05-03 00:17:11,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:17:11,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:11,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:17:11,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:17:11,562 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 24 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:12,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:12,332 INFO L93 Difference]: Finished difference Result 234 states and 289 transitions. [2021-05-03 00:17:12,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:17:12,333 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 24 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2021-05-03 00:17:12,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:12,333 INFO L225 Difference]: With dead ends: 234 [2021-05-03 00:17:12,333 INFO L226 Difference]: Without dead ends: 153 [2021-05-03 00:17:12,334 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1004.7ms TimeCoverageRelationStatistics Valid=186, Invalid=1146, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:17:12,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-05-03 00:17:12,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 128. [2021-05-03 00:17:12,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 118 states have (on average 1.228813559322034) internal successors, (145), 118 states have internal predecessors, (145), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 156 transitions. [2021-05-03 00:17:12,371 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 156 transitions. Word has length 43 [2021-05-03 00:17:12,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:12,371 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 156 transitions. [2021-05-03 00:17:12,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 24 states have internal predecessors, (37), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:12,372 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 156 transitions. [2021-05-03 00:17:12,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-03 00:17:12,372 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:12,372 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:12,372 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2021-05-03 00:17:12,372 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:12,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:12,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1294562718, now seen corresponding path program 8 times [2021-05-03 00:17:12,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:12,373 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1665224104] [2021-05-03 00:17:12,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:12,379 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_464 v_~SIZE~0_120) (<= v_~last~0_125 v_main_~c~0_464)) InVars {~SIZE~0=v_~SIZE~0_120, main_~c~0=v_main_~c~0_464, ~last~0=v_~last~0_125} OutVars{~SIZE~0=v_~SIZE~0_120, main_~c~0=v_main_~c~0_464, ~last~0=v_~last~0_125} AuxVars[] AssignedVars[] [2021-05-03 00:17:12,381 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:12,383 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:12,385 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:12,398 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:12,402 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:12,435 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:12,453 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:12,457 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_466 1) v_~SIZE~0_121) (<= v_~last~0_126 v_main_~c~0_466)) InVars {~SIZE~0=v_~SIZE~0_121, main_~c~0=v_main_~c~0_466, ~last~0=v_~last~0_126} OutVars{~SIZE~0=v_~SIZE~0_121, main_~c~0=v_main_~c~0_466, ~last~0=v_~last~0_126} AuxVars[] AssignedVars[] [2021-05-03 00:17:12,460 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:12,486 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:12,488 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:12,503 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:12,506 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:12,522 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:12,539 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:12,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:12,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:13,021 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:13,021 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1665224104] [2021-05-03 00:17:13,021 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1665224104] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:13,021 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:13,021 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-03 00:17:13,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465910583] [2021-05-03 00:17:13,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-03 00:17:13,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:13,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-03 00:17:13,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:17:13,022 INFO L87 Difference]: Start difference. First operand 128 states and 156 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:13,557 INFO L93 Difference]: Finished difference Result 288 states and 352 transitions. [2021-05-03 00:17:13,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-03 00:17:13,557 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2021-05-03 00:17:13,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:13,560 INFO L225 Difference]: With dead ends: 288 [2021-05-03 00:17:13,560 INFO L226 Difference]: Without dead ends: 207 [2021-05-03 00:17:13,561 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 15 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 433.9ms TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:17:13,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-05-03 00:17:13,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 161. [2021-05-03 00:17:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 151 states have (on average 1.1788079470198676) internal successors, (178), 151 states have internal predecessors, (178), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 189 transitions. [2021-05-03 00:17:13,610 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 189 transitions. Word has length 46 [2021-05-03 00:17:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:13,610 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 189 transitions. [2021-05-03 00:17:13,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:13,611 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 189 transitions. [2021-05-03 00:17:13,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-03 00:17:13,613 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:13,613 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 7, 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-03 00:17:13,613 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2021-05-03 00:17:13,613 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:13,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:13,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1569322332, now seen corresponding path program 22 times [2021-05-03 00:17:13,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:13,614 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [518038987] [2021-05-03 00:17:13,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:13,625 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_477 v_~SIZE~0_122) (<= v_~last~0_127 v_main_~c~0_477)) InVars {~SIZE~0=v_~SIZE~0_122, main_~c~0=v_main_~c~0_477, ~last~0=v_~last~0_127} OutVars{~SIZE~0=v_~SIZE~0_122, main_~c~0=v_main_~c~0_477, ~last~0=v_~last~0_127} AuxVars[] AssignedVars[] [2021-05-03 00:17:13,627 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:13,629 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:13,631 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:13,643 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:13,647 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:13,684 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:13,707 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_479 v_~SIZE~0_123) (< v_main_~c~0_479 v_~last~0_128)) InVars {~SIZE~0=v_~SIZE~0_123, main_~c~0=v_main_~c~0_479, ~last~0=v_~last~0_128} OutVars{~SIZE~0=v_~SIZE~0_123, main_~c~0=v_main_~c~0_479, ~last~0=v_~last~0_128} AuxVars[] AssignedVars[] [2021-05-03 00:17:13,715 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:13,731 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:13,733 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:13,750 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:13,754 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:13,771 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:13,789 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:13,791 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_481 1) v_~SIZE~0_124) (<= v_~last~0_129 v_main_~c~0_481)) InVars {~SIZE~0=v_~SIZE~0_124, main_~c~0=v_main_~c~0_481, ~last~0=v_~last~0_129} OutVars{~SIZE~0=v_~SIZE~0_124, main_~c~0=v_main_~c~0_481, ~last~0=v_~last~0_129} AuxVars[] AssignedVars[] [2021-05-03 00:17:13,794 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:13,811 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:13,813 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:13,824 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:13,827 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:13,843 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:13,862 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_483 1) v_~SIZE~0_125) (< v_main_~c~0_483 v_~last~0_130)) InVars {~SIZE~0=v_~SIZE~0_125, main_~c~0=v_main_~c~0_483, ~last~0=v_~last~0_130} OutVars{~SIZE~0=v_~SIZE~0_125, main_~c~0=v_main_~c~0_483, ~last~0=v_~last~0_130} AuxVars[] AssignedVars[] [2021-05-03 00:17:13,863 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:13,864 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:13,865 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:13,879 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:13,884 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:13,910 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:13,928 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:14,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:14,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:14,103 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:14,687 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:14,687 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [518038987] [2021-05-03 00:17:14,687 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [518038987] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:14,687 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:14,687 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-03 00:17:14,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101890517] [2021-05-03 00:17:14,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-03 00:17:14,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:14,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-03 00:17:14,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:17:14,688 INFO L87 Difference]: Start difference. First operand 161 states and 189 transitions. Second operand has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 20 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:15,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:15,319 INFO L93 Difference]: Finished difference Result 340 states and 394 transitions. [2021-05-03 00:17:15,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-03 00:17:15,320 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 20 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2021-05-03 00:17:15,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:15,321 INFO L225 Difference]: With dead ends: 340 [2021-05-03 00:17:15,321 INFO L226 Difference]: Without dead ends: 214 [2021-05-03 00:17:15,322 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 14 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 703.2ms TimeCoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:17:15,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-05-03 00:17:15,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 161. [2021-05-03 00:17:15,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 151 states have (on average 1.1788079470198676) internal successors, (178), 151 states have internal predecessors, (178), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:15,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 189 transitions. [2021-05-03 00:17:15,361 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 189 transitions. Word has length 46 [2021-05-03 00:17:15,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:15,361 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 189 transitions. [2021-05-03 00:17:15,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 20 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:15,361 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 189 transitions. [2021-05-03 00:17:15,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-03 00:17:15,362 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:15,362 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:15,362 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2021-05-03 00:17:15,362 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:15,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:15,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1339441570, now seen corresponding path program 23 times [2021-05-03 00:17:15,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:15,363 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1995317126] [2021-05-03 00:17:15,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:15,374 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_131 v_main_~c~0_495) (< v_main_~c~0_495 v_~SIZE~0_126)) InVars {~SIZE~0=v_~SIZE~0_126, main_~c~0=v_main_~c~0_495, ~last~0=v_~last~0_131} OutVars{~SIZE~0=v_~SIZE~0_126, main_~c~0=v_main_~c~0_495, ~last~0=v_~last~0_131} AuxVars[] AssignedVars[] [2021-05-03 00:17:15,376 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:15,397 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:15,399 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:15,414 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:15,417 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:15,438 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:15,457 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_497 v_~last~0_132) (< v_main_~c~0_497 v_~SIZE~0_127)) InVars {~SIZE~0=v_~SIZE~0_127, main_~c~0=v_main_~c~0_497, ~last~0=v_~last~0_132} OutVars{~SIZE~0=v_~SIZE~0_127, main_~c~0=v_main_~c~0_497, ~last~0=v_~last~0_132} AuxVars[] AssignedVars[] [2021-05-03 00:17:15,459 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:15,460 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:15,462 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:15,476 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:15,481 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:15,508 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:15,525 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:15,527 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_133 v_main_~c~0_499) (< (+ v_main_~c~0_499 1) v_~SIZE~0_128)) InVars {~SIZE~0=v_~SIZE~0_128, main_~c~0=v_main_~c~0_499, ~last~0=v_~last~0_133} OutVars{~SIZE~0=v_~SIZE~0_128, main_~c~0=v_main_~c~0_499, ~last~0=v_~last~0_133} AuxVars[] AssignedVars[] [2021-05-03 00:17:15,529 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:15,550 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:15,552 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:15,566 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:15,569 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:15,586 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:15,605 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_501 v_~last~0_134) (< (+ v_main_~c~0_501 1) v_~SIZE~0_129)) InVars {~SIZE~0=v_~SIZE~0_129, main_~c~0=v_main_~c~0_501, ~last~0=v_~last~0_134} OutVars{~SIZE~0=v_~SIZE~0_129, main_~c~0=v_main_~c~0_501, ~last~0=v_~last~0_134} AuxVars[] AssignedVars[] [2021-05-03 00:17:15,607 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:15,608 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:15,610 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:15,627 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:15,632 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:15,675 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:15,696 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:15,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:15,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:15,899 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:16,586 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:16,586 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1995317126] [2021-05-03 00:17:16,586 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1995317126] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:16,586 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:16,586 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:17:16,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077710276] [2021-05-03 00:17:16,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:17:16,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:16,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:17:16,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:17:16,588 INFO L87 Difference]: Start difference. First operand 161 states and 189 transitions. Second operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 21 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:17,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:17,326 INFO L93 Difference]: Finished difference Result 337 states and 391 transitions. [2021-05-03 00:17:17,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-03 00:17:17,326 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 21 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2021-05-03 00:17:17,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:17,327 INFO L225 Difference]: With dead ends: 337 [2021-05-03 00:17:17,327 INFO L226 Difference]: Without dead ends: 211 [2021-05-03 00:17:17,328 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 13 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 807.1ms TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:17:17,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-05-03 00:17:17,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 161. [2021-05-03 00:17:17,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 151 states have (on average 1.1788079470198676) internal successors, (178), 151 states have internal predecessors, (178), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 189 transitions. [2021-05-03 00:17:17,387 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 189 transitions. Word has length 46 [2021-05-03 00:17:17,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:17,387 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 189 transitions. [2021-05-03 00:17:17,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 21 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:17,388 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 189 transitions. [2021-05-03 00:17:17,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-03 00:17:17,388 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:17,388 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:17,388 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2021-05-03 00:17:17,389 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:17,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:17,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1277401956, now seen corresponding path program 24 times [2021-05-03 00:17:17,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:17,389 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1114155768] [2021-05-03 00:17:17,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:17,397 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_135 v_main_~c~0_513) (< v_main_~c~0_513 v_~SIZE~0_130)) InVars {~SIZE~0=v_~SIZE~0_130, main_~c~0=v_main_~c~0_513, ~last~0=v_~last~0_135} OutVars{~SIZE~0=v_~SIZE~0_130, main_~c~0=v_main_~c~0_513, ~last~0=v_~last~0_135} AuxVars[] AssignedVars[] [2021-05-03 00:17:17,400 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:17,420 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:17,422 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:17,434 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:17,437 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:17,456 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:17,480 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_515 v_~SIZE~0_131) (< v_main_~c~0_515 v_~last~0_136)) InVars {~SIZE~0=v_~SIZE~0_131, main_~c~0=v_main_~c~0_515, ~last~0=v_~last~0_136} OutVars{~SIZE~0=v_~SIZE~0_131, main_~c~0=v_main_~c~0_515, ~last~0=v_~last~0_136} AuxVars[] AssignedVars[] [2021-05-03 00:17:17,481 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:17,483 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:17,484 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:17,501 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:17,506 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:17,531 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:17,548 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:17,550 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_517 1) v_~SIZE~0_132) (<= v_~last~0_137 v_main_~c~0_517)) InVars {~SIZE~0=v_~SIZE~0_132, main_~c~0=v_main_~c~0_517, ~last~0=v_~last~0_137} OutVars{~SIZE~0=v_~SIZE~0_132, main_~c~0=v_main_~c~0_517, ~last~0=v_~last~0_137} AuxVars[] AssignedVars[] [2021-05-03 00:17:17,552 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:17,569 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:17,571 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:17,584 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:17,587 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:17,603 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:17,622 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_519 1) v_~SIZE~0_133) (< v_main_~c~0_519 v_~last~0_138)) InVars {~SIZE~0=v_~SIZE~0_133, main_~c~0=v_main_~c~0_519, ~last~0=v_~last~0_138} OutVars{~SIZE~0=v_~SIZE~0_133, main_~c~0=v_main_~c~0_519, ~last~0=v_~last~0_138} AuxVars[] AssignedVars[] [2021-05-03 00:17:17,624 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:17,625 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:17,626 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:17,640 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:17,645 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:17,672 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:17,689 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:17,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:17,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:17,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:17,842 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:18,446 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:18,446 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1114155768] [2021-05-03 00:17:18,446 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1114155768] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:18,446 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:18,446 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-03 00:17:18,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276266172] [2021-05-03 00:17:18,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-03 00:17:18,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:18,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-03 00:17:18,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:17:18,447 INFO L87 Difference]: Start difference. First operand 161 states and 189 transitions. Second operand has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 22 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:18,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:18,997 INFO L93 Difference]: Finished difference Result 334 states and 388 transitions. [2021-05-03 00:17:19,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-03 00:17:19,002 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 22 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2021-05-03 00:17:19,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:19,003 INFO L225 Difference]: With dead ends: 334 [2021-05-03 00:17:19,003 INFO L226 Difference]: Without dead ends: 208 [2021-05-03 00:17:19,004 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 12 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 713.3ms TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:17:19,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-05-03 00:17:19,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 161. [2021-05-03 00:17:19,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 151 states have (on average 1.1788079470198676) internal successors, (178), 151 states have internal predecessors, (178), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:19,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 189 transitions. [2021-05-03 00:17:19,048 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 189 transitions. Word has length 46 [2021-05-03 00:17:19,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:19,048 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 189 transitions. [2021-05-03 00:17:19,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 22 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:19,048 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 189 transitions. [2021-05-03 00:17:19,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-03 00:17:19,049 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:19,049 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:19,049 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2021-05-03 00:17:19,049 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:19,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:19,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1212127006, now seen corresponding path program 25 times [2021-05-03 00:17:19,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:19,049 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1721581086] [2021-05-03 00:17:19,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:19,058 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_531 v_~SIZE~0_134) (<= v_~last~0_139 v_main_~c~0_531)) InVars {~SIZE~0=v_~SIZE~0_134, main_~c~0=v_main_~c~0_531, ~last~0=v_~last~0_139} OutVars{~SIZE~0=v_~SIZE~0_134, main_~c~0=v_main_~c~0_531, ~last~0=v_~last~0_139} AuxVars[] AssignedVars[] [2021-05-03 00:17:19,060 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:19,062 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:19,064 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:19,076 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:19,080 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:19,120 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:19,140 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_533 v_~last~0_140) (< v_main_~c~0_533 v_~SIZE~0_135)) InVars {~SIZE~0=v_~SIZE~0_135, main_~c~0=v_main_~c~0_533, ~last~0=v_~last~0_140} OutVars{~SIZE~0=v_~SIZE~0_135, main_~c~0=v_main_~c~0_533, ~last~0=v_~last~0_140} AuxVars[] AssignedVars[] [2021-05-03 00:17:19,142 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:19,157 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:19,159 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:19,173 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:19,178 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:19,193 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:19,210 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:19,213 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_535 1) v_~SIZE~0_136) (<= v_~last~0_141 v_main_~c~0_535)) InVars {~SIZE~0=v_~SIZE~0_136, main_~c~0=v_main_~c~0_535, ~last~0=v_~last~0_141} OutVars{~SIZE~0=v_~SIZE~0_136, main_~c~0=v_main_~c~0_535, ~last~0=v_~last~0_141} AuxVars[] AssignedVars[] [2021-05-03 00:17:19,215 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:19,216 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:19,218 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:19,230 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:19,233 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:19,263 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:19,281 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_537 1) v_~SIZE~0_137) (< v_main_~c~0_537 v_~last~0_142)) InVars {~SIZE~0=v_~SIZE~0_137, main_~c~0=v_main_~c~0_537, ~last~0=v_~last~0_142} OutVars{~SIZE~0=v_~SIZE~0_137, main_~c~0=v_main_~c~0_537, ~last~0=v_~last~0_142} AuxVars[] AssignedVars[] [2021-05-03 00:17:19,283 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:19,296 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:19,298 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:19,311 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:19,316 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:19,330 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:19,348 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:19,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:19,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:19,494 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:20,156 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:20,156 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1721581086] [2021-05-03 00:17:20,156 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1721581086] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:20,156 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:20,156 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:17:20,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779110768] [2021-05-03 00:17:20,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:17:20,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:20,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:17:20,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:17:20,158 INFO L87 Difference]: Start difference. First operand 161 states and 189 transitions. Second operand has 25 states, 25 states have (on average 1.6) internal successors, (40), 23 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:20,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:20,704 INFO L93 Difference]: Finished difference Result 331 states and 385 transitions. [2021-05-03 00:17:20,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-03 00:17:20,705 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.6) internal successors, (40), 23 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2021-05-03 00:17:20,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:20,705 INFO L225 Difference]: With dead ends: 331 [2021-05-03 00:17:20,705 INFO L226 Difference]: Without dead ends: 205 [2021-05-03 00:17:20,706 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 766.6ms TimeCoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:17:20,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-05-03 00:17:20,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 161. [2021-05-03 00:17:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 151 states have (on average 1.1788079470198676) internal successors, (178), 151 states have internal predecessors, (178), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:20,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 189 transitions. [2021-05-03 00:17:20,748 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 189 transitions. Word has length 46 [2021-05-03 00:17:20,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:20,749 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 189 transitions. [2021-05-03 00:17:20,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 1.6) internal successors, (40), 23 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:20,749 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 189 transitions. [2021-05-03 00:17:20,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-03 00:17:20,749 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:20,750 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:20,750 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2021-05-03 00:17:20,750 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:20,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:20,750 INFO L82 PathProgramCache]: Analyzing trace with hash 394478556, now seen corresponding path program 26 times [2021-05-03 00:17:20,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:20,750 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [59604415] [2021-05-03 00:17:20,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:20,759 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_549 v_~SIZE~0_138) (<= v_~last~0_143 v_main_~c~0_549)) InVars {~SIZE~0=v_~SIZE~0_138, main_~c~0=v_main_~c~0_549, ~last~0=v_~last~0_143} OutVars{~SIZE~0=v_~SIZE~0_138, main_~c~0=v_main_~c~0_549, ~last~0=v_~last~0_143} AuxVars[] AssignedVars[] [2021-05-03 00:17:20,761 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:20,763 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:20,764 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:20,776 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:20,779 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:20,814 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:20,843 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_551 v_~SIZE~0_139) (< v_main_~c~0_551 v_~last~0_144)) InVars {~SIZE~0=v_~SIZE~0_139, main_~c~0=v_main_~c~0_551, ~last~0=v_~last~0_144} OutVars{~SIZE~0=v_~SIZE~0_139, main_~c~0=v_main_~c~0_551, ~last~0=v_~last~0_144} AuxVars[] AssignedVars[] [2021-05-03 00:17:20,850 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:20,864 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:20,868 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:20,892 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:20,898 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:20,914 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:20,935 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:20,938 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_553 1) v_~SIZE~0_140) (<= v_~last~0_145 v_main_~c~0_553)) InVars {~SIZE~0=v_~SIZE~0_140, main_~c~0=v_main_~c~0_553, ~last~0=v_~last~0_145} OutVars{~SIZE~0=v_~SIZE~0_140, main_~c~0=v_main_~c~0_553, ~last~0=v_~last~0_145} AuxVars[] AssignedVars[] [2021-05-03 00:17:20,940 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:20,960 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:20,962 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:20,975 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:20,978 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:20,996 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:21,018 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_555 v_~last~0_146) (< (+ v_main_~c~0_555 1) v_~SIZE~0_141)) InVars {~SIZE~0=v_~SIZE~0_141, main_~c~0=v_main_~c~0_555, ~last~0=v_~last~0_146} OutVars{~SIZE~0=v_~SIZE~0_141, main_~c~0=v_main_~c~0_555, ~last~0=v_~last~0_146} AuxVars[] AssignedVars[] [2021-05-03 00:17:21,020 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:21,021 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:21,022 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:21,038 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:21,044 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:21,075 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:21,096 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:21,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:21,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:21,272 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:21,940 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:21,940 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [59604415] [2021-05-03 00:17:21,940 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [59604415] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:21,940 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:21,940 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:17:21,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854530986] [2021-05-03 00:17:21,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:17:21,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:21,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:17:21,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:17:21,942 INFO L87 Difference]: Start difference. First operand 161 states and 189 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 24 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:22,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:22,527 INFO L93 Difference]: Finished difference Result 328 states and 382 transitions. [2021-05-03 00:17:22,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:17:22,528 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 24 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2021-05-03 00:17:22,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:22,528 INFO L225 Difference]: With dead ends: 328 [2021-05-03 00:17:22,528 INFO L226 Difference]: Without dead ends: 202 [2021-05-03 00:17:22,529 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 10 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 796.7ms TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:17:22,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-05-03 00:17:22,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 161. [2021-05-03 00:17:22,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 151 states have (on average 1.1788079470198676) internal successors, (178), 151 states have internal predecessors, (178), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 189 transitions. [2021-05-03 00:17:22,575 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 189 transitions. Word has length 46 [2021-05-03 00:17:22,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:22,575 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 189 transitions. [2021-05-03 00:17:22,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 24 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:22,575 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 189 transitions. [2021-05-03 00:17:22,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-03 00:17:22,576 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:22,576 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:22,576 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2021-05-03 00:17:22,576 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:22,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:22,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1193869346, now seen corresponding path program 27 times [2021-05-03 00:17:22,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:22,577 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [523957063] [2021-05-03 00:17:22,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:22,585 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_567 v_~SIZE~0_142) (<= v_~last~0_147 v_main_~c~0_567)) InVars {~SIZE~0=v_~SIZE~0_142, main_~c~0=v_main_~c~0_567, ~last~0=v_~last~0_147} OutVars{~SIZE~0=v_~SIZE~0_142, main_~c~0=v_main_~c~0_567, ~last~0=v_~last~0_147} AuxVars[] AssignedVars[] [2021-05-03 00:17:22,587 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:22,604 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:22,606 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:22,625 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:22,629 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:22,651 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:22,678 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_569 v_~last~0_148) (< v_main_~c~0_569 v_~SIZE~0_143)) InVars {~SIZE~0=v_~SIZE~0_143, main_~c~0=v_main_~c~0_569, ~last~0=v_~last~0_148} OutVars{~SIZE~0=v_~SIZE~0_143, main_~c~0=v_main_~c~0_569, ~last~0=v_~last~0_148} AuxVars[] AssignedVars[] [2021-05-03 00:17:22,680 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:22,681 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:22,683 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:22,701 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:22,708 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:22,742 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:22,759 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:22,762 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_149 v_main_~c~0_571) (< (+ v_main_~c~0_571 1) v_~SIZE~0_144)) InVars {~SIZE~0=v_~SIZE~0_144, main_~c~0=v_main_~c~0_571, ~last~0=v_~last~0_149} OutVars{~SIZE~0=v_~SIZE~0_144, main_~c~0=v_main_~c~0_571, ~last~0=v_~last~0_149} AuxVars[] AssignedVars[] [2021-05-03 00:17:22,765 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:22,781 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:22,783 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:22,794 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:22,796 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:22,814 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:22,833 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_573 1) v_~SIZE~0_145) (< v_main_~c~0_573 v_~last~0_150)) InVars {~SIZE~0=v_~SIZE~0_145, main_~c~0=v_main_~c~0_573, ~last~0=v_~last~0_150} OutVars{~SIZE~0=v_~SIZE~0_145, main_~c~0=v_main_~c~0_573, ~last~0=v_~last~0_150} AuxVars[] AssignedVars[] [2021-05-03 00:17:22,834 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:22,848 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:22,849 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:22,866 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:22,872 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:22,893 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:22,910 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:23,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:23,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:23,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:23,088 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:23,745 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:23,746 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [523957063] [2021-05-03 00:17:23,746 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [523957063] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:23,746 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:23,746 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:17:23,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122380860] [2021-05-03 00:17:23,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:17:23,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:23,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:17:23,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:17:23,747 INFO L87 Difference]: Start difference. First operand 161 states and 189 transitions. Second operand has 27 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 25 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:24,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:24,377 INFO L93 Difference]: Finished difference Result 325 states and 379 transitions. [2021-05-03 00:17:24,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:17:24,378 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 25 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2021-05-03 00:17:24,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:24,379 INFO L225 Difference]: With dead ends: 325 [2021-05-03 00:17:24,379 INFO L226 Difference]: Without dead ends: 199 [2021-05-03 00:17:24,379 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 788.9ms TimeCoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:17:24,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-05-03 00:17:24,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 161. [2021-05-03 00:17:24,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 151 states have (on average 1.1788079470198676) internal successors, (178), 151 states have internal predecessors, (178), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:24,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 189 transitions. [2021-05-03 00:17:24,420 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 189 transitions. Word has length 46 [2021-05-03 00:17:24,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:24,420 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 189 transitions. [2021-05-03 00:17:24,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 25 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:24,420 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 189 transitions. [2021-05-03 00:17:24,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-03 00:17:24,421 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:24,421 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 7, 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-03 00:17:24,421 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2021-05-03 00:17:24,421 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:24,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:24,422 INFO L82 PathProgramCache]: Analyzing trace with hash 2089980700, now seen corresponding path program 28 times [2021-05-03 00:17:24,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:24,422 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [693954897] [2021-05-03 00:17:24,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:24,434 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_151 v_main_~c~0_585) (< v_main_~c~0_585 v_~SIZE~0_146)) InVars {~SIZE~0=v_~SIZE~0_146, main_~c~0=v_main_~c~0_585, ~last~0=v_~last~0_151} OutVars{~SIZE~0=v_~SIZE~0_146, main_~c~0=v_main_~c~0_585, ~last~0=v_~last~0_151} AuxVars[] AssignedVars[] [2021-05-03 00:17:24,436 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:24,437 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:24,439 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:24,449 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:24,452 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:24,481 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:24,500 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_587 v_~SIZE~0_147) (< v_main_~c~0_587 v_~last~0_152)) InVars {~SIZE~0=v_~SIZE~0_147, main_~c~0=v_main_~c~0_587, ~last~0=v_~last~0_152} OutVars{~SIZE~0=v_~SIZE~0_147, main_~c~0=v_main_~c~0_587, ~last~0=v_~last~0_152} AuxVars[] AssignedVars[] [2021-05-03 00:17:24,501 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:24,502 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:24,504 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:24,517 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:24,522 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:24,549 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:24,566 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:24,567 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_589 1) v_~SIZE~0_148) (< v_main_~c~0_589 v_~last~0_153)) InVars {~SIZE~0=v_~SIZE~0_148, main_~c~0=v_main_~c~0_589, ~last~0=v_~last~0_153} OutVars{~SIZE~0=v_~SIZE~0_148, main_~c~0=v_main_~c~0_589, ~last~0=v_~last~0_153} AuxVars[] AssignedVars[] [2021-05-03 00:17:24,569 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:24,570 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:24,572 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:24,585 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:24,590 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:24,618 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:24,636 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:24,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:24,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:24,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:24,819 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:25,488 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:25,488 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [693954897] [2021-05-03 00:17:25,488 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [693954897] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:25,488 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:25,488 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:17:25,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661799093] [2021-05-03 00:17:25,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:17:25,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:25,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:17:25,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:17:25,489 INFO L87 Difference]: Start difference. First operand 161 states and 189 transitions. Second operand has 28 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 26 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:26,179 INFO L93 Difference]: Finished difference Result 324 states and 379 transitions. [2021-05-03 00:17:26,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:17:26,180 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 26 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2021-05-03 00:17:26,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:26,181 INFO L225 Difference]: With dead ends: 324 [2021-05-03 00:17:26,181 INFO L226 Difference]: Without dead ends: 198 [2021-05-03 00:17:26,182 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 784.4ms TimeCoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:17:26,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-05-03 00:17:26,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 162. [2021-05-03 00:17:26,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 152 states have (on average 1.1842105263157894) internal successors, (180), 152 states have internal predecessors, (180), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 191 transitions. [2021-05-03 00:17:26,243 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 191 transitions. Word has length 46 [2021-05-03 00:17:26,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:26,243 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 191 transitions. [2021-05-03 00:17:26,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 26 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 191 transitions. [2021-05-03 00:17:26,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-03 00:17:26,246 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:26,246 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:26,246 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2021-05-03 00:17:26,246 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:26,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:26,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1924440350, now seen corresponding path program 8 times [2021-05-03 00:17:26,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:26,247 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [302234398] [2021-05-03 00:17:26,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:26,252 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_601 v_~SIZE~0_149) (< v_main_~c~0_601 v_~last~0_154)) InVars {~SIZE~0=v_~SIZE~0_149, main_~c~0=v_main_~c~0_601, ~last~0=v_~last~0_154} OutVars{~SIZE~0=v_~SIZE~0_149, main_~c~0=v_main_~c~0_601, ~last~0=v_~last~0_154} AuxVars[] AssignedVars[] [2021-05-03 00:17:26,254 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:26,255 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:26,258 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:26,273 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:26,279 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:26,309 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:26,328 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:26,330 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_603 1) v_~SIZE~0_150) (< v_main_~c~0_603 v_~last~0_155)) InVars {~SIZE~0=v_~SIZE~0_150, main_~c~0=v_main_~c~0_603, ~last~0=v_~last~0_155} OutVars{~SIZE~0=v_~SIZE~0_150, main_~c~0=v_main_~c~0_603, ~last~0=v_~last~0_155} AuxVars[] AssignedVars[] [2021-05-03 00:17:26,331 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:26,352 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:26,354 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:26,370 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:26,375 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:26,392 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:26,412 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:26,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:26,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:26,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:27,140 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:27,140 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [302234398] [2021-05-03 00:17:27,140 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [302234398] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:27,140 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:27,140 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:17:27,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23168703] [2021-05-03 00:17:27,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:17:27,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:27,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:17:27,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:17:27,141 INFO L87 Difference]: Start difference. First operand 162 states and 191 transitions. Second operand has 27 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 25 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:28,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:28,043 INFO L93 Difference]: Finished difference Result 331 states and 387 transitions. [2021-05-03 00:17:28,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:17:28,043 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 25 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2021-05-03 00:17:28,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:28,044 INFO L225 Difference]: With dead ends: 331 [2021-05-03 00:17:28,045 INFO L226 Difference]: Without dead ends: 205 [2021-05-03 00:17:28,046 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 956.8ms TimeCoverageRelationStatistics Valid=202, Invalid=1280, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:17:28,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-05-03 00:17:28,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 164. [2021-05-03 00:17:28,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 154 states have (on average 1.1818181818181819) internal successors, (182), 154 states have internal predecessors, (182), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 193 transitions. [2021-05-03 00:17:28,108 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 193 transitions. Word has length 46 [2021-05-03 00:17:28,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:28,108 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 193 transitions. [2021-05-03 00:17:28,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 25 states have internal predecessors, (40), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:28,108 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 193 transitions. [2021-05-03 00:17:28,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:17:28,109 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:28,109 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:28,109 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2021-05-03 00:17:28,109 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:28,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:28,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1705211235, now seen corresponding path program 9 times [2021-05-03 00:17:28,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:28,110 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1534208772] [2021-05-03 00:17:28,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:28,115 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_156 v_main_~c~0_614) (< v_main_~c~0_614 v_~SIZE~0_151)) InVars {~SIZE~0=v_~SIZE~0_151, main_~c~0=v_main_~c~0_614, ~last~0=v_~last~0_156} OutVars{~SIZE~0=v_~SIZE~0_151, main_~c~0=v_main_~c~0_614, ~last~0=v_~last~0_156} AuxVars[] AssignedVars[] [2021-05-03 00:17:28,118 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:28,139 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:28,141 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:28,152 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:28,154 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:28,170 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:28,188 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:28,190 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_616 1) v_~SIZE~0_152) (<= v_~last~0_157 v_main_~c~0_616)) InVars {~SIZE~0=v_~SIZE~0_152, main_~c~0=v_main_~c~0_616, ~last~0=v_~last~0_157} OutVars{~SIZE~0=v_~SIZE~0_152, main_~c~0=v_main_~c~0_616, ~last~0=v_~last~0_157} AuxVars[] AssignedVars[] [2021-05-03 00:17:28,191 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:28,213 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:28,219 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:28,231 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:28,233 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:28,249 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:28,267 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:28,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:28,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:29,154 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:29,154 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1534208772] [2021-05-03 00:17:29,154 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1534208772] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:29,154 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:29,154 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-03 00:17:29,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541241447] [2021-05-03 00:17:29,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-03 00:17:29,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:29,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-03 00:17:29,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:17:29,155 INFO L87 Difference]: Start difference. First operand 164 states and 193 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:29,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:29,756 INFO L93 Difference]: Finished difference Result 346 states and 401 transitions. [2021-05-03 00:17:29,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-03 00:17:29,757 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-03 00:17:29,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:29,758 INFO L225 Difference]: With dead ends: 346 [2021-05-03 00:17:29,758 INFO L226 Difference]: Without dead ends: 220 [2021-05-03 00:17:29,759 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 16 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 832.7ms TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:17:29,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-05-03 00:17:29,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 167. [2021-05-03 00:17:29,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 157 states have (on average 1.178343949044586) internal successors, (185), 157 states have internal predecessors, (185), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:29,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 196 transitions. [2021-05-03 00:17:29,827 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 196 transitions. Word has length 49 [2021-05-03 00:17:29,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:29,827 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 196 transitions. [2021-05-03 00:17:29,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 20 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:29,828 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 196 transitions. [2021-05-03 00:17:29,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:17:29,828 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:29,828 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 8, 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-03 00:17:29,830 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2021-05-03 00:17:29,830 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:29,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:29,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1745750559, now seen corresponding path program 29 times [2021-05-03 00:17:29,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:29,830 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [988211647] [2021-05-03 00:17:29,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:29,849 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_628 v_~SIZE~0_153) (<= v_~last~0_158 v_main_~c~0_628)) InVars {~SIZE~0=v_~SIZE~0_153, main_~c~0=v_main_~c~0_628, ~last~0=v_~last~0_158} OutVars{~SIZE~0=v_~SIZE~0_153, main_~c~0=v_main_~c~0_628, ~last~0=v_~last~0_158} AuxVars[] AssignedVars[] [2021-05-03 00:17:29,851 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:29,852 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:29,853 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:29,863 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:29,865 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:29,895 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:29,914 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_630 v_~SIZE~0_154) (< v_main_~c~0_630 v_~last~0_159)) InVars {~SIZE~0=v_~SIZE~0_154, main_~c~0=v_main_~c~0_630, ~last~0=v_~last~0_159} OutVars{~SIZE~0=v_~SIZE~0_154, main_~c~0=v_main_~c~0_630, ~last~0=v_~last~0_159} AuxVars[] AssignedVars[] [2021-05-03 00:17:29,915 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:29,928 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:29,930 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:29,943 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:29,947 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:29,961 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:29,979 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:29,992 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_160 v_main_~c~0_632) (< (+ v_main_~c~0_632 1) v_~SIZE~0_155)) InVars {~SIZE~0=v_~SIZE~0_155, main_~c~0=v_main_~c~0_632, ~last~0=v_~last~0_160} OutVars{~SIZE~0=v_~SIZE~0_155, main_~c~0=v_main_~c~0_632, ~last~0=v_~last~0_160} AuxVars[] AssignedVars[] [2021-05-03 00:17:29,995 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:30,018 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:30,020 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:30,035 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:30,038 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:30,059 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:30,084 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_634 1) v_~SIZE~0_156) (< v_main_~c~0_634 v_~last~0_161)) InVars {~SIZE~0=v_~SIZE~0_156, main_~c~0=v_main_~c~0_634, ~last~0=v_~last~0_161} OutVars{~SIZE~0=v_~SIZE~0_156, main_~c~0=v_main_~c~0_634, ~last~0=v_~last~0_161} AuxVars[] AssignedVars[] [2021-05-03 00:17:30,087 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:30,088 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:30,090 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:30,108 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:30,115 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:30,149 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:30,173 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:30,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:30,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:30,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:30,362 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:31,137 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:31,137 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [988211647] [2021-05-03 00:17:31,137 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [988211647] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:31,137 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:31,138 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:17:31,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838159536] [2021-05-03 00:17:31,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:17:31,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:31,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:17:31,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:17:31,139 INFO L87 Difference]: Start difference. First operand 167 states and 196 transitions. Second operand has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 21 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:31,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:31,755 INFO L93 Difference]: Finished difference Result 349 states and 404 transitions. [2021-05-03 00:17:31,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-03 00:17:31,756 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 21 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-03 00:17:31,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:31,757 INFO L225 Difference]: With dead ends: 349 [2021-05-03 00:17:31,757 INFO L226 Difference]: Without dead ends: 223 [2021-05-03 00:17:31,758 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 16 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 895.1ms TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:17:31,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-05-03 00:17:31,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 167. [2021-05-03 00:17:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 157 states have (on average 1.178343949044586) internal successors, (185), 157 states have internal predecessors, (185), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 196 transitions. [2021-05-03 00:17:31,816 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 196 transitions. Word has length 49 [2021-05-03 00:17:31,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:31,817 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 196 transitions. [2021-05-03 00:17:31,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 21 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:31,817 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 196 transitions. [2021-05-03 00:17:31,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:17:31,817 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:31,817 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:31,817 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2021-05-03 00:17:31,817 INFO L428 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:31,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:31,818 INFO L82 PathProgramCache]: Analyzing trace with hash 2020510173, now seen corresponding path program 30 times [2021-05-03 00:17:31,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:31,818 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1589214367] [2021-05-03 00:17:31,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:31,827 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_647 v_~SIZE~0_157) (<= v_~last~0_162 v_main_~c~0_647)) InVars {~SIZE~0=v_~SIZE~0_157, main_~c~0=v_main_~c~0_647, ~last~0=v_~last~0_162} OutVars{~SIZE~0=v_~SIZE~0_157, main_~c~0=v_main_~c~0_647, ~last~0=v_~last~0_162} AuxVars[] AssignedVars[] [2021-05-03 00:17:31,829 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:31,830 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:31,832 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:31,843 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:31,846 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:31,878 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:31,899 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_649 v_~last~0_163) (< v_main_~c~0_649 v_~SIZE~0_158)) InVars {~SIZE~0=v_~SIZE~0_158, main_~c~0=v_main_~c~0_649, ~last~0=v_~last~0_163} OutVars{~SIZE~0=v_~SIZE~0_158, main_~c~0=v_main_~c~0_649, ~last~0=v_~last~0_163} AuxVars[] AssignedVars[] [2021-05-03 00:17:31,901 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:31,914 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:31,917 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:31,931 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:31,936 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:31,950 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:31,968 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:31,970 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_164 v_main_~c~0_651) (< (+ v_main_~c~0_651 1) v_~SIZE~0_159)) InVars {~SIZE~0=v_~SIZE~0_159, main_~c~0=v_main_~c~0_651, ~last~0=v_~last~0_164} OutVars{~SIZE~0=v_~SIZE~0_159, main_~c~0=v_main_~c~0_651, ~last~0=v_~last~0_164} AuxVars[] AssignedVars[] [2021-05-03 00:17:31,972 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:31,989 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:31,998 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:32,010 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:32,013 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:32,030 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:32,050 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_653 v_~last~0_165) (< (+ v_main_~c~0_653 1) v_~SIZE~0_160)) InVars {~SIZE~0=v_~SIZE~0_160, main_~c~0=v_main_~c~0_653, ~last~0=v_~last~0_165} OutVars{~SIZE~0=v_~SIZE~0_160, main_~c~0=v_main_~c~0_653, ~last~0=v_~last~0_165} AuxVars[] AssignedVars[] [2021-05-03 00:17:32,051 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:32,065 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:32,067 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:32,080 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:32,085 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:32,100 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:32,134 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:32,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:32,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:32,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:32,320 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:33,116 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:33,116 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1589214367] [2021-05-03 00:17:33,117 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1589214367] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:33,117 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:33,117 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-03 00:17:33,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586794592] [2021-05-03 00:17:33,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-03 00:17:33,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:33,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-03 00:17:33,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:17:33,118 INFO L87 Difference]: Start difference. First operand 167 states and 196 transitions. Second operand has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 22 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:33,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:33,870 INFO L93 Difference]: Finished difference Result 346 states and 401 transitions. [2021-05-03 00:17:33,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-03 00:17:33,870 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 22 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-03 00:17:33,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:33,871 INFO L225 Difference]: With dead ends: 346 [2021-05-03 00:17:33,871 INFO L226 Difference]: Without dead ends: 220 [2021-05-03 00:17:33,872 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 15 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 925.7ms TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:17:33,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-05-03 00:17:33,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 167. [2021-05-03 00:17:33,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 157 states have (on average 1.178343949044586) internal successors, (185), 157 states have internal predecessors, (185), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:33,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 196 transitions. [2021-05-03 00:17:33,949 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 196 transitions. Word has length 49 [2021-05-03 00:17:33,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:33,949 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 196 transitions. [2021-05-03 00:17:33,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 22 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:33,950 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 196 transitions. [2021-05-03 00:17:33,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:17:33,950 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:33,950 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:33,950 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2021-05-03 00:17:33,950 INFO L428 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:33,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:33,951 INFO L82 PathProgramCache]: Analyzing trace with hash -888253729, now seen corresponding path program 31 times [2021-05-03 00:17:33,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:33,951 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [723869472] [2021-05-03 00:17:33,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:33,959 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_666 v_~SIZE~0_161) (<= v_~last~0_166 v_main_~c~0_666)) InVars {~SIZE~0=v_~SIZE~0_161, main_~c~0=v_main_~c~0_666, ~last~0=v_~last~0_166} OutVars{~SIZE~0=v_~SIZE~0_161, main_~c~0=v_main_~c~0_666, ~last~0=v_~last~0_166} AuxVars[] AssignedVars[] [2021-05-03 00:17:33,961 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:33,962 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:33,964 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:33,976 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:33,979 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:34,010 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:34,032 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_668 v_~SIZE~0_162) (< v_main_~c~0_668 v_~last~0_167)) InVars {~SIZE~0=v_~SIZE~0_162, main_~c~0=v_main_~c~0_668, ~last~0=v_~last~0_167} OutVars{~SIZE~0=v_~SIZE~0_162, main_~c~0=v_main_~c~0_668, ~last~0=v_~last~0_167} AuxVars[] AssignedVars[] [2021-05-03 00:17:34,034 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:34,035 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:34,037 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:34,052 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:34,058 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:34,090 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:34,112 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:34,115 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_168 v_main_~c~0_670) (< (+ v_main_~c~0_670 1) v_~SIZE~0_163)) InVars {~SIZE~0=v_~SIZE~0_163, main_~c~0=v_main_~c~0_670, ~last~0=v_~last~0_168} OutVars{~SIZE~0=v_~SIZE~0_163, main_~c~0=v_main_~c~0_670, ~last~0=v_~last~0_168} AuxVars[] AssignedVars[] [2021-05-03 00:17:34,118 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:34,119 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:34,121 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:34,134 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:34,138 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:34,172 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:34,194 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_672 1) v_~SIZE~0_164) (< v_main_~c~0_672 v_~last~0_169)) InVars {~SIZE~0=v_~SIZE~0_164, main_~c~0=v_main_~c~0_672, ~last~0=v_~last~0_169} OutVars{~SIZE~0=v_~SIZE~0_164, main_~c~0=v_main_~c~0_672, ~last~0=v_~last~0_169} AuxVars[] AssignedVars[] [2021-05-03 00:17:34,196 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:34,197 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:34,199 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:34,215 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:34,221 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:34,254 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:34,275 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:34,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:34,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:34,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:34,454 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:35,188 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:35,189 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [723869472] [2021-05-03 00:17:35,189 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [723869472] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:35,189 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:35,189 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:17:35,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939773155] [2021-05-03 00:17:35,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:17:35,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:35,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:17:35,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:17:35,190 INFO L87 Difference]: Start difference. First operand 167 states and 196 transitions. Second operand has 25 states, 25 states have (on average 1.72) internal successors, (43), 23 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:35,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:35,938 INFO L93 Difference]: Finished difference Result 343 states and 398 transitions. [2021-05-03 00:17:35,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-03 00:17:35,939 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.72) internal successors, (43), 23 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-03 00:17:35,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:35,940 INFO L225 Difference]: With dead ends: 343 [2021-05-03 00:17:35,940 INFO L226 Difference]: Without dead ends: 217 [2021-05-03 00:17:35,940 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 14 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 849.5ms TimeCoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:17:35,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-05-03 00:17:35,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 167. [2021-05-03 00:17:35,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 157 states have (on average 1.178343949044586) internal successors, (185), 157 states have internal predecessors, (185), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:35,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 196 transitions. [2021-05-03 00:17:35,992 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 196 transitions. Word has length 49 [2021-05-03 00:17:35,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:35,992 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 196 transitions. [2021-05-03 00:17:35,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 1.72) internal successors, (43), 23 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:35,993 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 196 transitions. [2021-05-03 00:17:35,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:17:35,993 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:35,993 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:35,993 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2021-05-03 00:17:35,993 INFO L428 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:35,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:35,994 INFO L82 PathProgramCache]: Analyzing trace with hash -826214115, now seen corresponding path program 32 times [2021-05-03 00:17:35,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:35,994 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2044110379] [2021-05-03 00:17:35,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:36,001 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_170 v_main_~c~0_685) (< v_main_~c~0_685 v_~SIZE~0_165)) InVars {~SIZE~0=v_~SIZE~0_165, main_~c~0=v_main_~c~0_685, ~last~0=v_~last~0_170} OutVars{~SIZE~0=v_~SIZE~0_165, main_~c~0=v_main_~c~0_685, ~last~0=v_~last~0_170} AuxVars[] AssignedVars[] [2021-05-03 00:17:36,003 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:36,004 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:36,010 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:36,023 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:36,026 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:36,065 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:36,084 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_687 v_~last~0_171) (< v_main_~c~0_687 v_~SIZE~0_166)) InVars {~SIZE~0=v_~SIZE~0_166, main_~c~0=v_main_~c~0_687, ~last~0=v_~last~0_171} OutVars{~SIZE~0=v_~SIZE~0_166, main_~c~0=v_main_~c~0_687, ~last~0=v_~last~0_171} AuxVars[] AssignedVars[] [2021-05-03 00:17:36,086 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:36,087 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:36,093 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:36,107 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:36,112 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:36,154 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:36,173 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:36,182 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_172 v_main_~c~0_689) (< (+ v_main_~c~0_689 1) v_~SIZE~0_167)) InVars {~SIZE~0=v_~SIZE~0_167, main_~c~0=v_main_~c~0_689, ~last~0=v_~last~0_172} OutVars{~SIZE~0=v_~SIZE~0_167, main_~c~0=v_main_~c~0_689, ~last~0=v_~last~0_172} AuxVars[] AssignedVars[] [2021-05-03 00:17:36,184 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:36,202 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:36,204 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:36,215 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:36,218 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:36,236 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:36,257 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_691 1) v_~SIZE~0_168) (< v_main_~c~0_691 v_~last~0_173)) InVars {~SIZE~0=v_~SIZE~0_168, main_~c~0=v_main_~c~0_691, ~last~0=v_~last~0_173} OutVars{~SIZE~0=v_~SIZE~0_168, main_~c~0=v_main_~c~0_691, ~last~0=v_~last~0_173} AuxVars[] AssignedVars[] [2021-05-03 00:17:36,259 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:36,260 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:36,262 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:36,276 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:36,282 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:36,311 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:36,329 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:36,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:36,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:36,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:36,502 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:37,361 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:37,361 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2044110379] [2021-05-03 00:17:37,361 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2044110379] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:37,361 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:37,362 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:17:37,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168097928] [2021-05-03 00:17:37,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:17:37,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:37,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:17:37,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:17:37,363 INFO L87 Difference]: Start difference. First operand 167 states and 196 transitions. Second operand has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 24 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:38,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:38,154 INFO L93 Difference]: Finished difference Result 340 states and 395 transitions. [2021-05-03 00:17:38,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:17:38,155 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 24 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-03 00:17:38,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:38,156 INFO L225 Difference]: With dead ends: 340 [2021-05-03 00:17:38,156 INFO L226 Difference]: Without dead ends: 214 [2021-05-03 00:17:38,157 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 12 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 979.2ms TimeCoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:17:38,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-05-03 00:17:38,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 167. [2021-05-03 00:17:38,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 157 states have (on average 1.178343949044586) internal successors, (185), 157 states have internal predecessors, (185), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 196 transitions. [2021-05-03 00:17:38,241 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 196 transitions. Word has length 49 [2021-05-03 00:17:38,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:38,242 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 196 transitions. [2021-05-03 00:17:38,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 24 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:38,242 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 196 transitions. [2021-05-03 00:17:38,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:17:38,242 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:38,242 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:38,243 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211 [2021-05-03 00:17:38,243 INFO L428 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:38,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:38,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1663314847, now seen corresponding path program 33 times [2021-05-03 00:17:38,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:38,243 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [673305493] [2021-05-03 00:17:38,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:38,250 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_174 v_main_~c~0_704) (< v_main_~c~0_704 v_~SIZE~0_169)) InVars {~SIZE~0=v_~SIZE~0_169, main_~c~0=v_main_~c~0_704, ~last~0=v_~last~0_174} OutVars{~SIZE~0=v_~SIZE~0_169, main_~c~0=v_main_~c~0_704, ~last~0=v_~last~0_174} AuxVars[] AssignedVars[] [2021-05-03 00:17:38,253 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:38,271 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:38,274 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:38,286 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:38,289 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:38,307 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:38,327 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_706 v_~SIZE~0_170) (< v_main_~c~0_706 v_~last~0_175)) InVars {~SIZE~0=v_~SIZE~0_170, main_~c~0=v_main_~c~0_706, ~last~0=v_~last~0_175} OutVars{~SIZE~0=v_~SIZE~0_170, main_~c~0=v_main_~c~0_706, ~last~0=v_~last~0_175} AuxVars[] AssignedVars[] [2021-05-03 00:17:38,329 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:38,344 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:38,346 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:38,364 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:38,369 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:38,385 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:38,403 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:38,405 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_708 1) v_~SIZE~0_171) (<= v_~last~0_176 v_main_~c~0_708)) InVars {~SIZE~0=v_~SIZE~0_171, main_~c~0=v_main_~c~0_708, ~last~0=v_~last~0_176} OutVars{~SIZE~0=v_~SIZE~0_171, main_~c~0=v_main_~c~0_708, ~last~0=v_~last~0_176} AuxVars[] AssignedVars[] [2021-05-03 00:17:38,407 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:38,426 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:38,428 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:38,441 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:38,444 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:38,461 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:38,481 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_710 1) v_~SIZE~0_172) (< v_main_~c~0_710 v_~last~0_177)) InVars {~SIZE~0=v_~SIZE~0_172, main_~c~0=v_main_~c~0_710, ~last~0=v_~last~0_177} OutVars{~SIZE~0=v_~SIZE~0_172, main_~c~0=v_main_~c~0_710, ~last~0=v_~last~0_177} AuxVars[] AssignedVars[] [2021-05-03 00:17:38,484 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:38,504 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:38,506 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:38,521 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:38,526 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:38,542 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:38,563 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:38,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:38,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:38,730 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:39,488 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:39,488 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [673305493] [2021-05-03 00:17:39,489 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [673305493] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:39,489 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:39,489 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:17:39,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266493698] [2021-05-03 00:17:39,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:17:39,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:39,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:17:39,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:17:39,490 INFO L87 Difference]: Start difference. First operand 167 states and 196 transitions. Second operand has 27 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 25 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:40,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:40,256 INFO L93 Difference]: Finished difference Result 337 states and 392 transitions. [2021-05-03 00:17:40,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:17:40,257 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 25 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-03 00:17:40,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:40,258 INFO L225 Difference]: With dead ends: 337 [2021-05-03 00:17:40,258 INFO L226 Difference]: Without dead ends: 211 [2021-05-03 00:17:40,259 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 12 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 849.4ms TimeCoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:17:40,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-05-03 00:17:40,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 167. [2021-05-03 00:17:40,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 157 states have (on average 1.178343949044586) internal successors, (185), 157 states have internal predecessors, (185), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:40,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 196 transitions. [2021-05-03 00:17:40,313 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 196 transitions. Word has length 49 [2021-05-03 00:17:40,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:40,313 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 196 transitions. [2021-05-03 00:17:40,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 25 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:40,314 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 196 transitions. [2021-05-03 00:17:40,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:17:40,314 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:40,314 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:40,314 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable216 [2021-05-03 00:17:40,314 INFO L428 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:40,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:40,314 INFO L82 PathProgramCache]: Analyzing trace with hash 845666397, now seen corresponding path program 34 times [2021-05-03 00:17:40,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:40,315 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1541477596] [2021-05-03 00:17:40,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:40,324 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_723 v_~SIZE~0_173) (<= v_~last~0_178 v_main_~c~0_723)) InVars {~SIZE~0=v_~SIZE~0_173, main_~c~0=v_main_~c~0_723, ~last~0=v_~last~0_178} OutVars{~SIZE~0=v_~SIZE~0_173, main_~c~0=v_main_~c~0_723, ~last~0=v_~last~0_178} AuxVars[] AssignedVars[] [2021-05-03 00:17:40,326 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:40,353 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:40,355 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:40,365 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:40,368 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:40,385 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:40,405 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_725 v_~last~0_179) (< v_main_~c~0_725 v_~SIZE~0_174)) InVars {~SIZE~0=v_~SIZE~0_174, main_~c~0=v_main_~c~0_725, ~last~0=v_~last~0_179} OutVars{~SIZE~0=v_~SIZE~0_174, main_~c~0=v_main_~c~0_725, ~last~0=v_~last~0_179} AuxVars[] AssignedVars[] [2021-05-03 00:17:40,406 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:40,421 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:40,423 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:40,438 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:40,443 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:40,459 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:40,477 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:40,479 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_727 1) v_~SIZE~0_175) (<= v_~last~0_180 v_main_~c~0_727)) InVars {~SIZE~0=v_~SIZE~0_175, main_~c~0=v_main_~c~0_727, ~last~0=v_~last~0_180} OutVars{~SIZE~0=v_~SIZE~0_175, main_~c~0=v_main_~c~0_727, ~last~0=v_~last~0_180} AuxVars[] AssignedVars[] [2021-05-03 00:17:40,481 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:40,482 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:40,484 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:40,500 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:40,504 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:40,549 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:40,574 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_729 1) v_~SIZE~0_176) (< v_main_~c~0_729 v_~last~0_181)) InVars {~SIZE~0=v_~SIZE~0_176, main_~c~0=v_main_~c~0_729, ~last~0=v_~last~0_181} OutVars{~SIZE~0=v_~SIZE~0_176, main_~c~0=v_main_~c~0_729, ~last~0=v_~last~0_181} AuxVars[] AssignedVars[] [2021-05-03 00:17:40,576 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:40,577 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:40,580 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:40,599 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:40,606 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:40,637 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:40,655 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:40,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:40,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:40,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:40,833 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:41,573 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:41,573 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1541477596] [2021-05-03 00:17:41,574 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1541477596] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:41,574 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:41,574 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:17:41,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899928340] [2021-05-03 00:17:41,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:17:41,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:41,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:17:41,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:17:41,575 INFO L87 Difference]: Start difference. First operand 167 states and 196 transitions. Second operand has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:42,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:42,237 INFO L93 Difference]: Finished difference Result 334 states and 389 transitions. [2021-05-03 00:17:42,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:17:42,237 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-03 00:17:42,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:42,242 INFO L225 Difference]: With dead ends: 334 [2021-05-03 00:17:42,242 INFO L226 Difference]: Without dead ends: 208 [2021-05-03 00:17:42,243 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 10 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 861.7ms TimeCoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:17:42,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-05-03 00:17:42,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 167. [2021-05-03 00:17:42,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 157 states have (on average 1.178343949044586) internal successors, (185), 157 states have internal predecessors, (185), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 196 transitions. [2021-05-03 00:17:42,327 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 196 transitions. Word has length 49 [2021-05-03 00:17:42,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:42,327 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 196 transitions. [2021-05-03 00:17:42,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:42,328 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 196 transitions. [2021-05-03 00:17:42,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:17:42,328 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:42,328 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:42,329 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable221 [2021-05-03 00:17:42,329 INFO L428 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:42,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:42,329 INFO L82 PathProgramCache]: Analyzing trace with hash -742681505, now seen corresponding path program 35 times [2021-05-03 00:17:42,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:42,329 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2082614464] [2021-05-03 00:17:42,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:42,341 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_742 v_~SIZE~0_177) (<= v_~last~0_182 v_main_~c~0_742)) InVars {~SIZE~0=v_~SIZE~0_177, main_~c~0=v_main_~c~0_742, ~last~0=v_~last~0_182} OutVars{~SIZE~0=v_~SIZE~0_177, main_~c~0=v_main_~c~0_742, ~last~0=v_~last~0_182} AuxVars[] AssignedVars[] [2021-05-03 00:17:42,344 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:42,365 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:42,367 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:42,382 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:42,386 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:42,407 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:42,430 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_744 v_~SIZE~0_178) (< v_main_~c~0_744 v_~last~0_183)) InVars {~SIZE~0=v_~SIZE~0_178, main_~c~0=v_main_~c~0_744, ~last~0=v_~last~0_183} OutVars{~SIZE~0=v_~SIZE~0_178, main_~c~0=v_main_~c~0_744, ~last~0=v_~last~0_183} AuxVars[] AssignedVars[] [2021-05-03 00:17:42,432 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:42,450 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:42,452 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:42,470 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:42,476 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:42,495 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:42,517 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:42,520 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_184 v_main_~c~0_746) (< (+ v_main_~c~0_746 1) v_~SIZE~0_179)) InVars {~SIZE~0=v_~SIZE~0_179, main_~c~0=v_main_~c~0_746, ~last~0=v_~last~0_184} OutVars{~SIZE~0=v_~SIZE~0_179, main_~c~0=v_main_~c~0_746, ~last~0=v_~last~0_184} AuxVars[] AssignedVars[] [2021-05-03 00:17:42,523 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:42,542 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:42,545 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:42,557 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:42,560 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:42,578 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:42,597 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_748 1) v_~SIZE~0_180) (< v_main_~c~0_748 v_~last~0_185)) InVars {~SIZE~0=v_~SIZE~0_180, main_~c~0=v_main_~c~0_748, ~last~0=v_~last~0_185} OutVars{~SIZE~0=v_~SIZE~0_180, main_~c~0=v_main_~c~0_748, ~last~0=v_~last~0_185} AuxVars[] AssignedVars[] [2021-05-03 00:17:42,599 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:42,617 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:42,619 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:42,632 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:42,637 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:42,651 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:42,670 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:42,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:42,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:42,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-03 00:17:42,849 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:43,599 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:43,599 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2082614464] [2021-05-03 00:17:43,599 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2082614464] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:43,599 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:43,600 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:17:43,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350862965] [2021-05-03 00:17:43,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:17:43,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:43,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:17:43,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:17:43,601 INFO L87 Difference]: Start difference. First operand 167 states and 196 transitions. Second operand has 29 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 27 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:44,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:44,285 INFO L93 Difference]: Finished difference Result 331 states and 386 transitions. [2021-05-03 00:17:44,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:17:44,286 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 27 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-03 00:17:44,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:44,287 INFO L225 Difference]: With dead ends: 331 [2021-05-03 00:17:44,287 INFO L226 Difference]: Without dead ends: 205 [2021-05-03 00:17:44,288 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 867.9ms TimeCoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:17:44,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-05-03 00:17:44,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 167. [2021-05-03 00:17:44,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 157 states have (on average 1.178343949044586) internal successors, (185), 157 states have internal predecessors, (185), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 196 transitions. [2021-05-03 00:17:44,371 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 196 transitions. Word has length 49 [2021-05-03 00:17:44,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:44,371 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 196 transitions. [2021-05-03 00:17:44,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 27 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 196 transitions. [2021-05-03 00:17:44,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:17:44,372 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:44,372 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 8, 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-03 00:17:44,372 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226 [2021-05-03 00:17:44,372 INFO L428 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:44,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:44,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1753798755, now seen corresponding path program 36 times [2021-05-03 00:17:44,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:44,373 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [828475420] [2021-05-03 00:17:44,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:44,380 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_186 v_main_~c~0_761) (< v_main_~c~0_761 v_~SIZE~0_181)) InVars {~SIZE~0=v_~SIZE~0_181, main_~c~0=v_main_~c~0_761, ~last~0=v_~last~0_186} OutVars{~SIZE~0=v_~SIZE~0_181, main_~c~0=v_main_~c~0_761, ~last~0=v_~last~0_186} AuxVars[] AssignedVars[] [2021-05-03 00:17:44,382 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:44,384 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:44,386 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:44,409 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:44,412 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:44,444 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:44,465 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_763 v_~last~0_187) (< v_main_~c~0_763 v_~SIZE~0_182)) InVars {~SIZE~0=v_~SIZE~0_182, main_~c~0=v_main_~c~0_763, ~last~0=v_~last~0_187} OutVars{~SIZE~0=v_~SIZE~0_182, main_~c~0=v_main_~c~0_763, ~last~0=v_~last~0_187} AuxVars[] AssignedVars[] [2021-05-03 00:17:44,466 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:44,482 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:44,483 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:44,499 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:44,504 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:44,521 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:44,540 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:44,541 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_765 v_~last~0_188) (< (+ v_main_~c~0_765 1) v_~SIZE~0_183)) InVars {~SIZE~0=v_~SIZE~0_183, main_~c~0=v_main_~c~0_765, ~last~0=v_~last~0_188} OutVars{~SIZE~0=v_~SIZE~0_183, main_~c~0=v_main_~c~0_765, ~last~0=v_~last~0_188} AuxVars[] AssignedVars[] [2021-05-03 00:17:44,543 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:44,558 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:44,561 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:44,576 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:44,582 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:44,603 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:44,627 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:44,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:44,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:44,808 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:45,577 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:45,577 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [828475420] [2021-05-03 00:17:45,578 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [828475420] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:45,578 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:45,578 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:17:45,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869005819] [2021-05-03 00:17:45,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:17:45,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:45,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:17:45,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:17:45,579 INFO L87 Difference]: Start difference. First operand 167 states and 196 transitions. Second operand has 30 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:46,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:46,382 INFO L93 Difference]: Finished difference Result 330 states and 386 transitions. [2021-05-03 00:17:46,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:17:46,383 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-03 00:17:46,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:46,384 INFO L225 Difference]: With dead ends: 330 [2021-05-03 00:17:46,384 INFO L226 Difference]: Without dead ends: 204 [2021-05-03 00:17:46,384 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 903.6ms TimeCoverageRelationStatistics Valid=138, Invalid=918, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:17:46,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-05-03 00:17:46,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 168. [2021-05-03 00:17:46,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 158 states have (on average 1.1835443037974684) internal successors, (187), 158 states have internal predecessors, (187), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:46,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 198 transitions. [2021-05-03 00:17:46,474 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 198 transitions. Word has length 49 [2021-05-03 00:17:46,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:46,474 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 198 transitions. [2021-05-03 00:17:46,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:46,475 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 198 transitions. [2021-05-03 00:17:46,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:17:46,475 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:46,475 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:46,476 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230 [2021-05-03 00:17:46,476 INFO L428 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:46,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:46,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1919339105, now seen corresponding path program 9 times [2021-05-03 00:17:46,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:46,477 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1870621840] [2021-05-03 00:17:46,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:46,490 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_778 v_~SIZE~0_184) (< v_main_~c~0_778 v_~last~0_189)) InVars {~SIZE~0=v_~SIZE~0_184, main_~c~0=v_main_~c~0_778, ~last~0=v_~last~0_189} OutVars{~SIZE~0=v_~SIZE~0_184, main_~c~0=v_main_~c~0_778, ~last~0=v_~last~0_189} AuxVars[] AssignedVars[] [2021-05-03 00:17:46,492 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:46,509 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:46,511 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:46,528 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:46,539 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:46,559 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:46,582 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:46,585 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_780 1) v_~SIZE~0_185) (< v_main_~c~0_780 v_~last~0_190)) InVars {~SIZE~0=v_~SIZE~0_185, main_~c~0=v_main_~c~0_780, ~last~0=v_~last~0_190} OutVars{~SIZE~0=v_~SIZE~0_185, main_~c~0=v_main_~c~0_780, ~last~0=v_~last~0_190} AuxVars[] AssignedVars[] [2021-05-03 00:17:46,587 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:46,607 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:46,610 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:46,629 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:46,636 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:46,657 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:46,684 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:46,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:46,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:47,689 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:47,689 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1870621840] [2021-05-03 00:17:47,690 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1870621840] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:47,690 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:47,690 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:17:47,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709292330] [2021-05-03 00:17:47,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:17:47,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:47,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:17:47,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:17:47,691 INFO L87 Difference]: Start difference. First operand 168 states and 198 transitions. Second operand has 30 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:48,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:48,923 INFO L93 Difference]: Finished difference Result 338 states and 395 transitions. [2021-05-03 00:17:48,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-03 00:17:48,924 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2021-05-03 00:17:48,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:48,925 INFO L225 Difference]: With dead ends: 338 [2021-05-03 00:17:48,925 INFO L226 Difference]: Without dead ends: 212 [2021-05-03 00:17:48,926 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1304.8ms TimeCoverageRelationStatistics Valid=224, Invalid=1582, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:17:48,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-05-03 00:17:48,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 170. [2021-05-03 00:17:48,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 160 states have (on average 1.18125) internal successors, (189), 160 states have internal predecessors, (189), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:48,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 200 transitions. [2021-05-03 00:17:48,991 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 200 transitions. Word has length 49 [2021-05-03 00:17:48,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:48,991 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 200 transitions. [2021-05-03 00:17:48,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:48,991 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 200 transitions. [2021-05-03 00:17:48,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:17:48,992 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:48,992 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:48,992 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable233 [2021-05-03 00:17:48,992 INFO L428 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:48,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:48,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1708450110, now seen corresponding path program 10 times [2021-05-03 00:17:48,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:48,993 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1890622090] [2021-05-03 00:17:48,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:48,999 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_191 v_main_~c~0_792) (< v_main_~c~0_792 v_~SIZE~0_186)) InVars {~SIZE~0=v_~SIZE~0_186, main_~c~0=v_main_~c~0_792, ~last~0=v_~last~0_191} OutVars{~SIZE~0=v_~SIZE~0_186, main_~c~0=v_main_~c~0_792, ~last~0=v_~last~0_191} AuxVars[] AssignedVars[] [2021-05-03 00:17:49,003 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:49,027 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:49,030 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:49,044 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:49,048 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:49,068 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:49,089 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:49,092 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_192 v_main_~c~0_794) (< (+ v_main_~c~0_794 1) v_~SIZE~0_187)) InVars {~SIZE~0=v_~SIZE~0_187, main_~c~0=v_main_~c~0_794, ~last~0=v_~last~0_192} OutVars{~SIZE~0=v_~SIZE~0_187, main_~c~0=v_main_~c~0_794, ~last~0=v_~last~0_192} AuxVars[] AssignedVars[] [2021-05-03 00:17:49,094 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:49,095 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:49,098 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:49,111 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:49,114 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:49,150 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:49,170 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:49,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:49,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:50,071 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:50,071 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1890622090] [2021-05-03 00:17:50,071 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1890622090] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:50,071 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:50,071 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:17:50,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564448216] [2021-05-03 00:17:50,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:17:50,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:50,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:17:50,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:17:50,072 INFO L87 Difference]: Start difference. First operand 170 states and 200 transitions. Second operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 21 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:50,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:50,901 INFO L93 Difference]: Finished difference Result 355 states and 411 transitions. [2021-05-03 00:17:50,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-03 00:17:50,902 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 21 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-05-03 00:17:50,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:50,903 INFO L225 Difference]: With dead ends: 355 [2021-05-03 00:17:50,903 INFO L226 Difference]: Without dead ends: 229 [2021-05-03 00:17:50,903 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 18 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 848.3ms TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:17:50,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-05-03 00:17:50,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 173. [2021-05-03 00:17:50,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 163 states have (on average 1.177914110429448) internal successors, (192), 163 states have internal predecessors, (192), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:50,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 203 transitions. [2021-05-03 00:17:50,966 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 203 transitions. Word has length 52 [2021-05-03 00:17:50,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:50,967 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 203 transitions. [2021-05-03 00:17:50,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 21 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:50,967 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions. [2021-05-03 00:17:50,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:17:50,967 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:50,967 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 9, 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-03 00:17:50,967 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236 [2021-05-03 00:17:50,967 INFO L428 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:50,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:50,968 INFO L82 PathProgramCache]: Analyzing trace with hash 679090812, now seen corresponding path program 37 times [2021-05-03 00:17:50,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:50,968 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [465451221] [2021-05-03 00:17:50,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:50,975 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_807 v_~SIZE~0_188) (<= v_~last~0_193 v_main_~c~0_807)) InVars {~SIZE~0=v_~SIZE~0_188, main_~c~0=v_main_~c~0_807, ~last~0=v_~last~0_193} OutVars{~SIZE~0=v_~SIZE~0_188, main_~c~0=v_main_~c~0_807, ~last~0=v_~last~0_193} AuxVars[] AssignedVars[] [2021-05-03 00:17:50,977 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:50,994 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:50,996 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:51,008 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:51,011 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:51,028 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:51,048 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_809 v_~SIZE~0_189) (< v_main_~c~0_809 v_~last~0_194)) InVars {~SIZE~0=v_~SIZE~0_189, main_~c~0=v_main_~c~0_809, ~last~0=v_~last~0_194} OutVars{~SIZE~0=v_~SIZE~0_189, main_~c~0=v_main_~c~0_809, ~last~0=v_~last~0_194} AuxVars[] AssignedVars[] [2021-05-03 00:17:51,050 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:51,064 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:51,066 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:51,080 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:51,086 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:51,101 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:51,119 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:51,128 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_811 1) v_~SIZE~0_190) (<= v_~last~0_195 v_main_~c~0_811)) InVars {~SIZE~0=v_~SIZE~0_190, main_~c~0=v_main_~c~0_811, ~last~0=v_~last~0_195} OutVars{~SIZE~0=v_~SIZE~0_190, main_~c~0=v_main_~c~0_811, ~last~0=v_~last~0_195} AuxVars[] AssignedVars[] [2021-05-03 00:17:51,130 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:51,148 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:51,150 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:51,162 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:51,165 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:51,183 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:51,204 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_813 v_~last~0_196) (< (+ v_main_~c~0_813 1) v_~SIZE~0_191)) InVars {~SIZE~0=v_~SIZE~0_191, main_~c~0=v_main_~c~0_813, ~last~0=v_~last~0_196} OutVars{~SIZE~0=v_~SIZE~0_191, main_~c~0=v_main_~c~0_813, ~last~0=v_~last~0_196} AuxVars[] AssignedVars[] [2021-05-03 00:17:51,206 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:51,208 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:51,210 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:51,231 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:51,238 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:51,277 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:51,304 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:51,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:51,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:51,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:51,495 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:52,315 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:52,316 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [465451221] [2021-05-03 00:17:52,316 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [465451221] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:52,316 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:52,316 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-03 00:17:52,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152440675] [2021-05-03 00:17:52,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-03 00:17:52,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:52,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-03 00:17:52,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:17:52,317 INFO L87 Difference]: Start difference. First operand 173 states and 203 transitions. Second operand has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 22 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:53,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:53,194 INFO L93 Difference]: Finished difference Result 358 states and 414 transitions. [2021-05-03 00:17:53,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-03 00:17:53,195 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 22 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-05-03 00:17:53,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:53,195 INFO L225 Difference]: With dead ends: 358 [2021-05-03 00:17:53,196 INFO L226 Difference]: Without dead ends: 232 [2021-05-03 00:17:53,196 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 18 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 930.2ms TimeCoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:17:53,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-05-03 00:17:53,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 173. [2021-05-03 00:17:53,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 163 states have (on average 1.177914110429448) internal successors, (192), 163 states have internal predecessors, (192), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:53,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 203 transitions. [2021-05-03 00:17:53,268 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 203 transitions. Word has length 52 [2021-05-03 00:17:53,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:53,268 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 203 transitions. [2021-05-03 00:17:53,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 22 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:53,269 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions. [2021-05-03 00:17:53,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:17:53,269 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:53,269 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:53,269 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable241 [2021-05-03 00:17:53,269 INFO L428 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:53,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:53,270 INFO L82 PathProgramCache]: Analyzing trace with hash -164914690, now seen corresponding path program 38 times [2021-05-03 00:17:53,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:53,270 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [368238228] [2021-05-03 00:17:53,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:53,293 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_827 v_~SIZE~0_192) (<= v_~last~0_197 v_main_~c~0_827)) InVars {~SIZE~0=v_~SIZE~0_192, main_~c~0=v_main_~c~0_827, ~last~0=v_~last~0_197} OutVars{~SIZE~0=v_~SIZE~0_192, main_~c~0=v_main_~c~0_827, ~last~0=v_~last~0_197} AuxVars[] AssignedVars[] [2021-05-03 00:17:53,296 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:53,298 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:53,300 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:53,314 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:53,318 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:53,356 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:53,379 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_829 v_~SIZE~0_193) (< v_main_~c~0_829 v_~last~0_198)) InVars {~SIZE~0=v_~SIZE~0_193, main_~c~0=v_main_~c~0_829, ~last~0=v_~last~0_198} OutVars{~SIZE~0=v_~SIZE~0_193, main_~c~0=v_main_~c~0_829, ~last~0=v_~last~0_198} AuxVars[] AssignedVars[] [2021-05-03 00:17:53,381 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:53,396 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:53,398 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:53,413 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:53,418 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:53,435 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:53,453 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:53,456 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_831 1) v_~SIZE~0_194) (<= v_~last~0_199 v_main_~c~0_831)) InVars {~SIZE~0=v_~SIZE~0_194, main_~c~0=v_main_~c~0_831, ~last~0=v_~last~0_199} OutVars{~SIZE~0=v_~SIZE~0_194, main_~c~0=v_main_~c~0_831, ~last~0=v_~last~0_199} AuxVars[] AssignedVars[] [2021-05-03 00:17:53,458 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:53,478 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:53,480 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:53,491 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:53,494 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:53,512 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:53,533 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_833 1) v_~SIZE~0_195) (< v_main_~c~0_833 v_~last~0_200)) InVars {~SIZE~0=v_~SIZE~0_195, main_~c~0=v_main_~c~0_833, ~last~0=v_~last~0_200} OutVars{~SIZE~0=v_~SIZE~0_195, main_~c~0=v_main_~c~0_833, ~last~0=v_~last~0_200} AuxVars[] AssignedVars[] [2021-05-03 00:17:53,535 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:53,536 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:53,538 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:53,553 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:53,567 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:53,593 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:53,613 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:53,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:53,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:53,776 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:54,537 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:54,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [368238228] [2021-05-03 00:17:54,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [368238228] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:54,538 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:54,538 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:17:54,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667047414] [2021-05-03 00:17:54,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:17:54,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:54,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:17:54,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:17:54,539 INFO L87 Difference]: Start difference. First operand 173 states and 203 transitions. Second operand has 25 states, 25 states have (on average 1.84) internal successors, (46), 23 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:55,299 INFO L93 Difference]: Finished difference Result 355 states and 411 transitions. [2021-05-03 00:17:55,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-03 00:17:55,300 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 23 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-05-03 00:17:55,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:55,301 INFO L225 Difference]: With dead ends: 355 [2021-05-03 00:17:55,301 INFO L226 Difference]: Without dead ends: 229 [2021-05-03 00:17:55,301 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 17 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 856.3ms TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:17:55,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-05-03 00:17:55,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 173. [2021-05-03 00:17:55,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 163 states have (on average 1.177914110429448) internal successors, (192), 163 states have internal predecessors, (192), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:55,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 203 transitions. [2021-05-03 00:17:55,375 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 203 transitions. Word has length 52 [2021-05-03 00:17:55,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:55,375 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 203 transitions. [2021-05-03 00:17:55,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 23 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:55,376 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions. [2021-05-03 00:17:55,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:17:55,376 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:55,376 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:55,376 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable246 [2021-05-03 00:17:55,376 INFO L428 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:55,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:55,377 INFO L82 PathProgramCache]: Analyzing trace with hash 109844924, now seen corresponding path program 39 times [2021-05-03 00:17:55,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:55,377 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [999113665] [2021-05-03 00:17:55,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:55,384 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_201 v_main_~c~0_847) (< v_main_~c~0_847 v_~SIZE~0_196)) InVars {~SIZE~0=v_~SIZE~0_196, main_~c~0=v_main_~c~0_847, ~last~0=v_~last~0_201} OutVars{~SIZE~0=v_~SIZE~0_196, main_~c~0=v_main_~c~0_847, ~last~0=v_~last~0_201} AuxVars[] AssignedVars[] [2021-05-03 00:17:55,386 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:55,404 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:55,406 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:55,418 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:55,421 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:55,438 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:55,459 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_849 v_~last~0_202) (< v_main_~c~0_849 v_~SIZE~0_197)) InVars {~SIZE~0=v_~SIZE~0_197, main_~c~0=v_main_~c~0_849, ~last~0=v_~last~0_202} OutVars{~SIZE~0=v_~SIZE~0_197, main_~c~0=v_main_~c~0_849, ~last~0=v_~last~0_202} AuxVars[] AssignedVars[] [2021-05-03 00:17:55,460 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:55,475 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:55,477 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:55,498 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:55,503 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:55,519 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:55,539 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:55,542 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_851 1) v_~SIZE~0_198) (<= v_~last~0_203 v_main_~c~0_851)) InVars {~SIZE~0=v_~SIZE~0_198, main_~c~0=v_main_~c~0_851, ~last~0=v_~last~0_203} OutVars{~SIZE~0=v_~SIZE~0_198, main_~c~0=v_main_~c~0_851, ~last~0=v_~last~0_203} AuxVars[] AssignedVars[] [2021-05-03 00:17:55,544 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:55,545 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:55,548 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:55,559 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:55,563 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:55,597 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:55,618 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_853 1) v_~SIZE~0_199) (< v_main_~c~0_853 v_~last~0_204)) InVars {~SIZE~0=v_~SIZE~0_199, main_~c~0=v_main_~c~0_853, ~last~0=v_~last~0_204} OutVars{~SIZE~0=v_~SIZE~0_199, main_~c~0=v_main_~c~0_853, ~last~0=v_~last~0_204} AuxVars[] AssignedVars[] [2021-05-03 00:17:55,620 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:55,621 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:55,623 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:55,638 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:55,644 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:55,672 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:55,692 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:55,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:55,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:55,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:55,856 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:56,636 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:56,636 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [999113665] [2021-05-03 00:17:56,636 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [999113665] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:56,636 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:56,637 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:17:56,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50298454] [2021-05-03 00:17:56,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:17:56,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:56,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:17:56,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:17:56,638 INFO L87 Difference]: Start difference. First operand 173 states and 203 transitions. Second operand has 26 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 24 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:57,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:57,449 INFO L93 Difference]: Finished difference Result 352 states and 408 transitions. [2021-05-03 00:17:57,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:17:57,450 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 24 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-05-03 00:17:57,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:57,452 INFO L225 Difference]: With dead ends: 352 [2021-05-03 00:17:57,452 INFO L226 Difference]: Without dead ends: 226 [2021-05-03 00:17:57,452 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 886.0ms TimeCoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:17:57,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-05-03 00:17:57,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 173. [2021-05-03 00:17:57,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 163 states have (on average 1.177914110429448) internal successors, (192), 163 states have internal predecessors, (192), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:57,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 203 transitions. [2021-05-03 00:17:57,529 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 203 transitions. Word has length 52 [2021-05-03 00:17:57,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:57,529 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 203 transitions. [2021-05-03 00:17:57,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 24 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:57,529 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions. [2021-05-03 00:17:57,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:17:57,530 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:57,530 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:57,530 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable251 [2021-05-03 00:17:57,530 INFO L428 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:57,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:57,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1496048318, now seen corresponding path program 40 times [2021-05-03 00:17:57,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:57,531 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1423764801] [2021-05-03 00:17:57,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:57,539 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_205 v_main_~c~0_867) (< v_main_~c~0_867 v_~SIZE~0_200)) InVars {~SIZE~0=v_~SIZE~0_200, main_~c~0=v_main_~c~0_867, ~last~0=v_~last~0_205} OutVars{~SIZE~0=v_~SIZE~0_200, main_~c~0=v_main_~c~0_867, ~last~0=v_~last~0_205} AuxVars[] AssignedVars[] [2021-05-03 00:17:57,543 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:57,544 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:57,546 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:57,557 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:57,560 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:57,591 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:57,611 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_869 v_~SIZE~0_201) (< v_main_~c~0_869 v_~last~0_206)) InVars {~SIZE~0=v_~SIZE~0_201, main_~c~0=v_main_~c~0_869, ~last~0=v_~last~0_206} OutVars{~SIZE~0=v_~SIZE~0_201, main_~c~0=v_main_~c~0_869, ~last~0=v_~last~0_206} AuxVars[] AssignedVars[] [2021-05-03 00:17:57,613 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:57,628 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:57,630 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:57,644 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:57,649 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:57,664 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:57,683 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:57,685 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_871 1) v_~SIZE~0_202) (<= v_~last~0_207 v_main_~c~0_871)) InVars {~SIZE~0=v_~SIZE~0_202, main_~c~0=v_main_~c~0_871, ~last~0=v_~last~0_207} OutVars{~SIZE~0=v_~SIZE~0_202, main_~c~0=v_main_~c~0_871, ~last~0=v_~last~0_207} AuxVars[] AssignedVars[] [2021-05-03 00:17:57,687 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:57,687 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:57,693 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:57,706 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:57,709 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:57,741 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:57,761 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_873 v_~last~0_208) (< (+ v_main_~c~0_873 1) v_~SIZE~0_203)) InVars {~SIZE~0=v_~SIZE~0_203, main_~c~0=v_main_~c~0_873, ~last~0=v_~last~0_208} OutVars{~SIZE~0=v_~SIZE~0_203, main_~c~0=v_main_~c~0_873, ~last~0=v_~last~0_208} AuxVars[] AssignedVars[] [2021-05-03 00:17:57,763 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:57,765 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:57,767 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:57,789 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:57,794 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:57,822 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:57,841 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:57,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:57,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:17:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:58,004 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:58,794 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:58,794 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1423764801] [2021-05-03 00:17:58,794 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1423764801] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:58,794 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:58,794 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:17:58,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081107999] [2021-05-03 00:17:58,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:17:58,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:58,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:17:58,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:17:58,795 INFO L87 Difference]: Start difference. First operand 173 states and 203 transitions. Second operand has 27 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 25 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:59,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:59,545 INFO L93 Difference]: Finished difference Result 349 states and 405 transitions. [2021-05-03 00:17:59,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:17:59,546 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 25 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-05-03 00:17:59,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:59,547 INFO L225 Difference]: With dead ends: 349 [2021-05-03 00:17:59,547 INFO L226 Difference]: Without dead ends: 223 [2021-05-03 00:17:59,548 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 15 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 903.6ms TimeCoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:17:59,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-05-03 00:17:59,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 173. [2021-05-03 00:17:59,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 163 states have (on average 1.177914110429448) internal successors, (192), 163 states have internal predecessors, (192), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:17:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 203 transitions. [2021-05-03 00:17:59,666 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 203 transitions. Word has length 52 [2021-05-03 00:17:59,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:59,667 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 203 transitions. [2021-05-03 00:17:59,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 25 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:17:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions. [2021-05-03 00:17:59,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:17:59,667 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:59,667 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:59,668 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable256 [2021-05-03 00:17:59,668 INFO L428 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:59,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:59,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1558087932, now seen corresponding path program 41 times [2021-05-03 00:17:59,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:59,669 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [290702001] [2021-05-03 00:17:59,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:59,677 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_209 v_main_~c~0_887) (< v_main_~c~0_887 v_~SIZE~0_204)) InVars {~SIZE~0=v_~SIZE~0_204, main_~c~0=v_main_~c~0_887, ~last~0=v_~last~0_209} OutVars{~SIZE~0=v_~SIZE~0_204, main_~c~0=v_main_~c~0_887, ~last~0=v_~last~0_209} AuxVars[] AssignedVars[] [2021-05-03 00:17:59,680 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:59,681 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:59,683 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:59,698 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:59,702 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:59,741 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:17:59,765 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_889 v_~last~0_210) (< v_main_~c~0_889 v_~SIZE~0_205)) InVars {~SIZE~0=v_~SIZE~0_205, main_~c~0=v_main_~c~0_889, ~last~0=v_~last~0_210} OutVars{~SIZE~0=v_~SIZE~0_205, main_~c~0=v_main_~c~0_889, ~last~0=v_~last~0_210} AuxVars[] AssignedVars[] [2021-05-03 00:17:59,767 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:17:59,787 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:59,790 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:59,809 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:59,816 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:59,835 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:17:59,860 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:59,863 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_211 v_main_~c~0_891) (< (+ v_main_~c~0_891 1) v_~SIZE~0_206)) InVars {~SIZE~0=v_~SIZE~0_206, main_~c~0=v_main_~c~0_891, ~last~0=v_~last~0_211} OutVars{~SIZE~0=v_~SIZE~0_206, main_~c~0=v_main_~c~0_891, ~last~0=v_~last~0_211} AuxVars[] AssignedVars[] [2021-05-03 00:17:59,866 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:17:59,868 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:59,870 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:59,883 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:59,887 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:17:59,923 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:17:59,949 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_893 1) v_~SIZE~0_207) (< v_main_~c~0_893 v_~last~0_212)) InVars {~SIZE~0=v_~SIZE~0_207, main_~c~0=v_main_~c~0_893, ~last~0=v_~last~0_212} OutVars{~SIZE~0=v_~SIZE~0_207, main_~c~0=v_main_~c~0_893, ~last~0=v_~last~0_212} AuxVars[] AssignedVars[] [2021-05-03 00:17:59,951 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:17:59,970 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:59,973 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:59,993 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:17:59,999 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:00,033 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:00,057 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:00,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:00,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:00,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:00,229 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:00,990 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:00,990 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [290702001] [2021-05-03 00:18:00,990 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [290702001] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:00,990 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:00,990 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:18:00,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014483880] [2021-05-03 00:18:00,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:18:00,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:00,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:18:00,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:18:00,991 INFO L87 Difference]: Start difference. First operand 173 states and 203 transitions. Second operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 26 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:01,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:01,776 INFO L93 Difference]: Finished difference Result 346 states and 402 transitions. [2021-05-03 00:18:01,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:18:01,777 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 26 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-05-03 00:18:01,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:01,778 INFO L225 Difference]: With dead ends: 346 [2021-05-03 00:18:01,778 INFO L226 Difference]: Without dead ends: 220 [2021-05-03 00:18:01,779 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 13 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 879.8ms TimeCoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:18:01,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-05-03 00:18:01,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 173. [2021-05-03 00:18:01,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 163 states have (on average 1.177914110429448) internal successors, (192), 163 states have internal predecessors, (192), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:01,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 203 transitions. [2021-05-03 00:18:01,866 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 203 transitions. Word has length 52 [2021-05-03 00:18:01,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:01,867 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 203 transitions. [2021-05-03 00:18:01,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 26 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:01,867 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions. [2021-05-03 00:18:01,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:18:01,867 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:01,867 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:01,867 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261 [2021-05-03 00:18:01,867 INFO L428 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:01,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:01,868 INFO L82 PathProgramCache]: Analyzing trace with hash -247350402, now seen corresponding path program 42 times [2021-05-03 00:18:01,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:01,868 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [672942643] [2021-05-03 00:18:01,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:01,876 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_213 v_main_~c~0_907) (< v_main_~c~0_907 v_~SIZE~0_208)) InVars {~SIZE~0=v_~SIZE~0_208, main_~c~0=v_main_~c~0_907, ~last~0=v_~last~0_213} OutVars{~SIZE~0=v_~SIZE~0_208, main_~c~0=v_main_~c~0_907, ~last~0=v_~last~0_213} AuxVars[] AssignedVars[] [2021-05-03 00:18:01,879 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:01,880 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:01,882 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:01,895 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:01,898 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:01,939 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:01,962 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_909 v_~SIZE~0_209) (< v_main_~c~0_909 v_~last~0_214)) InVars {~SIZE~0=v_~SIZE~0_209, main_~c~0=v_main_~c~0_909, ~last~0=v_~last~0_214} OutVars{~SIZE~0=v_~SIZE~0_209, main_~c~0=v_main_~c~0_909, ~last~0=v_~last~0_214} AuxVars[] AssignedVars[] [2021-05-03 00:18:01,964 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:01,965 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:01,967 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:01,981 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:01,986 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:02,014 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:02,032 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:02,035 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_911 1) v_~SIZE~0_210) (<= v_~last~0_215 v_main_~c~0_911)) InVars {~SIZE~0=v_~SIZE~0_210, main_~c~0=v_main_~c~0_911, ~last~0=v_~last~0_215} OutVars{~SIZE~0=v_~SIZE~0_210, main_~c~0=v_main_~c~0_911, ~last~0=v_~last~0_215} AuxVars[] AssignedVars[] [2021-05-03 00:18:02,036 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:02,037 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:02,039 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:02,055 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:02,058 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:02,089 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:02,109 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_913 v_~last~0_216) (< (+ v_main_~c~0_913 1) v_~SIZE~0_211)) InVars {~SIZE~0=v_~SIZE~0_211, main_~c~0=v_main_~c~0_913, ~last~0=v_~last~0_216} OutVars{~SIZE~0=v_~SIZE~0_211, main_~c~0=v_main_~c~0_913, ~last~0=v_~last~0_216} AuxVars[] AssignedVars[] [2021-05-03 00:18:02,111 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:02,112 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:02,115 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:02,129 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:02,135 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:02,163 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:02,182 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:02,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:02,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:02,335 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:03,121 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:03,121 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [672942643] [2021-05-03 00:18:03,121 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [672942643] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:03,121 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:03,121 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:18:03,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079933527] [2021-05-03 00:18:03,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:18:03,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:03,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:18:03,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:18:03,122 INFO L87 Difference]: Start difference. First operand 173 states and 203 transitions. Second operand has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 27 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:04,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:04,096 INFO L93 Difference]: Finished difference Result 343 states and 399 transitions. [2021-05-03 00:18:04,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:18:04,097 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 27 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-05-03 00:18:04,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:04,098 INFO L225 Difference]: With dead ends: 343 [2021-05-03 00:18:04,098 INFO L226 Difference]: Without dead ends: 217 [2021-05-03 00:18:04,099 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 11 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 892.6ms TimeCoverageRelationStatistics Valid=128, Invalid=864, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:18:04,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-05-03 00:18:04,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 173. [2021-05-03 00:18:04,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 163 states have (on average 1.177914110429448) internal successors, (192), 163 states have internal predecessors, (192), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:04,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 203 transitions. [2021-05-03 00:18:04,186 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 203 transitions. Word has length 52 [2021-05-03 00:18:04,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:04,186 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 203 transitions. [2021-05-03 00:18:04,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 27 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:04,187 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions. [2021-05-03 00:18:04,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:18:04,187 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:04,187 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:04,187 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable266 [2021-05-03 00:18:04,187 INFO L428 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:04,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:04,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1064998852, now seen corresponding path program 43 times [2021-05-03 00:18:04,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:04,188 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [219718535] [2021-05-03 00:18:04,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:04,198 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_217 v_main_~c~0_927) (< v_main_~c~0_927 v_~SIZE~0_212)) InVars {~SIZE~0=v_~SIZE~0_212, main_~c~0=v_main_~c~0_927, ~last~0=v_~last~0_217} OutVars{~SIZE~0=v_~SIZE~0_212, main_~c~0=v_main_~c~0_927, ~last~0=v_~last~0_217} AuxVars[] AssignedVars[] [2021-05-03 00:18:04,201 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:04,202 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:04,204 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:04,216 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:04,219 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:04,252 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:04,273 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_929 v_~last~0_218) (< v_main_~c~0_929 v_~SIZE~0_213)) InVars {~SIZE~0=v_~SIZE~0_213, main_~c~0=v_main_~c~0_929, ~last~0=v_~last~0_218} OutVars{~SIZE~0=v_~SIZE~0_213, main_~c~0=v_main_~c~0_929, ~last~0=v_~last~0_218} AuxVars[] AssignedVars[] [2021-05-03 00:18:04,275 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:04,290 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:04,292 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:04,307 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:04,312 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:04,329 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:04,348 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:04,350 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_219 v_main_~c~0_931) (< (+ v_main_~c~0_931 1) v_~SIZE~0_214)) InVars {~SIZE~0=v_~SIZE~0_214, main_~c~0=v_main_~c~0_931, ~last~0=v_~last~0_219} OutVars{~SIZE~0=v_~SIZE~0_214, main_~c~0=v_main_~c~0_931, ~last~0=v_~last~0_219} AuxVars[] AssignedVars[] [2021-05-03 00:18:04,352 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:04,372 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:04,374 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:04,387 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:04,390 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:04,408 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:04,429 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_933 v_~last~0_220) (< (+ v_main_~c~0_933 1) v_~SIZE~0_215)) InVars {~SIZE~0=v_~SIZE~0_215, main_~c~0=v_main_~c~0_933, ~last~0=v_~last~0_220} OutVars{~SIZE~0=v_~SIZE~0_215, main_~c~0=v_main_~c~0_933, ~last~0=v_~last~0_220} AuxVars[] AssignedVars[] [2021-05-03 00:18:04,431 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:04,446 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:04,448 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:04,463 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:04,468 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:04,484 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:04,503 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:04,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:04,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:04,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:04,660 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:05,493 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:05,493 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [219718535] [2021-05-03 00:18:05,493 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [219718535] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:05,493 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:05,493 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:18:05,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912967018] [2021-05-03 00:18:05,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:18:05,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:05,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:18:05,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:18:05,495 INFO L87 Difference]: Start difference. First operand 173 states and 203 transitions. Second operand has 30 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 28 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:06,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:06,405 INFO L93 Difference]: Finished difference Result 340 states and 396 transitions. [2021-05-03 00:18:06,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:18:06,406 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 28 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-05-03 00:18:06,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:06,407 INFO L225 Difference]: With dead ends: 340 [2021-05-03 00:18:06,407 INFO L226 Difference]: Without dead ends: 214 [2021-05-03 00:18:06,408 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 12 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 932.7ms TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:18:06,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-05-03 00:18:06,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 173. [2021-05-03 00:18:06,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 163 states have (on average 1.177914110429448) internal successors, (192), 163 states have internal predecessors, (192), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 203 transitions. [2021-05-03 00:18:06,491 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 203 transitions. Word has length 52 [2021-05-03 00:18:06,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:06,492 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 203 transitions. [2021-05-03 00:18:06,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 28 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:06,492 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions. [2021-05-03 00:18:06,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:18:06,492 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:06,492 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:06,492 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable271 [2021-05-03 00:18:06,492 INFO L428 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:06,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:06,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1641620542, now seen corresponding path program 44 times [2021-05-03 00:18:06,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:06,493 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1405968430] [2021-05-03 00:18:06,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:06,518 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_947 v_~SIZE~0_216) (<= v_~last~0_221 v_main_~c~0_947)) InVars {~SIZE~0=v_~SIZE~0_216, main_~c~0=v_main_~c~0_947, ~last~0=v_~last~0_221} OutVars{~SIZE~0=v_~SIZE~0_216, main_~c~0=v_main_~c~0_947, ~last~0=v_~last~0_221} AuxVars[] AssignedVars[] [2021-05-03 00:18:06,521 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:06,523 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:06,525 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:06,540 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:06,544 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:06,579 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:06,600 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_949 v_~last~0_222) (< v_main_~c~0_949 v_~SIZE~0_217)) InVars {~SIZE~0=v_~SIZE~0_217, main_~c~0=v_main_~c~0_949, ~last~0=v_~last~0_222} OutVars{~SIZE~0=v_~SIZE~0_217, main_~c~0=v_main_~c~0_949, ~last~0=v_~last~0_222} AuxVars[] AssignedVars[] [2021-05-03 00:18:06,603 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:06,604 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:06,606 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:06,621 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:06,626 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:06,655 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:06,674 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:06,676 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_223 v_main_~c~0_951) (< (+ v_main_~c~0_951 1) v_~SIZE~0_218)) InVars {~SIZE~0=v_~SIZE~0_218, main_~c~0=v_main_~c~0_951, ~last~0=v_~last~0_223} OutVars{~SIZE~0=v_~SIZE~0_218, main_~c~0=v_main_~c~0_951, ~last~0=v_~last~0_223} AuxVars[] AssignedVars[] [2021-05-03 00:18:06,678 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:06,697 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:06,700 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:06,711 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:06,714 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:06,734 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:06,755 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_953 1) v_~SIZE~0_219) (< v_main_~c~0_953 v_~last~0_224)) InVars {~SIZE~0=v_~SIZE~0_219, main_~c~0=v_main_~c~0_953, ~last~0=v_~last~0_224} OutVars{~SIZE~0=v_~SIZE~0_219, main_~c~0=v_main_~c~0_953, ~last~0=v_~last~0_224} AuxVars[] AssignedVars[] [2021-05-03 00:18:06,757 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:06,758 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:06,760 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:06,775 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:06,781 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:06,810 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:06,830 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:06,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:06,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:07,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:07,006 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:07,882 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:07,882 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1405968430] [2021-05-03 00:18:07,882 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1405968430] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:07,882 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:07,882 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:18:07,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826703524] [2021-05-03 00:18:07,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:18:07,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:07,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:18:07,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:18:07,884 INFO L87 Difference]: Start difference. First operand 173 states and 203 transitions. Second operand has 31 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 29 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:08,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:08,697 INFO L93 Difference]: Finished difference Result 337 states and 393 transitions. [2021-05-03 00:18:08,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:18:08,698 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 29 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-05-03 00:18:08,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:08,699 INFO L225 Difference]: With dead ends: 337 [2021-05-03 00:18:08,699 INFO L226 Difference]: Without dead ends: 211 [2021-05-03 00:18:08,700 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 995.0ms TimeCoverageRelationStatistics Valid=142, Invalid=980, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:18:08,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-05-03 00:18:08,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 173. [2021-05-03 00:18:08,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 163 states have (on average 1.177914110429448) internal successors, (192), 163 states have internal predecessors, (192), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:08,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 203 transitions. [2021-05-03 00:18:08,789 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 203 transitions. Word has length 52 [2021-05-03 00:18:08,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:08,789 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 203 transitions. [2021-05-03 00:18:08,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 29 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:08,789 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions. [2021-05-03 00:18:08,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:18:08,789 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:08,790 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 9, 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-03 00:18:08,790 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable276 [2021-05-03 00:18:08,790 INFO L428 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:08,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:08,790 INFO L82 PathProgramCache]: Analyzing trace with hash 630503292, now seen corresponding path program 45 times [2021-05-03 00:18:08,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:08,790 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [45293401] [2021-05-03 00:18:08,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:08,797 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_967 v_~SIZE~0_220) (<= v_~last~0_225 v_main_~c~0_967)) InVars {~SIZE~0=v_~SIZE~0_220, main_~c~0=v_main_~c~0_967, ~last~0=v_~last~0_225} OutVars{~SIZE~0=v_~SIZE~0_220, main_~c~0=v_main_~c~0_967, ~last~0=v_~last~0_225} AuxVars[] AssignedVars[] [2021-05-03 00:18:08,799 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:08,800 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:08,801 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:08,814 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:08,817 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:08,847 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:08,868 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_969 v_~last~0_226) (< v_main_~c~0_969 v_~SIZE~0_221)) InVars {~SIZE~0=v_~SIZE~0_221, main_~c~0=v_main_~c~0_969, ~last~0=v_~last~0_226} OutVars{~SIZE~0=v_~SIZE~0_221, main_~c~0=v_main_~c~0_969, ~last~0=v_~last~0_226} AuxVars[] AssignedVars[] [2021-05-03 00:18:08,869 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:08,870 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:08,872 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:08,887 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:08,893 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:08,923 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:08,942 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:08,943 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_971 1) v_~SIZE~0_222) (< v_main_~c~0_971 v_~last~0_227)) InVars {~SIZE~0=v_~SIZE~0_222, main_~c~0=v_main_~c~0_971, ~last~0=v_~last~0_227} OutVars{~SIZE~0=v_~SIZE~0_222, main_~c~0=v_main_~c~0_971, ~last~0=v_~last~0_227} AuxVars[] AssignedVars[] [2021-05-03 00:18:08,945 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:08,946 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:08,948 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:08,963 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:08,969 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:09,003 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:09,022 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:09,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:09,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:09,198 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:10,143 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:10,144 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [45293401] [2021-05-03 00:18:10,144 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [45293401] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:10,144 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:10,144 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:18:10,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310099051] [2021-05-03 00:18:10,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:18:10,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:10,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:18:10,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:18:10,145 INFO L87 Difference]: Start difference. First operand 173 states and 203 transitions. Second operand has 32 states, 32 states have (on average 1.4375) internal successors, (46), 30 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:10,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:10,963 INFO L93 Difference]: Finished difference Result 336 states and 393 transitions. [2021-05-03 00:18:10,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:18:10,964 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.4375) internal successors, (46), 30 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-05-03 00:18:10,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:10,965 INFO L225 Difference]: With dead ends: 336 [2021-05-03 00:18:10,965 INFO L226 Difference]: Without dead ends: 210 [2021-05-03 00:18:10,965 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1060.8ms TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:18:10,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-05-03 00:18:11,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 174. [2021-05-03 00:18:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 164 states have (on average 1.1829268292682926) internal successors, (194), 164 states have internal predecessors, (194), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:11,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 205 transitions. [2021-05-03 00:18:11,042 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 205 transitions. Word has length 52 [2021-05-03 00:18:11,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:11,042 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 205 transitions. [2021-05-03 00:18:11,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 1.4375) internal successors, (46), 30 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:11,042 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 205 transitions. [2021-05-03 00:18:11,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:18:11,043 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:11,043 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:11,043 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable280 [2021-05-03 00:18:11,043 INFO L428 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:11,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:11,043 INFO L82 PathProgramCache]: Analyzing trace with hash 464962942, now seen corresponding path program 10 times [2021-05-03 00:18:11,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:11,044 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1711397627] [2021-05-03 00:18:11,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:11,049 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_985 v_~last~0_228) (< v_main_~c~0_985 v_~SIZE~0_223)) InVars {~SIZE~0=v_~SIZE~0_223, main_~c~0=v_main_~c~0_985, ~last~0=v_~last~0_228} OutVars{~SIZE~0=v_~SIZE~0_223, main_~c~0=v_main_~c~0_985, ~last~0=v_~last~0_228} AuxVars[] AssignedVars[] [2021-05-03 00:18:11,052 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:11,068 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:11,069 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:11,088 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:11,093 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:11,110 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:11,129 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:11,131 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_987 v_~last~0_229) (< (+ v_main_~c~0_987 1) v_~SIZE~0_224)) InVars {~SIZE~0=v_~SIZE~0_224, main_~c~0=v_main_~c~0_987, ~last~0=v_~last~0_229} OutVars{~SIZE~0=v_~SIZE~0_224, main_~c~0=v_main_~c~0_987, ~last~0=v_~last~0_229} AuxVars[] AssignedVars[] [2021-05-03 00:18:11,133 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:11,147 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:11,149 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:11,164 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:11,169 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:11,187 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:11,207 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:11,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:11,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:11,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:12,128 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:12,129 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1711397627] [2021-05-03 00:18:12,129 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1711397627] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:12,129 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:12,129 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:18:12,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457221610] [2021-05-03 00:18:12,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:18:12,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:12,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:18:12,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:18:12,130 INFO L87 Difference]: Start difference. First operand 174 states and 205 transitions. Second operand has 31 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 29 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:13,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:13,486 INFO L93 Difference]: Finished difference Result 345 states and 403 transitions. [2021-05-03 00:18:13,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-03 00:18:13,486 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 29 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2021-05-03 00:18:13,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:13,488 INFO L225 Difference]: With dead ends: 345 [2021-05-03 00:18:13,488 INFO L226 Difference]: Without dead ends: 219 [2021-05-03 00:18:13,489 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1266.8ms TimeCoverageRelationStatistics Valid=240, Invalid=1740, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:18:13,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-05-03 00:18:13,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 176. [2021-05-03 00:18:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 166 states have (on average 1.180722891566265) internal successors, (196), 166 states have internal predecessors, (196), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:13,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 207 transitions. [2021-05-03 00:18:13,623 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 207 transitions. Word has length 52 [2021-05-03 00:18:13,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:13,624 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 207 transitions. [2021-05-03 00:18:13,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 29 states have internal predecessors, (46), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:13,624 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 207 transitions. [2021-05-03 00:18:13,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:18:13,624 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:13,625 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:13,625 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable283 [2021-05-03 00:18:13,625 INFO L428 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:13,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:13,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1857944317, now seen corresponding path program 11 times [2021-05-03 00:18:13,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:13,626 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [322033256] [2021-05-03 00:18:13,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:13,635 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1000 v_~SIZE~0_225) (<= v_~last~0_230 v_main_~c~0_1000)) InVars {~SIZE~0=v_~SIZE~0_225, main_~c~0=v_main_~c~0_1000, ~last~0=v_~last~0_230} OutVars{~SIZE~0=v_~SIZE~0_225, main_~c~0=v_main_~c~0_1000, ~last~0=v_~last~0_230} AuxVars[] AssignedVars[] [2021-05-03 00:18:13,637 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:13,660 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:13,663 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:13,676 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:13,680 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:13,706 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:13,728 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:13,730 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1002 1) v_~SIZE~0_226) (<= v_~last~0_231 v_main_~c~0_1002)) InVars {~SIZE~0=v_~SIZE~0_226, main_~c~0=v_main_~c~0_1002, ~last~0=v_~last~0_231} OutVars{~SIZE~0=v_~SIZE~0_226, main_~c~0=v_main_~c~0_1002, ~last~0=v_~last~0_231} AuxVars[] AssignedVars[] [2021-05-03 00:18:13,733 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:13,758 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:13,761 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:13,776 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:13,780 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:13,803 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:13,824 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:13,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:13,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:13,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:14,549 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:14,550 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [322033256] [2021-05-03 00:18:14,550 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [322033256] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:14,550 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:14,550 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-03 00:18:14,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136606627] [2021-05-03 00:18:14,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-03 00:18:14,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:14,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-03 00:18:14,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:18:14,551 INFO L87 Difference]: Start difference. First operand 176 states and 207 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:15,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:15,436 INFO L93 Difference]: Finished difference Result 387 states and 448 transitions. [2021-05-03 00:18:15,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-03 00:18:15,437 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:18:15,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:15,438 INFO L225 Difference]: With dead ends: 387 [2021-05-03 00:18:15,438 INFO L226 Difference]: Without dead ends: 261 [2021-05-03 00:18:15,439 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 13 SyntacticMatches, 20 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 657.0ms TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:18:15,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-05-03 00:18:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 197. [2021-05-03 00:18:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 187 states have (on average 1.160427807486631) internal successors, (217), 187 states have internal predecessors, (217), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:15,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 228 transitions. [2021-05-03 00:18:15,575 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 228 transitions. Word has length 55 [2021-05-03 00:18:15,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:15,575 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 228 transitions. [2021-05-03 00:18:15,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 228 transitions. [2021-05-03 00:18:15,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:18:15,576 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:15,576 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 10, 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-03 00:18:15,576 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable286 [2021-05-03 00:18:15,576 INFO L428 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:15,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:15,576 INFO L82 PathProgramCache]: Analyzing trace with hash -2013376257, now seen corresponding path program 46 times [2021-05-03 00:18:15,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:15,576 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [432314179] [2021-05-03 00:18:15,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:15,585 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1016 v_~SIZE~0_227) (<= v_~last~0_232 v_main_~c~0_1016)) InVars {~SIZE~0=v_~SIZE~0_227, main_~c~0=v_main_~c~0_1016, ~last~0=v_~last~0_232} OutVars{~SIZE~0=v_~SIZE~0_227, main_~c~0=v_main_~c~0_1016, ~last~0=v_~last~0_232} AuxVars[] AssignedVars[] [2021-05-03 00:18:15,587 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:15,589 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:15,591 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:15,605 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:15,610 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:15,647 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:15,671 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1018 v_~last~0_233) (< v_main_~c~0_1018 v_~SIZE~0_228)) InVars {~SIZE~0=v_~SIZE~0_228, main_~c~0=v_main_~c~0_1018, ~last~0=v_~last~0_233} OutVars{~SIZE~0=v_~SIZE~0_228, main_~c~0=v_main_~c~0_1018, ~last~0=v_~last~0_233} AuxVars[] AssignedVars[] [2021-05-03 00:18:15,673 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:15,674 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:15,677 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:15,696 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:15,702 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:15,734 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:15,759 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:15,762 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_234 v_main_~c~0_1020) (< (+ v_main_~c~0_1020 1) v_~SIZE~0_229)) InVars {~SIZE~0=v_~SIZE~0_229, main_~c~0=v_main_~c~0_1020, ~last~0=v_~last~0_234} OutVars{~SIZE~0=v_~SIZE~0_229, main_~c~0=v_main_~c~0_1020, ~last~0=v_~last~0_234} AuxVars[] AssignedVars[] [2021-05-03 00:18:15,765 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:15,792 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:15,794 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:15,807 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:15,811 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:15,831 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:15,854 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1022 v_~last~0_235) (< (+ v_main_~c~0_1022 1) v_~SIZE~0_230)) InVars {~SIZE~0=v_~SIZE~0_230, main_~c~0=v_main_~c~0_1022, ~last~0=v_~last~0_235} OutVars{~SIZE~0=v_~SIZE~0_230, main_~c~0=v_main_~c~0_1022, ~last~0=v_~last~0_235} AuxVars[] AssignedVars[] [2021-05-03 00:18:15,856 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:15,874 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:15,876 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:15,894 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:15,901 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:15,919 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:15,940 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:16,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:16,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:16,127 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:17,035 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:17,036 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [432314179] [2021-05-03 00:18:17,036 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [432314179] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:17,036 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:17,036 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:18:17,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741860465] [2021-05-03 00:18:17,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:18:17,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:17,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:18:17,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:18:17,037 INFO L87 Difference]: Start difference. First operand 197 states and 228 transitions. Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 23 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:18,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:18,137 INFO L93 Difference]: Finished difference Result 421 states and 478 transitions. [2021-05-03 00:18:18,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-03 00:18:18,139 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 23 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:18:18,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:18,140 INFO L225 Difference]: With dead ends: 421 [2021-05-03 00:18:18,140 INFO L226 Difference]: Without dead ends: 268 [2021-05-03 00:18:18,141 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 19 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1014.4ms TimeCoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:18:18,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-05-03 00:18:18,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 197. [2021-05-03 00:18:18,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 187 states have (on average 1.160427807486631) internal successors, (217), 187 states have internal predecessors, (217), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 228 transitions. [2021-05-03 00:18:18,274 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 228 transitions. Word has length 55 [2021-05-03 00:18:18,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:18,275 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 228 transitions. [2021-05-03 00:18:18,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 23 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:18,275 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 228 transitions. [2021-05-03 00:18:18,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:18:18,275 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:18,275 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:18,276 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable291 [2021-05-03 00:18:18,276 INFO L428 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:18,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:18,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1252231741, now seen corresponding path program 47 times [2021-05-03 00:18:18,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:18,276 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [860562807] [2021-05-03 00:18:18,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:18,294 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1037 v_~SIZE~0_231) (<= v_~last~0_236 v_main_~c~0_1037)) InVars {~SIZE~0=v_~SIZE~0_231, main_~c~0=v_main_~c~0_1037, ~last~0=v_~last~0_236} OutVars{~SIZE~0=v_~SIZE~0_231, main_~c~0=v_main_~c~0_1037, ~last~0=v_~last~0_236} AuxVars[] AssignedVars[] [2021-05-03 00:18:18,297 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:18,322 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:18,325 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:18,341 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:18,345 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:18,369 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:18,397 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1039 v_~last~0_237) (< v_main_~c~0_1039 v_~SIZE~0_232)) InVars {~SIZE~0=v_~SIZE~0_232, main_~c~0=v_main_~c~0_1039, ~last~0=v_~last~0_237} OutVars{~SIZE~0=v_~SIZE~0_232, main_~c~0=v_main_~c~0_1039, ~last~0=v_~last~0_237} AuxVars[] AssignedVars[] [2021-05-03 00:18:18,402 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:18,404 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:18,406 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:18,427 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:18,434 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:18,476 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:18,508 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:18,511 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1041 1) v_~SIZE~0_233) (<= v_~last~0_238 v_main_~c~0_1041)) InVars {~SIZE~0=v_~SIZE~0_233, main_~c~0=v_main_~c~0_1041, ~last~0=v_~last~0_238} OutVars{~SIZE~0=v_~SIZE~0_233, main_~c~0=v_main_~c~0_1041, ~last~0=v_~last~0_238} AuxVars[] AssignedVars[] [2021-05-03 00:18:18,514 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:18,542 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:18,544 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:18,560 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:18,565 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:18,591 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:18,626 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1043 v_~last~0_239) (< (+ v_main_~c~0_1043 1) v_~SIZE~0_234)) InVars {~SIZE~0=v_~SIZE~0_234, main_~c~0=v_main_~c~0_1043, ~last~0=v_~last~0_239} OutVars{~SIZE~0=v_~SIZE~0_234, main_~c~0=v_main_~c~0_1043, ~last~0=v_~last~0_239} AuxVars[] AssignedVars[] [2021-05-03 00:18:18,628 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:18,630 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:18,633 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:18,656 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:18,665 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:18,710 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:18,740 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:18,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:18,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:18,954 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:19,885 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:19,885 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [860562807] [2021-05-03 00:18:19,885 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [860562807] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:19,885 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:19,885 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:18:19,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748091787] [2021-05-03 00:18:19,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:18:19,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:19,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:18:19,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:18:19,886 INFO L87 Difference]: Start difference. First operand 197 states and 228 transitions. Second operand has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 24 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:20,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:20,916 INFO L93 Difference]: Finished difference Result 418 states and 475 transitions. [2021-05-03 00:18:20,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:18:20,917 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 24 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:18:20,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:20,918 INFO L225 Difference]: With dead ends: 418 [2021-05-03 00:18:20,919 INFO L226 Difference]: Without dead ends: 265 [2021-05-03 00:18:20,919 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 19 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1065.8ms TimeCoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:18:20,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-05-03 00:18:21,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 197. [2021-05-03 00:18:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 187 states have (on average 1.160427807486631) internal successors, (217), 187 states have internal predecessors, (217), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 228 transitions. [2021-05-03 00:18:21,045 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 228 transitions. Word has length 55 [2021-05-03 00:18:21,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:21,045 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 228 transitions. [2021-05-03 00:18:21,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 24 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 228 transitions. [2021-05-03 00:18:21,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:18:21,049 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:21,049 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:21,049 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable296 [2021-05-03 00:18:21,049 INFO L428 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:21,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:21,049 INFO L82 PathProgramCache]: Analyzing trace with hash 408226239, now seen corresponding path program 48 times [2021-05-03 00:18:21,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:21,050 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1812647857] [2021-05-03 00:18:21,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:21,061 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1058 v_~SIZE~0_235) (<= v_~last~0_240 v_main_~c~0_1058)) InVars {~SIZE~0=v_~SIZE~0_235, main_~c~0=v_main_~c~0_1058, ~last~0=v_~last~0_240} OutVars{~SIZE~0=v_~SIZE~0_235, main_~c~0=v_main_~c~0_1058, ~last~0=v_~last~0_240} AuxVars[] AssignedVars[] [2021-05-03 00:18:21,064 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:21,066 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:21,069 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:21,086 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:21,090 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:21,137 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:21,166 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1060 v_~SIZE~0_236) (< v_main_~c~0_1060 v_~last~0_241)) InVars {~SIZE~0=v_~SIZE~0_236, main_~c~0=v_main_~c~0_1060, ~last~0=v_~last~0_241} OutVars{~SIZE~0=v_~SIZE~0_236, main_~c~0=v_main_~c~0_1060, ~last~0=v_~last~0_241} AuxVars[] AssignedVars[] [2021-05-03 00:18:21,168 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:21,170 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:21,172 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:21,195 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:21,203 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:21,246 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:21,273 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:21,276 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1062 1) v_~SIZE~0_237) (<= v_~last~0_242 v_main_~c~0_1062)) InVars {~SIZE~0=v_~SIZE~0_237, main_~c~0=v_main_~c~0_1062, ~last~0=v_~last~0_242} OutVars{~SIZE~0=v_~SIZE~0_237, main_~c~0=v_main_~c~0_1062, ~last~0=v_~last~0_242} AuxVars[] AssignedVars[] [2021-05-03 00:18:21,279 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:21,281 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:21,284 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:21,301 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:21,305 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:21,340 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:21,362 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1064 v_~last~0_243) (< (+ v_main_~c~0_1064 1) v_~SIZE~0_238)) InVars {~SIZE~0=v_~SIZE~0_238, main_~c~0=v_main_~c~0_1064, ~last~0=v_~last~0_243} OutVars{~SIZE~0=v_~SIZE~0_238, main_~c~0=v_main_~c~0_1064, ~last~0=v_~last~0_243} AuxVars[] AssignedVars[] [2021-05-03 00:18:21,365 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:21,366 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:21,368 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:21,384 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:21,390 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:21,420 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:21,443 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:21,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:21,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:21,656 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:22,686 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:22,686 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1812647857] [2021-05-03 00:18:22,686 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1812647857] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:22,686 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:22,686 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:18:22,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69478414] [2021-05-03 00:18:22,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:18:22,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:22,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:18:22,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:18:22,688 INFO L87 Difference]: Start difference. First operand 197 states and 228 transitions. Second operand has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 25 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:23,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:23,656 INFO L93 Difference]: Finished difference Result 415 states and 472 transitions. [2021-05-03 00:18:23,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:18:23,657 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 25 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:18:23,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:23,658 INFO L225 Difference]: With dead ends: 415 [2021-05-03 00:18:23,658 INFO L226 Difference]: Without dead ends: 262 [2021-05-03 00:18:23,659 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 18 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1146.2ms TimeCoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:18:23,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-05-03 00:18:23,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 197. [2021-05-03 00:18:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 187 states have (on average 1.160427807486631) internal successors, (217), 187 states have internal predecessors, (217), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 228 transitions. [2021-05-03 00:18:23,800 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 228 transitions. Word has length 55 [2021-05-03 00:18:23,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:23,801 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 228 transitions. [2021-05-03 00:18:23,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 25 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 228 transitions. [2021-05-03 00:18:23,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:18:23,801 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:23,801 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:23,802 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable301 [2021-05-03 00:18:23,802 INFO L428 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:23,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:23,802 INFO L82 PathProgramCache]: Analyzing trace with hash 682985853, now seen corresponding path program 49 times [2021-05-03 00:18:23,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:23,803 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2073753657] [2021-05-03 00:18:23,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:23,814 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_244 v_main_~c~0_1079) (< v_main_~c~0_1079 v_~SIZE~0_239)) InVars {~SIZE~0=v_~SIZE~0_239, main_~c~0=v_main_~c~0_1079, ~last~0=v_~last~0_244} OutVars{~SIZE~0=v_~SIZE~0_239, main_~c~0=v_main_~c~0_1079, ~last~0=v_~last~0_244} AuxVars[] AssignedVars[] [2021-05-03 00:18:23,817 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:23,841 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:23,844 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:23,860 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:23,864 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:23,886 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:23,912 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1081 v_~SIZE~0_240) (< v_main_~c~0_1081 v_~last~0_245)) InVars {~SIZE~0=v_~SIZE~0_240, main_~c~0=v_main_~c~0_1081, ~last~0=v_~last~0_245} OutVars{~SIZE~0=v_~SIZE~0_240, main_~c~0=v_main_~c~0_1081, ~last~0=v_~last~0_245} AuxVars[] AssignedVars[] [2021-05-03 00:18:23,919 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:23,921 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:23,924 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:23,945 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:23,953 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:23,990 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:24,012 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:24,016 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_246 v_main_~c~0_1083) (< (+ v_main_~c~0_1083 1) v_~SIZE~0_241)) InVars {~SIZE~0=v_~SIZE~0_241, main_~c~0=v_main_~c~0_1083, ~last~0=v_~last~0_246} OutVars{~SIZE~0=v_~SIZE~0_241, main_~c~0=v_main_~c~0_1083, ~last~0=v_~last~0_246} AuxVars[] AssignedVars[] [2021-05-03 00:18:24,019 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:24,041 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:24,043 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:24,059 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:24,062 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:24,083 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:24,106 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1085 v_~last~0_247) (< (+ v_main_~c~0_1085 1) v_~SIZE~0_242)) InVars {~SIZE~0=v_~SIZE~0_242, main_~c~0=v_main_~c~0_1085, ~last~0=v_~last~0_247} OutVars{~SIZE~0=v_~SIZE~0_242, main_~c~0=v_main_~c~0_1085, ~last~0=v_~last~0_247} AuxVars[] AssignedVars[] [2021-05-03 00:18:24,108 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:24,109 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:24,115 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:24,132 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:24,138 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:24,168 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:24,191 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:24,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:24,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:24,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:24,373 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:25,302 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:25,303 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2073753657] [2021-05-03 00:18:25,303 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2073753657] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:25,303 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:25,303 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:18:25,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124129383] [2021-05-03 00:18:25,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:18:25,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:25,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:18:25,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:18:25,304 INFO L87 Difference]: Start difference. First operand 197 states and 228 transitions. Second operand has 28 states, 28 states have (on average 1.75) internal successors, (49), 26 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:26,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:26,218 INFO L93 Difference]: Finished difference Result 412 states and 469 transitions. [2021-05-03 00:18:26,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:18:26,219 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.75) internal successors, (49), 26 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:18:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:26,220 INFO L225 Difference]: With dead ends: 412 [2021-05-03 00:18:26,220 INFO L226 Difference]: Without dead ends: 259 [2021-05-03 00:18:26,221 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 16 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1015.8ms TimeCoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:18:26,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-05-03 00:18:26,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 197. [2021-05-03 00:18:26,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 187 states have (on average 1.160427807486631) internal successors, (217), 187 states have internal predecessors, (217), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:26,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 228 transitions. [2021-05-03 00:18:26,343 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 228 transitions. Word has length 55 [2021-05-03 00:18:26,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:26,343 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 228 transitions. [2021-05-03 00:18:26,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 1.75) internal successors, (49), 26 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 228 transitions. [2021-05-03 00:18:26,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:18:26,344 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:26,344 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:26,344 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable306 [2021-05-03 00:18:26,344 INFO L428 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:26,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:26,345 INFO L82 PathProgramCache]: Analyzing trace with hash 2069189247, now seen corresponding path program 50 times [2021-05-03 00:18:26,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:26,345 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [669580168] [2021-05-03 00:18:26,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:26,354 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_248 v_main_~c~0_1100) (< v_main_~c~0_1100 v_~SIZE~0_243)) InVars {~SIZE~0=v_~SIZE~0_243, main_~c~0=v_main_~c~0_1100, ~last~0=v_~last~0_248} OutVars{~SIZE~0=v_~SIZE~0_243, main_~c~0=v_main_~c~0_1100, ~last~0=v_~last~0_248} AuxVars[] AssignedVars[] [2021-05-03 00:18:26,356 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:26,357 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:26,359 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:26,372 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:26,376 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:26,415 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:26,445 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1102 v_~SIZE~0_244) (< v_main_~c~0_1102 v_~last~0_249)) InVars {~SIZE~0=v_~SIZE~0_244, main_~c~0=v_main_~c~0_1102, ~last~0=v_~last~0_249} OutVars{~SIZE~0=v_~SIZE~0_244, main_~c~0=v_main_~c~0_1102, ~last~0=v_~last~0_249} AuxVars[] AssignedVars[] [2021-05-03 00:18:26,448 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:26,449 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:26,451 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:26,474 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:26,480 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:26,520 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:26,545 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:26,547 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1104 1) v_~SIZE~0_245) (<= v_~last~0_250 v_main_~c~0_1104)) InVars {~SIZE~0=v_~SIZE~0_245, main_~c~0=v_main_~c~0_1104, ~last~0=v_~last~0_250} OutVars{~SIZE~0=v_~SIZE~0_245, main_~c~0=v_main_~c~0_1104, ~last~0=v_~last~0_250} AuxVars[] AssignedVars[] [2021-05-03 00:18:26,557 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:26,559 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:26,561 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:26,574 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:26,577 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:26,613 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:26,636 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1106 1) v_~SIZE~0_246) (< v_main_~c~0_1106 v_~last~0_251)) InVars {~SIZE~0=v_~SIZE~0_246, main_~c~0=v_main_~c~0_1106, ~last~0=v_~last~0_251} OutVars{~SIZE~0=v_~SIZE~0_246, main_~c~0=v_main_~c~0_1106, ~last~0=v_~last~0_251} AuxVars[] AssignedVars[] [2021-05-03 00:18:26,638 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:26,654 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:26,656 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:26,672 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:26,677 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:26,701 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:26,721 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:26,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:26,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:26,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:26,892 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:27,871 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:27,871 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [669580168] [2021-05-03 00:18:27,871 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [669580168] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:27,871 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:27,871 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:18:27,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044770091] [2021-05-03 00:18:27,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:18:27,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:27,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:18:27,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:18:27,872 INFO L87 Difference]: Start difference. First operand 197 states and 228 transitions. Second operand has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 27 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:29,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:29,011 INFO L93 Difference]: Finished difference Result 409 states and 466 transitions. [2021-05-03 00:18:29,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:18:29,012 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 27 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:18:29,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:29,013 INFO L225 Difference]: With dead ends: 409 [2021-05-03 00:18:29,013 INFO L226 Difference]: Without dead ends: 256 [2021-05-03 00:18:29,014 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 16 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1093.1ms TimeCoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:18:29,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-05-03 00:18:29,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 197. [2021-05-03 00:18:29,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 187 states have (on average 1.160427807486631) internal successors, (217), 187 states have internal predecessors, (217), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:29,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 228 transitions. [2021-05-03 00:18:29,127 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 228 transitions. Word has length 55 [2021-05-03 00:18:29,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:29,128 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 228 transitions. [2021-05-03 00:18:29,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 27 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:29,128 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 228 transitions. [2021-05-03 00:18:29,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:18:29,128 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:29,128 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:29,128 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable311 [2021-05-03 00:18:29,129 INFO L428 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:29,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:29,129 INFO L82 PathProgramCache]: Analyzing trace with hash 2131228861, now seen corresponding path program 51 times [2021-05-03 00:18:29,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:29,129 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1263459897] [2021-05-03 00:18:29,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:29,136 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_252 v_main_~c~0_1121) (< v_main_~c~0_1121 v_~SIZE~0_247)) InVars {~SIZE~0=v_~SIZE~0_247, main_~c~0=v_main_~c~0_1121, ~last~0=v_~last~0_252} OutVars{~SIZE~0=v_~SIZE~0_247, main_~c~0=v_main_~c~0_1121, ~last~0=v_~last~0_252} AuxVars[] AssignedVars[] [2021-05-03 00:18:29,138 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:29,150 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:29,153 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:29,167 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:29,171 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:29,205 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:29,226 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1123 v_~last~0_253) (< v_main_~c~0_1123 v_~SIZE~0_248)) InVars {~SIZE~0=v_~SIZE~0_248, main_~c~0=v_main_~c~0_1123, ~last~0=v_~last~0_253} OutVars{~SIZE~0=v_~SIZE~0_248, main_~c~0=v_main_~c~0_1123, ~last~0=v_~last~0_253} AuxVars[] AssignedVars[] [2021-05-03 00:18:29,227 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:29,242 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:29,243 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:29,257 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:29,262 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:29,279 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:29,299 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:29,302 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1125 1) v_~SIZE~0_249) (<= v_~last~0_254 v_main_~c~0_1125)) InVars {~SIZE~0=v_~SIZE~0_249, main_~c~0=v_main_~c~0_1125, ~last~0=v_~last~0_254} OutVars{~SIZE~0=v_~SIZE~0_249, main_~c~0=v_main_~c~0_1125, ~last~0=v_~last~0_254} AuxVars[] AssignedVars[] [2021-05-03 00:18:29,304 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:29,325 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:29,327 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:29,341 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:29,344 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:29,364 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:29,387 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1127 v_~last~0_255) (< (+ v_main_~c~0_1127 1) v_~SIZE~0_250)) InVars {~SIZE~0=v_~SIZE~0_250, main_~c~0=v_main_~c~0_1127, ~last~0=v_~last~0_255} OutVars{~SIZE~0=v_~SIZE~0_250, main_~c~0=v_main_~c~0_1127, ~last~0=v_~last~0_255} AuxVars[] AssignedVars[] [2021-05-03 00:18:29,389 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:29,404 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:29,407 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:29,425 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:29,431 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:29,449 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:29,470 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:29,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:29,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:29,667 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:30,883 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:30,884 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1263459897] [2021-05-03 00:18:30,884 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1263459897] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:30,884 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:30,884 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:18:30,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198757761] [2021-05-03 00:18:30,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:18:30,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:30,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:18:30,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:18:30,885 INFO L87 Difference]: Start difference. First operand 197 states and 228 transitions. Second operand has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 28 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:31,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:31,875 INFO L93 Difference]: Finished difference Result 406 states and 463 transitions. [2021-05-03 00:18:31,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:18:31,875 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 28 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:18:31,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:31,876 INFO L225 Difference]: With dead ends: 406 [2021-05-03 00:18:31,876 INFO L226 Difference]: Without dead ends: 253 [2021-05-03 00:18:31,877 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 15 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1344.8ms TimeCoverageRelationStatistics Valid=132, Invalid=924, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:18:31,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-05-03 00:18:32,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 197. [2021-05-03 00:18:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 187 states have (on average 1.160427807486631) internal successors, (217), 187 states have internal predecessors, (217), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:32,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 228 transitions. [2021-05-03 00:18:32,006 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 228 transitions. Word has length 55 [2021-05-03 00:18:32,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:32,007 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 228 transitions. [2021-05-03 00:18:32,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 28 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:32,007 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 228 transitions. [2021-05-03 00:18:32,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:18:32,007 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:32,007 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:32,007 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable316 [2021-05-03 00:18:32,007 INFO L428 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:32,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:32,007 INFO L82 PathProgramCache]: Analyzing trace with hash 325790527, now seen corresponding path program 52 times [2021-05-03 00:18:32,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:32,008 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2016490240] [2021-05-03 00:18:32,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:32,015 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1142 v_~SIZE~0_251) (<= v_~last~0_256 v_main_~c~0_1142)) InVars {~SIZE~0=v_~SIZE~0_251, main_~c~0=v_main_~c~0_1142, ~last~0=v_~last~0_256} OutVars{~SIZE~0=v_~SIZE~0_251, main_~c~0=v_main_~c~0_1142, ~last~0=v_~last~0_256} AuxVars[] AssignedVars[] [2021-05-03 00:18:32,018 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:32,044 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:32,046 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:32,058 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:32,061 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:32,082 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:32,107 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1144 v_~last~0_257) (< v_main_~c~0_1144 v_~SIZE~0_252)) InVars {~SIZE~0=v_~SIZE~0_252, main_~c~0=v_main_~c~0_1144, ~last~0=v_~last~0_257} OutVars{~SIZE~0=v_~SIZE~0_252, main_~c~0=v_main_~c~0_1144, ~last~0=v_~last~0_257} AuxVars[] AssignedVars[] [2021-05-03 00:18:32,109 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:32,126 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:32,129 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:32,148 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:32,154 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:32,174 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:32,202 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:32,205 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_258 v_main_~c~0_1146) (< (+ v_main_~c~0_1146 1) v_~SIZE~0_253)) InVars {~SIZE~0=v_~SIZE~0_253, main_~c~0=v_main_~c~0_1146, ~last~0=v_~last~0_258} OutVars{~SIZE~0=v_~SIZE~0_253, main_~c~0=v_main_~c~0_1146, ~last~0=v_~last~0_258} AuxVars[] AssignedVars[] [2021-05-03 00:18:32,207 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:32,209 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:32,211 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:32,226 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:32,229 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:32,269 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:32,299 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1148 v_~last~0_259) (< (+ v_main_~c~0_1148 1) v_~SIZE~0_254)) InVars {~SIZE~0=v_~SIZE~0_254, main_~c~0=v_main_~c~0_1148, ~last~0=v_~last~0_259} OutVars{~SIZE~0=v_~SIZE~0_254, main_~c~0=v_main_~c~0_1148, ~last~0=v_~last~0_259} AuxVars[] AssignedVars[] [2021-05-03 00:18:32,301 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:32,303 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:32,306 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:32,325 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:32,332 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:32,368 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:32,393 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:32,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:32,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:32,595 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:33,713 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:33,714 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2016490240] [2021-05-03 00:18:33,714 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2016490240] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:33,714 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:33,714 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:18:33,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888343653] [2021-05-03 00:18:33,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:18:33,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:33,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:18:33,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:18:33,715 INFO L87 Difference]: Start difference. First operand 197 states and 228 transitions. Second operand has 31 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 29 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:34,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:34,877 INFO L93 Difference]: Finished difference Result 403 states and 460 transitions. [2021-05-03 00:18:34,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:18:34,879 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 29 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:18:34,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:34,880 INFO L225 Difference]: With dead ends: 403 [2021-05-03 00:18:34,880 INFO L226 Difference]: Without dead ends: 250 [2021-05-03 00:18:34,880 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 14 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1268.0ms TimeCoverageRelationStatistics Valid=139, Invalid=983, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:18:34,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-05-03 00:18:35,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 197. [2021-05-03 00:18:35,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 187 states have (on average 1.160427807486631) internal successors, (217), 187 states have internal predecessors, (217), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:35,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 228 transitions. [2021-05-03 00:18:35,028 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 228 transitions. Word has length 55 [2021-05-03 00:18:35,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:35,028 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 228 transitions. [2021-05-03 00:18:35,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 29 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:35,028 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 228 transitions. [2021-05-03 00:18:35,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:18:35,029 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:35,029 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:35,029 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable321 [2021-05-03 00:18:35,029 INFO L428 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:35,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:35,029 INFO L82 PathProgramCache]: Analyzing trace with hash -491857923, now seen corresponding path program 53 times [2021-05-03 00:18:35,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:35,030 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [270457757] [2021-05-03 00:18:35,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:35,039 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_260 v_main_~c~0_1163) (< v_main_~c~0_1163 v_~SIZE~0_255)) InVars {~SIZE~0=v_~SIZE~0_255, main_~c~0=v_main_~c~0_1163, ~last~0=v_~last~0_260} OutVars{~SIZE~0=v_~SIZE~0_255, main_~c~0=v_main_~c~0_1163, ~last~0=v_~last~0_260} AuxVars[] AssignedVars[] [2021-05-03 00:18:35,041 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:35,063 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:35,066 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:35,079 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:35,083 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:35,105 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:35,130 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1165 v_~last~0_261) (< v_main_~c~0_1165 v_~SIZE~0_256)) InVars {~SIZE~0=v_~SIZE~0_256, main_~c~0=v_main_~c~0_1165, ~last~0=v_~last~0_261} OutVars{~SIZE~0=v_~SIZE~0_256, main_~c~0=v_main_~c~0_1165, ~last~0=v_~last~0_261} AuxVars[] AssignedVars[] [2021-05-03 00:18:35,132 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:35,133 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:35,135 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:35,152 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:35,159 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:35,192 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:35,218 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:35,221 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1167 1) v_~SIZE~0_257) (<= v_~last~0_262 v_main_~c~0_1167)) InVars {~SIZE~0=v_~SIZE~0_257, main_~c~0=v_main_~c~0_1167, ~last~0=v_~last~0_262} OutVars{~SIZE~0=v_~SIZE~0_257, main_~c~0=v_main_~c~0_1167, ~last~0=v_~last~0_262} AuxVars[] AssignedVars[] [2021-05-03 00:18:35,223 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:35,245 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:35,247 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:35,261 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:35,264 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:35,285 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:35,312 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1169 1) v_~SIZE~0_258) (< v_main_~c~0_1169 v_~last~0_263)) InVars {~SIZE~0=v_~SIZE~0_258, main_~c~0=v_main_~c~0_1169, ~last~0=v_~last~0_263} OutVars{~SIZE~0=v_~SIZE~0_258, main_~c~0=v_main_~c~0_1169, ~last~0=v_~last~0_263} AuxVars[] AssignedVars[] [2021-05-03 00:18:35,313 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:35,332 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:35,335 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:35,354 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:35,361 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:35,381 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:35,407 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:35,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:35,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:35,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:35,624 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:36,765 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:36,765 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [270457757] [2021-05-03 00:18:36,765 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [270457757] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:36,765 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:36,765 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:18:36,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859774668] [2021-05-03 00:18:36,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:18:36,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:36,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:18:36,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=920, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:18:36,767 INFO L87 Difference]: Start difference. First operand 197 states and 228 transitions. Second operand has 32 states, 32 states have (on average 1.53125) internal successors, (49), 30 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:37,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:37,959 INFO L93 Difference]: Finished difference Result 400 states and 457 transitions. [2021-05-03 00:18:37,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:18:37,960 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.53125) internal successors, (49), 30 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:18:37,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:37,961 INFO L225 Difference]: With dead ends: 400 [2021-05-03 00:18:37,961 INFO L226 Difference]: Without dead ends: 247 [2021-05-03 00:18:37,962 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 13 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1247.1ms TimeCoverageRelationStatistics Valid=146, Invalid=1044, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:18:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-05-03 00:18:38,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 197. [2021-05-03 00:18:38,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 187 states have (on average 1.160427807486631) internal successors, (217), 187 states have internal predecessors, (217), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:38,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 228 transitions. [2021-05-03 00:18:38,084 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 228 transitions. Word has length 55 [2021-05-03 00:18:38,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:38,084 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 228 transitions. [2021-05-03 00:18:38,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 1.53125) internal successors, (49), 30 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:38,084 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 228 transitions. [2021-05-03 00:18:38,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:18:38,085 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:38,085 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:38,085 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable326 [2021-05-03 00:18:38,085 INFO L428 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:38,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:38,085 INFO L82 PathProgramCache]: Analyzing trace with hash -2080205825, now seen corresponding path program 54 times [2021-05-03 00:18:38,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:38,086 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [743238101] [2021-05-03 00:18:38,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:38,099 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1184 v_~SIZE~0_259) (<= v_~last~0_264 v_main_~c~0_1184)) InVars {~SIZE~0=v_~SIZE~0_259, main_~c~0=v_main_~c~0_1184, ~last~0=v_~last~0_264} OutVars{~SIZE~0=v_~SIZE~0_259, main_~c~0=v_main_~c~0_1184, ~last~0=v_~last~0_264} AuxVars[] AssignedVars[] [2021-05-03 00:18:38,101 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:38,120 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:38,122 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:38,134 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:38,137 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:38,157 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:38,180 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1186 v_~SIZE~0_260) (< v_main_~c~0_1186 v_~last~0_265)) InVars {~SIZE~0=v_~SIZE~0_260, main_~c~0=v_main_~c~0_1186, ~last~0=v_~last~0_265} OutVars{~SIZE~0=v_~SIZE~0_260, main_~c~0=v_main_~c~0_1186, ~last~0=v_~last~0_265} AuxVars[] AssignedVars[] [2021-05-03 00:18:38,182 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:38,199 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:38,201 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:38,224 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:38,231 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:38,250 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:38,270 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:38,273 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1188 1) v_~SIZE~0_261) (<= v_~last~0_266 v_main_~c~0_1188)) InVars {~SIZE~0=v_~SIZE~0_261, main_~c~0=v_main_~c~0_1188, ~last~0=v_~last~0_266} OutVars{~SIZE~0=v_~SIZE~0_261, main_~c~0=v_main_~c~0_1188, ~last~0=v_~last~0_266} AuxVars[] AssignedVars[] [2021-05-03 00:18:38,275 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:38,276 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:38,278 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:38,291 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:38,294 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:38,334 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:38,358 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1190 v_~last~0_267) (< (+ v_main_~c~0_1190 1) v_~SIZE~0_262)) InVars {~SIZE~0=v_~SIZE~0_262, main_~c~0=v_main_~c~0_1190, ~last~0=v_~last~0_267} OutVars{~SIZE~0=v_~SIZE~0_262, main_~c~0=v_main_~c~0_1190, ~last~0=v_~last~0_267} AuxVars[] AssignedVars[] [2021-05-03 00:18:38,360 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:38,361 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:38,363 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:38,381 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:38,387 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:38,419 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:38,441 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:38,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:38,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:38,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:38,617 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:39,788 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:39,789 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [743238101] [2021-05-03 00:18:39,789 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [743238101] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:39,789 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:39,789 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:18:39,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182583479] [2021-05-03 00:18:39,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:18:39,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:39,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:18:39,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:18:39,790 INFO L87 Difference]: Start difference. First operand 197 states and 228 transitions. Second operand has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 31 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:41,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:41,042 INFO L93 Difference]: Finished difference Result 397 states and 454 transitions. [2021-05-03 00:18:41,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:18:41,043 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 31 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:18:41,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:41,044 INFO L225 Difference]: With dead ends: 397 [2021-05-03 00:18:41,044 INFO L226 Difference]: Without dead ends: 244 [2021-05-03 00:18:41,045 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 12 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1276.5ms TimeCoverageRelationStatistics Valid=153, Invalid=1107, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:18:41,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-05-03 00:18:41,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 197. [2021-05-03 00:18:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 187 states have (on average 1.160427807486631) internal successors, (217), 187 states have internal predecessors, (217), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:41,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 228 transitions. [2021-05-03 00:18:41,179 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 228 transitions. Word has length 55 [2021-05-03 00:18:41,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:41,179 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 228 transitions. [2021-05-03 00:18:41,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 31 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:41,179 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 228 transitions. [2021-05-03 00:18:41,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:18:41,180 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:41,180 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 10, 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-03 00:18:41,180 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable331 [2021-05-03 00:18:41,180 INFO L428 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:41,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:41,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1203644221, now seen corresponding path program 55 times [2021-05-03 00:18:41,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:41,181 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [468134442] [2021-05-03 00:18:41,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:41,188 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1205 v_~SIZE~0_263) (<= v_~last~0_268 v_main_~c~0_1205)) InVars {~SIZE~0=v_~SIZE~0_263, main_~c~0=v_main_~c~0_1205, ~last~0=v_~last~0_268} OutVars{~SIZE~0=v_~SIZE~0_263, main_~c~0=v_main_~c~0_1205, ~last~0=v_~last~0_268} AuxVars[] AssignedVars[] [2021-05-03 00:18:41,190 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:41,191 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:41,194 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:41,208 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:41,211 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:41,246 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:41,270 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1207 v_~last~0_269) (< v_main_~c~0_1207 v_~SIZE~0_264)) InVars {~SIZE~0=v_~SIZE~0_264, main_~c~0=v_main_~c~0_1207, ~last~0=v_~last~0_269} OutVars{~SIZE~0=v_~SIZE~0_264, main_~c~0=v_main_~c~0_1207, ~last~0=v_~last~0_269} AuxVars[] AssignedVars[] [2021-05-03 00:18:41,271 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:41,273 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:41,275 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:41,291 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:41,297 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:41,331 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:41,354 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:41,355 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1209 1) v_~SIZE~0_265) (< v_main_~c~0_1209 v_~last~0_270)) InVars {~SIZE~0=v_~SIZE~0_265, main_~c~0=v_main_~c~0_1209, ~last~0=v_~last~0_270} OutVars{~SIZE~0=v_~SIZE~0_265, main_~c~0=v_main_~c~0_1209, ~last~0=v_~last~0_270} AuxVars[] AssignedVars[] [2021-05-03 00:18:41,357 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:41,358 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:41,360 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:41,377 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:41,384 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:41,417 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:41,441 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:41,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:41,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:41,642 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:42,995 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:42,996 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [468134442] [2021-05-03 00:18:42,996 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [468134442] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:42,996 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:42,996 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-03 00:18:42,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985442955] [2021-05-03 00:18:42,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-03 00:18:42,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:42,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-03 00:18:42,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:18:42,997 INFO L87 Difference]: Start difference. First operand 197 states and 228 transitions. Second operand has 34 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 32 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:44,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:44,182 INFO L93 Difference]: Finished difference Result 396 states and 454 transitions. [2021-05-03 00:18:44,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:18:44,183 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 32 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:18:44,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:44,185 INFO L225 Difference]: With dead ends: 396 [2021-05-03 00:18:44,185 INFO L226 Difference]: Without dead ends: 243 [2021-05-03 00:18:44,186 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 11 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1478.7ms TimeCoverageRelationStatistics Valid=160, Invalid=1172, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:18:44,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-05-03 00:18:44,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 198. [2021-05-03 00:18:44,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 188 states have (on average 1.1648936170212767) internal successors, (219), 188 states have internal predecessors, (219), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 230 transitions. [2021-05-03 00:18:44,323 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 230 transitions. Word has length 55 [2021-05-03 00:18:44,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:44,323 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 230 transitions. [2021-05-03 00:18:44,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 32 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:44,323 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 230 transitions. [2021-05-03 00:18:44,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:18:44,324 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:44,324 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:44,324 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable335 [2021-05-03 00:18:44,324 INFO L428 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:44,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:44,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1038103871, now seen corresponding path program 11 times [2021-05-03 00:18:44,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:44,325 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [983556987] [2021-05-03 00:18:44,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:44,337 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1224 v_~SIZE~0_266) (< v_main_~c~0_1224 v_~last~0_271)) InVars {~SIZE~0=v_~SIZE~0_266, main_~c~0=v_main_~c~0_1224, ~last~0=v_~last~0_271} OutVars{~SIZE~0=v_~SIZE~0_266, main_~c~0=v_main_~c~0_1224, ~last~0=v_~last~0_271} AuxVars[] AssignedVars[] [2021-05-03 00:18:44,340 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:44,341 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:44,344 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:44,362 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:44,369 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:44,405 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:44,429 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:44,440 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1226 1) v_~SIZE~0_267) (< v_main_~c~0_1226 v_~last~0_272)) InVars {~SIZE~0=v_~SIZE~0_267, main_~c~0=v_main_~c~0_1226, ~last~0=v_~last~0_272} OutVars{~SIZE~0=v_~SIZE~0_267, main_~c~0=v_main_~c~0_1226, ~last~0=v_~last~0_272} AuxVars[] AssignedVars[] [2021-05-03 00:18:44,448 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:44,449 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:44,454 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:44,474 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:44,480 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:44,519 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:44,545 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:44,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:44,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:44,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:45,898 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:45,898 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [983556987] [2021-05-03 00:18:45,898 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [983556987] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:45,898 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:45,898 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-03 00:18:45,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625274096] [2021-05-03 00:18:45,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-03 00:18:45,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:45,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-03 00:18:45,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1096, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:18:45,899 INFO L87 Difference]: Start difference. First operand 198 states and 230 transitions. Second operand has 34 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 32 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:47,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:47,478 INFO L93 Difference]: Finished difference Result 406 states and 465 transitions. [2021-05-03 00:18:47,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-03 00:18:47,479 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 32 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2021-05-03 00:18:47,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:47,480 INFO L225 Difference]: With dead ends: 406 [2021-05-03 00:18:47,480 INFO L226 Difference]: Without dead ends: 253 [2021-05-03 00:18:47,481 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 6 SyntacticMatches, 10 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1727.8ms TimeCoverageRelationStatistics Valid=262, Invalid=2090, Unknown=0, NotChecked=0, Total=2352 [2021-05-03 00:18:47,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-05-03 00:18:47,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 200. [2021-05-03 00:18:47,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 190 states have (on average 1.1631578947368422) internal successors, (221), 190 states have internal predecessors, (221), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:47,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 232 transitions. [2021-05-03 00:18:47,605 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 232 transitions. Word has length 55 [2021-05-03 00:18:47,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:47,605 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 232 transitions. [2021-05-03 00:18:47,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 32 states have internal predecessors, (49), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:47,605 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 232 transitions. [2021-05-03 00:18:47,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:18:47,606 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:47,606 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:47,606 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable338 [2021-05-03 00:18:47,606 INFO L428 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:47,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:47,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1558779102, now seen corresponding path program 12 times [2021-05-03 00:18:47,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:47,607 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [137972251] [2021-05-03 00:18:47,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:47,618 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1240 v_~SIZE~0_268) (<= v_~last~0_273 v_main_~c~0_1240)) InVars {~SIZE~0=v_~SIZE~0_268, main_~c~0=v_main_~c~0_1240, ~last~0=v_~last~0_273} OutVars{~SIZE~0=v_~SIZE~0_268, main_~c~0=v_main_~c~0_1240, ~last~0=v_~last~0_273} AuxVars[] AssignedVars[] [2021-05-03 00:18:47,620 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:47,621 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:47,624 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:47,636 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:47,640 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:47,674 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:47,696 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:47,699 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1242 1) v_~SIZE~0_269) (<= v_~last~0_274 v_main_~c~0_1242)) InVars {~SIZE~0=v_~SIZE~0_269, main_~c~0=v_main_~c~0_1242, ~last~0=v_~last~0_274} OutVars{~SIZE~0=v_~SIZE~0_269, main_~c~0=v_main_~c~0_1242, ~last~0=v_~last~0_274} AuxVars[] AssignedVars[] [2021-05-03 00:18:47,701 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:47,724 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:47,729 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:47,745 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:47,749 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:47,767 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:47,787 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:47,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:47,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:47,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:48,477 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:48,477 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [137972251] [2021-05-03 00:18:48,477 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [137972251] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:48,477 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:48,477 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-03 00:18:48,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256299972] [2021-05-03 00:18:48,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-03 00:18:48,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:48,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-03 00:18:48,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:18:48,478 INFO L87 Difference]: Start difference. First operand 200 states and 232 transitions. Second operand has 20 states, 20 states have (on average 2.6) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:49,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:49,252 INFO L93 Difference]: Finished difference Result 400 states and 456 transitions. [2021-05-03 00:18:49,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-03 00:18:49,253 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.6) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:18:49,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:49,254 INFO L225 Difference]: With dead ends: 400 [2021-05-03 00:18:49,254 INFO L226 Difference]: Without dead ends: 247 [2021-05-03 00:18:49,254 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 12 SyntacticMatches, 23 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 622.7ms TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:18:49,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-05-03 00:18:49,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 209. [2021-05-03 00:18:49,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 199 states have (on average 1.1557788944723617) internal successors, (230), 199 states have internal predecessors, (230), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 241 transitions. [2021-05-03 00:18:49,374 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 241 transitions. Word has length 58 [2021-05-03 00:18:49,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:49,374 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 241 transitions. [2021-05-03 00:18:49,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 2.6) internal successors, (52), 19 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:49,374 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 241 transitions. [2021-05-03 00:18:49,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:18:49,375 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:49,375 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 11, 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-03 00:18:49,375 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable341 [2021-05-03 00:18:49,375 INFO L428 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:49,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:49,375 INFO L82 PathProgramCache]: Analyzing trace with hash -490608740, now seen corresponding path program 56 times [2021-05-03 00:18:49,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:49,376 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [851106876] [2021-05-03 00:18:49,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:49,396 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_275 v_main_~c~0_1257) (< v_main_~c~0_1257 v_~SIZE~0_270)) InVars {~SIZE~0=v_~SIZE~0_270, main_~c~0=v_main_~c~0_1257, ~last~0=v_~last~0_275} OutVars{~SIZE~0=v_~SIZE~0_270, main_~c~0=v_main_~c~0_1257, ~last~0=v_~last~0_275} AuxVars[] AssignedVars[] [2021-05-03 00:18:49,399 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:49,418 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:49,420 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:49,432 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:49,435 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:49,453 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:49,475 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1259 v_~last~0_276) (< v_main_~c~0_1259 v_~SIZE~0_271)) InVars {~SIZE~0=v_~SIZE~0_271, main_~c~0=v_main_~c~0_1259, ~last~0=v_~last~0_276} OutVars{~SIZE~0=v_~SIZE~0_271, main_~c~0=v_main_~c~0_1259, ~last~0=v_~last~0_276} AuxVars[] AssignedVars[] [2021-05-03 00:18:49,477 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:49,478 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:49,480 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:49,496 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:49,501 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:49,534 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:49,555 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:49,557 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_277 v_main_~c~0_1261) (< (+ v_main_~c~0_1261 1) v_~SIZE~0_272)) InVars {~SIZE~0=v_~SIZE~0_272, main_~c~0=v_main_~c~0_1261, ~last~0=v_~last~0_277} OutVars{~SIZE~0=v_~SIZE~0_272, main_~c~0=v_main_~c~0_1261, ~last~0=v_~last~0_277} AuxVars[] AssignedVars[] [2021-05-03 00:18:49,558 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:49,559 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:49,562 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:49,573 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:49,576 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:49,603 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:49,623 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1263 v_~last~0_278) (< (+ v_main_~c~0_1263 1) v_~SIZE~0_273)) InVars {~SIZE~0=v_~SIZE~0_273, main_~c~0=v_main_~c~0_1263, ~last~0=v_~last~0_278} OutVars{~SIZE~0=v_~SIZE~0_273, main_~c~0=v_main_~c~0_1263, ~last~0=v_~last~0_278} AuxVars[] AssignedVars[] [2021-05-03 00:18:49,624 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:49,625 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:49,626 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:49,649 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:49,654 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:49,678 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:49,699 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:49,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:49,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:49,840 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:50,735 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:50,735 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [851106876] [2021-05-03 00:18:50,735 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [851106876] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:50,735 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:50,735 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:18:50,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500376208] [2021-05-03 00:18:50,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:18:50,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:50,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:18:50,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:18:50,736 INFO L87 Difference]: Start difference. First operand 209 states and 241 transitions. Second operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 24 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:51,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:51,845 INFO L93 Difference]: Finished difference Result 448 states and 506 transitions. [2021-05-03 00:18:51,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:18:51,846 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 24 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:18:51,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:51,847 INFO L225 Difference]: With dead ends: 448 [2021-05-03 00:18:51,847 INFO L226 Difference]: Without dead ends: 286 [2021-05-03 00:18:51,847 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 6 SyntacticMatches, 22 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 985.4ms TimeCoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:18:51,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-05-03 00:18:51,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 209. [2021-05-03 00:18:51,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 199 states have (on average 1.1557788944723617) internal successors, (230), 199 states have internal predecessors, (230), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:51,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 241 transitions. [2021-05-03 00:18:51,969 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 241 transitions. Word has length 58 [2021-05-03 00:18:51,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:51,969 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 241 transitions. [2021-05-03 00:18:51,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 24 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:51,969 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 241 transitions. [2021-05-03 00:18:51,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:18:51,970 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:51,970 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:51,970 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable346 [2021-05-03 00:18:51,970 INFO L428 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:51,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:51,970 INFO L82 PathProgramCache]: Analyzing trace with hash -66962018, now seen corresponding path program 57 times [2021-05-03 00:18:51,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:51,970 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [127339354] [2021-05-03 00:18:51,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:51,978 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_279 v_main_~c~0_1279) (< v_main_~c~0_1279 v_~SIZE~0_274)) InVars {~SIZE~0=v_~SIZE~0_274, main_~c~0=v_main_~c~0_1279, ~last~0=v_~last~0_279} OutVars{~SIZE~0=v_~SIZE~0_274, main_~c~0=v_main_~c~0_1279, ~last~0=v_~last~0_279} AuxVars[] AssignedVars[] [2021-05-03 00:18:51,979 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:51,995 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:51,998 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:52,009 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:52,012 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:52,029 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:52,048 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1281 v_~last~0_280) (< v_main_~c~0_1281 v_~SIZE~0_275)) InVars {~SIZE~0=v_~SIZE~0_275, main_~c~0=v_main_~c~0_1281, ~last~0=v_~last~0_280} OutVars{~SIZE~0=v_~SIZE~0_275, main_~c~0=v_main_~c~0_1281, ~last~0=v_~last~0_280} AuxVars[] AssignedVars[] [2021-05-03 00:18:52,050 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:52,051 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:52,052 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:52,065 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:52,070 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:52,093 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:52,113 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:52,115 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_281 v_main_~c~0_1283) (< (+ v_main_~c~0_1283 1) v_~SIZE~0_276)) InVars {~SIZE~0=v_~SIZE~0_276, main_~c~0=v_main_~c~0_1283, ~last~0=v_~last~0_281} OutVars{~SIZE~0=v_~SIZE~0_276, main_~c~0=v_main_~c~0_1283, ~last~0=v_~last~0_281} AuxVars[] AssignedVars[] [2021-05-03 00:18:52,117 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:52,132 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:52,134 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:52,144 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:52,147 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:52,161 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:52,182 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1285 1) v_~SIZE~0_277) (< v_main_~c~0_1285 v_~last~0_282)) InVars {~SIZE~0=v_~SIZE~0_277, main_~c~0=v_main_~c~0_1285, ~last~0=v_~last~0_282} OutVars{~SIZE~0=v_~SIZE~0_277, main_~c~0=v_main_~c~0_1285, ~last~0=v_~last~0_282} AuxVars[] AssignedVars[] [2021-05-03 00:18:52,183 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:52,196 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:52,198 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:52,211 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:52,215 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:52,238 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:52,258 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:52,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:52,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:52,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:52,417 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:53,322 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:53,322 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [127339354] [2021-05-03 00:18:53,322 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [127339354] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:53,322 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:53,322 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:18:53,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822574276] [2021-05-03 00:18:53,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:18:53,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:53,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:18:53,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:18:53,324 INFO L87 Difference]: Start difference. First operand 209 states and 241 transitions. Second operand has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:54,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:54,326 INFO L93 Difference]: Finished difference Result 445 states and 503 transitions. [2021-05-03 00:18:54,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:18:54,328 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:18:54,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:54,329 INFO L225 Difference]: With dead ends: 445 [2021-05-03 00:18:54,329 INFO L226 Difference]: Without dead ends: 283 [2021-05-03 00:18:54,329 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 6 SyntacticMatches, 21 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 993.2ms TimeCoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:18:54,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-05-03 00:18:54,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 209. [2021-05-03 00:18:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 199 states have (on average 1.1557788944723617) internal successors, (230), 199 states have internal predecessors, (230), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:54,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 241 transitions. [2021-05-03 00:18:54,455 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 241 transitions. Word has length 58 [2021-05-03 00:18:54,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:54,455 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 241 transitions. [2021-05-03 00:18:54,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:54,455 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 241 transitions. [2021-05-03 00:18:54,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:18:54,456 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:54,456 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:54,456 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable351 [2021-05-03 00:18:54,456 INFO L428 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:54,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:54,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1096321316, now seen corresponding path program 58 times [2021-05-03 00:18:54,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:54,457 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [59690461] [2021-05-03 00:18:54,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:54,470 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_283 v_main_~c~0_1301) (< v_main_~c~0_1301 v_~SIZE~0_278)) InVars {~SIZE~0=v_~SIZE~0_278, main_~c~0=v_main_~c~0_1301, ~last~0=v_~last~0_283} OutVars{~SIZE~0=v_~SIZE~0_278, main_~c~0=v_main_~c~0_1301, ~last~0=v_~last~0_283} AuxVars[] AssignedVars[] [2021-05-03 00:18:54,472 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:54,473 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:54,474 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:54,487 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:54,490 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:54,520 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:54,543 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1303 v_~last~0_284) (< v_main_~c~0_1303 v_~SIZE~0_279)) InVars {~SIZE~0=v_~SIZE~0_279, main_~c~0=v_main_~c~0_1303, ~last~0=v_~last~0_284} OutVars{~SIZE~0=v_~SIZE~0_279, main_~c~0=v_main_~c~0_1303, ~last~0=v_~last~0_284} AuxVars[] AssignedVars[] [2021-05-03 00:18:54,544 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:54,555 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:54,557 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:54,568 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:54,573 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:54,586 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:54,605 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:54,607 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_285 v_main_~c~0_1305) (< (+ v_main_~c~0_1305 1) v_~SIZE~0_280)) InVars {~SIZE~0=v_~SIZE~0_280, main_~c~0=v_main_~c~0_1305, ~last~0=v_~last~0_285} OutVars{~SIZE~0=v_~SIZE~0_280, main_~c~0=v_main_~c~0_1305, ~last~0=v_~last~0_285} AuxVars[] AssignedVars[] [2021-05-03 00:18:54,608 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:54,624 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:54,626 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:54,636 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:54,640 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:54,655 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:54,674 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1307 1) v_~SIZE~0_281) (< v_main_~c~0_1307 v_~last~0_286)) InVars {~SIZE~0=v_~SIZE~0_281, main_~c~0=v_main_~c~0_1307, ~last~0=v_~last~0_286} OutVars{~SIZE~0=v_~SIZE~0_281, main_~c~0=v_main_~c~0_1307, ~last~0=v_~last~0_286} AuxVars[] AssignedVars[] [2021-05-03 00:18:54,676 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:54,687 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:54,697 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:54,713 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:54,717 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:54,733 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:54,756 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:54,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:54,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:54,927 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:55,965 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:55,965 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [59690461] [2021-05-03 00:18:55,965 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [59690461] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:55,965 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:55,965 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:18:55,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188064949] [2021-05-03 00:18:55,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:18:55,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:55,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:18:55,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:18:55,966 INFO L87 Difference]: Start difference. First operand 209 states and 241 transitions. Second operand has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 26 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:56,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:56,994 INFO L93 Difference]: Finished difference Result 442 states and 500 transitions. [2021-05-03 00:18:56,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:18:56,995 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 26 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:18:56,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:56,996 INFO L225 Difference]: With dead ends: 442 [2021-05-03 00:18:56,996 INFO L226 Difference]: Without dead ends: 280 [2021-05-03 00:18:56,997 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 19 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1145.6ms TimeCoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:18:56,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-05-03 00:18:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 209. [2021-05-03 00:18:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 199 states have (on average 1.1557788944723617) internal successors, (230), 199 states have internal predecessors, (230), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 241 transitions. [2021-05-03 00:18:57,120 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 241 transitions. Word has length 58 [2021-05-03 00:18:57,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:57,120 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 241 transitions. [2021-05-03 00:18:57,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 26 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:57,120 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 241 transitions. [2021-05-03 00:18:57,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:18:57,121 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:57,121 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:57,121 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable356 [2021-05-03 00:18:57,121 INFO L428 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:57,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:57,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1940326818, now seen corresponding path program 59 times [2021-05-03 00:18:57,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:57,121 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [347751991] [2021-05-03 00:18:57,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:57,128 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1323 v_~SIZE~0_282) (<= v_~last~0_287 v_main_~c~0_1323)) InVars {~SIZE~0=v_~SIZE~0_282, main_~c~0=v_main_~c~0_1323, ~last~0=v_~last~0_287} OutVars{~SIZE~0=v_~SIZE~0_282, main_~c~0=v_main_~c~0_1323, ~last~0=v_~last~0_287} AuxVars[] AssignedVars[] [2021-05-03 00:18:57,131 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:57,132 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:57,134 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:57,144 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:57,147 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:57,175 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:57,196 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1325 v_~SIZE~0_283) (< v_main_~c~0_1325 v_~last~0_288)) InVars {~SIZE~0=v_~SIZE~0_283, main_~c~0=v_main_~c~0_1325, ~last~0=v_~last~0_288} OutVars{~SIZE~0=v_~SIZE~0_283, main_~c~0=v_main_~c~0_1325, ~last~0=v_~last~0_288} AuxVars[] AssignedVars[] [2021-05-03 00:18:57,198 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:57,199 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:57,200 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:57,214 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:57,219 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:57,244 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:57,262 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:57,264 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_289 v_main_~c~0_1327) (< (+ v_main_~c~0_1327 1) v_~SIZE~0_284)) InVars {~SIZE~0=v_~SIZE~0_284, main_~c~0=v_main_~c~0_1327, ~last~0=v_~last~0_289} OutVars{~SIZE~0=v_~SIZE~0_284, main_~c~0=v_main_~c~0_1327, ~last~0=v_~last~0_289} AuxVars[] AssignedVars[] [2021-05-03 00:18:57,266 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:57,267 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:57,268 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:57,278 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:57,280 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:57,310 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:18:57,330 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1329 1) v_~SIZE~0_285) (< v_main_~c~0_1329 v_~last~0_290)) InVars {~SIZE~0=v_~SIZE~0_285, main_~c~0=v_main_~c~0_1329, ~last~0=v_~last~0_290} OutVars{~SIZE~0=v_~SIZE~0_285, main_~c~0=v_main_~c~0_1329, ~last~0=v_~last~0_290} AuxVars[] AssignedVars[] [2021-05-03 00:18:57,331 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:57,332 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:57,334 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:57,348 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:57,353 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:57,380 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:57,399 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:57,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:57,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:18:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:57,559 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:58,523 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:58,523 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [347751991] [2021-05-03 00:18:58,524 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [347751991] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:58,524 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:58,524 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:18:58,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067127061] [2021-05-03 00:18:58,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:18:58,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:58,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:18:58,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:18:58,525 INFO L87 Difference]: Start difference. First operand 209 states and 241 transitions. Second operand has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 27 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:59,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:59,632 INFO L93 Difference]: Finished difference Result 439 states and 497 transitions. [2021-05-03 00:18:59,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:18:59,633 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 27 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:18:59,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:59,634 INFO L225 Difference]: With dead ends: 439 [2021-05-03 00:18:59,634 INFO L226 Difference]: Without dead ends: 277 [2021-05-03 00:18:59,635 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 6 SyntacticMatches, 19 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1064.9ms TimeCoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:18:59,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-05-03 00:18:59,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 209. [2021-05-03 00:18:59,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 199 states have (on average 1.1557788944723617) internal successors, (230), 199 states have internal predecessors, (230), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:18:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 241 transitions. [2021-05-03 00:18:59,789 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 241 transitions. Word has length 58 [2021-05-03 00:18:59,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:59,790 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 241 transitions. [2021-05-03 00:18:59,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 27 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:18:59,790 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 241 transitions. [2021-05-03 00:18:59,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:18:59,790 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:59,790 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:59,790 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable361 [2021-05-03 00:18:59,790 INFO L428 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:59,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:59,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1665567204, now seen corresponding path program 60 times [2021-05-03 00:18:59,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:59,791 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1808527789] [2021-05-03 00:18:59,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:59,799 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_291 v_main_~c~0_1345) (< v_main_~c~0_1345 v_~SIZE~0_286)) InVars {~SIZE~0=v_~SIZE~0_286, main_~c~0=v_main_~c~0_1345, ~last~0=v_~last~0_291} OutVars{~SIZE~0=v_~SIZE~0_286, main_~c~0=v_main_~c~0_1345, ~last~0=v_~last~0_291} AuxVars[] AssignedVars[] [2021-05-03 00:18:59,801 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:18:59,802 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:59,803 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:59,814 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:59,816 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:59,850 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:18:59,872 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1347 v_~last~0_292) (< v_main_~c~0_1347 v_~SIZE~0_287)) InVars {~SIZE~0=v_~SIZE~0_287, main_~c~0=v_main_~c~0_1347, ~last~0=v_~last~0_292} OutVars{~SIZE~0=v_~SIZE~0_287, main_~c~0=v_main_~c~0_1347, ~last~0=v_~last~0_292} AuxVars[] AssignedVars[] [2021-05-03 00:18:59,873 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:18:59,874 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:59,876 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:59,890 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:59,895 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:59,924 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:18:59,944 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:59,946 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1349 1) v_~SIZE~0_288) (<= v_~last~0_293 v_main_~c~0_1349)) InVars {~SIZE~0=v_~SIZE~0_288, main_~c~0=v_main_~c~0_1349, ~last~0=v_~last~0_293} OutVars{~SIZE~0=v_~SIZE~0_288, main_~c~0=v_main_~c~0_1349, ~last~0=v_~last~0_293} AuxVars[] AssignedVars[] [2021-05-03 00:18:59,948 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:18:59,949 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:59,951 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:59,962 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:18:59,965 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:18:59,994 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:00,016 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1351 v_~last~0_294) (< (+ v_main_~c~0_1351 1) v_~SIZE~0_289)) InVars {~SIZE~0=v_~SIZE~0_289, main_~c~0=v_main_~c~0_1351, ~last~0=v_~last~0_294} OutVars{~SIZE~0=v_~SIZE~0_289, main_~c~0=v_main_~c~0_1351, ~last~0=v_~last~0_294} AuxVars[] AssignedVars[] [2021-05-03 00:19:00,017 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:00,018 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:00,020 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:00,033 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:00,038 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:00,065 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:00,086 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:00,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:00,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:00,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:00,244 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:01,198 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:01,198 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1808527789] [2021-05-03 00:19:01,198 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1808527789] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:01,198 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:01,198 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:19:01,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058825220] [2021-05-03 00:19:01,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:19:01,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:01,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:19:01,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:19:01,199 INFO L87 Difference]: Start difference. First operand 209 states and 241 transitions. Second operand has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 28 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:02,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:02,257 INFO L93 Difference]: Finished difference Result 436 states and 494 transitions. [2021-05-03 00:19:02,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:19:02,258 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 28 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:19:02,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:02,259 INFO L225 Difference]: With dead ends: 436 [2021-05-03 00:19:02,260 INFO L226 Difference]: Without dead ends: 274 [2021-05-03 00:19:02,260 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 6 SyntacticMatches, 18 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 1057.3ms TimeCoverageRelationStatistics Valid=129, Invalid=927, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:19:02,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-05-03 00:19:02,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 209. [2021-05-03 00:19:02,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 199 states have (on average 1.1557788944723617) internal successors, (230), 199 states have internal predecessors, (230), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:02,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 241 transitions. [2021-05-03 00:19:02,444 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 241 transitions. Word has length 58 [2021-05-03 00:19:02,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:02,444 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 241 transitions. [2021-05-03 00:19:02,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 28 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:02,444 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 241 transitions. [2021-05-03 00:19:02,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:19:02,444 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:02,444 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:02,444 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable366 [2021-05-03 00:19:02,445 INFO L428 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:02,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:02,445 INFO L82 PathProgramCache]: Analyzing trace with hash -279363810, now seen corresponding path program 61 times [2021-05-03 00:19:02,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:02,445 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [606681990] [2021-05-03 00:19:02,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:02,452 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_295 v_main_~c~0_1367) (< v_main_~c~0_1367 v_~SIZE~0_290)) InVars {~SIZE~0=v_~SIZE~0_290, main_~c~0=v_main_~c~0_1367, ~last~0=v_~last~0_295} OutVars{~SIZE~0=v_~SIZE~0_290, main_~c~0=v_main_~c~0_1367, ~last~0=v_~last~0_295} AuxVars[] AssignedVars[] [2021-05-03 00:19:02,453 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:02,468 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:02,469 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:02,478 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:02,481 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:02,494 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:02,513 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1369 v_~last~0_296) (< v_main_~c~0_1369 v_~SIZE~0_291)) InVars {~SIZE~0=v_~SIZE~0_291, main_~c~0=v_main_~c~0_1369, ~last~0=v_~last~0_296} OutVars{~SIZE~0=v_~SIZE~0_291, main_~c~0=v_main_~c~0_1369, ~last~0=v_~last~0_296} AuxVars[] AssignedVars[] [2021-05-03 00:19:02,514 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:02,515 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:02,516 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:02,528 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:02,532 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:02,553 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:02,572 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:02,574 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_297 v_main_~c~0_1371) (< (+ v_main_~c~0_1371 1) v_~SIZE~0_292)) InVars {~SIZE~0=v_~SIZE~0_292, main_~c~0=v_main_~c~0_1371, ~last~0=v_~last~0_297} OutVars{~SIZE~0=v_~SIZE~0_292, main_~c~0=v_main_~c~0_1371, ~last~0=v_~last~0_297} AuxVars[] AssignedVars[] [2021-05-03 00:19:02,575 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:02,576 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:02,578 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:02,587 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:02,590 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:02,616 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:02,635 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1373 v_~last~0_298) (< (+ v_main_~c~0_1373 1) v_~SIZE~0_293)) InVars {~SIZE~0=v_~SIZE~0_293, main_~c~0=v_main_~c~0_1373, ~last~0=v_~last~0_298} OutVars{~SIZE~0=v_~SIZE~0_293, main_~c~0=v_main_~c~0_1373, ~last~0=v_~last~0_298} AuxVars[] AssignedVars[] [2021-05-03 00:19:02,636 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:02,637 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:02,638 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:02,649 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:02,653 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:02,675 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:02,694 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:02,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:02,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:02,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:02,833 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:03,789 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:03,790 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [606681990] [2021-05-03 00:19:03,790 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [606681990] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:03,790 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:03,790 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:19:03,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487160608] [2021-05-03 00:19:03,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:19:03,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:03,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:19:03,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:19:03,791 INFO L87 Difference]: Start difference. First operand 209 states and 241 transitions. Second operand has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 29 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:05,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:05,287 INFO L93 Difference]: Finished difference Result 433 states and 491 transitions. [2021-05-03 00:19:05,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:19:05,288 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 29 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:19:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:05,289 INFO L225 Difference]: With dead ends: 433 [2021-05-03 00:19:05,289 INFO L226 Difference]: Without dead ends: 271 [2021-05-03 00:19:05,290 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 16 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1063.4ms TimeCoverageRelationStatistics Valid=136, Invalid=986, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:19:05,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-05-03 00:19:05,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 209. [2021-05-03 00:19:05,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 199 states have (on average 1.1557788944723617) internal successors, (230), 199 states have internal predecessors, (230), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:05,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 241 transitions. [2021-05-03 00:19:05,459 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 241 transitions. Word has length 58 [2021-05-03 00:19:05,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:05,459 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 241 transitions. [2021-05-03 00:19:05,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 29 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:05,459 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 241 transitions. [2021-05-03 00:19:05,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:19:05,459 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:05,459 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:05,459 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable371 [2021-05-03 00:19:05,459 INFO L428 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:05,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:05,460 INFO L82 PathProgramCache]: Analyzing trace with hash -217324196, now seen corresponding path program 62 times [2021-05-03 00:19:05,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:05,460 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [323940983] [2021-05-03 00:19:05,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:05,470 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_299 v_main_~c~0_1389) (< v_main_~c~0_1389 v_~SIZE~0_294)) InVars {~SIZE~0=v_~SIZE~0_294, main_~c~0=v_main_~c~0_1389, ~last~0=v_~last~0_299} OutVars{~SIZE~0=v_~SIZE~0_294, main_~c~0=v_main_~c~0_1389, ~last~0=v_~last~0_299} AuxVars[] AssignedVars[] [2021-05-03 00:19:05,472 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:05,473 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:05,475 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:05,488 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:05,493 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:05,535 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:05,562 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1391 v_~last~0_300) (< v_main_~c~0_1391 v_~SIZE~0_295)) InVars {~SIZE~0=v_~SIZE~0_295, main_~c~0=v_main_~c~0_1391, ~last~0=v_~last~0_300} OutVars{~SIZE~0=v_~SIZE~0_295, main_~c~0=v_main_~c~0_1391, ~last~0=v_~last~0_300} AuxVars[] AssignedVars[] [2021-05-03 00:19:05,564 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:05,565 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:05,568 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:05,587 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:05,593 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:05,627 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:05,656 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:05,659 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_301 v_main_~c~0_1393) (< (+ v_main_~c~0_1393 1) v_~SIZE~0_296)) InVars {~SIZE~0=v_~SIZE~0_296, main_~c~0=v_main_~c~0_1393, ~last~0=v_~last~0_301} OutVars{~SIZE~0=v_~SIZE~0_296, main_~c~0=v_main_~c~0_1393, ~last~0=v_~last~0_301} AuxVars[] AssignedVars[] [2021-05-03 00:19:05,661 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:05,686 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:05,689 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:05,704 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:05,708 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:05,731 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:05,774 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1395 v_~last~0_302) (< (+ v_main_~c~0_1395 1) v_~SIZE~0_297)) InVars {~SIZE~0=v_~SIZE~0_297, main_~c~0=v_main_~c~0_1395, ~last~0=v_~last~0_302} OutVars{~SIZE~0=v_~SIZE~0_297, main_~c~0=v_main_~c~0_1395, ~last~0=v_~last~0_302} AuxVars[] AssignedVars[] [2021-05-03 00:19:05,776 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:05,799 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:05,801 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:05,821 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:05,827 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:05,844 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:05,869 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:06,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:06,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:06,015 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:07,001 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:07,002 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [323940983] [2021-05-03 00:19:07,002 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [323940983] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:07,002 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:07,002 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:19:07,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88394856] [2021-05-03 00:19:07,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:19:07,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:07,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:19:07,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:19:07,003 INFO L87 Difference]: Start difference. First operand 209 states and 241 transitions. Second operand has 32 states, 32 states have (on average 1.625) internal successors, (52), 30 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:08,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:08,354 INFO L93 Difference]: Finished difference Result 430 states and 488 transitions. [2021-05-03 00:19:08,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:19:08,356 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.625) internal successors, (52), 30 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:19:08,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:08,357 INFO L225 Difference]: With dead ends: 430 [2021-05-03 00:19:08,357 INFO L226 Difference]: Without dead ends: 268 [2021-05-03 00:19:08,357 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 15 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1082.7ms TimeCoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:19:08,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-05-03 00:19:08,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 209. [2021-05-03 00:19:08,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 199 states have (on average 1.1557788944723617) internal successors, (230), 199 states have internal predecessors, (230), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 241 transitions. [2021-05-03 00:19:08,494 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 241 transitions. Word has length 58 [2021-05-03 00:19:08,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:08,494 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 241 transitions. [2021-05-03 00:19:08,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 1.625) internal successors, (52), 30 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:08,494 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 241 transitions. [2021-05-03 00:19:08,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:19:08,494 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:08,495 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:08,495 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable376 [2021-05-03 00:19:08,495 INFO L428 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:08,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:08,495 INFO L82 PathProgramCache]: Analyzing trace with hash -2022762530, now seen corresponding path program 63 times [2021-05-03 00:19:08,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:08,495 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1656101728] [2021-05-03 00:19:08,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:08,503 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1411 v_~SIZE~0_298) (<= v_~last~0_303 v_main_~c~0_1411)) InVars {~SIZE~0=v_~SIZE~0_298, main_~c~0=v_main_~c~0_1411, ~last~0=v_~last~0_303} OutVars{~SIZE~0=v_~SIZE~0_298, main_~c~0=v_main_~c~0_1411, ~last~0=v_~last~0_303} AuxVars[] AssignedVars[] [2021-05-03 00:19:08,505 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:08,523 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:08,525 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:08,536 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:08,539 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:08,555 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:08,577 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1413 v_~last~0_304) (< v_main_~c~0_1413 v_~SIZE~0_299)) InVars {~SIZE~0=v_~SIZE~0_299, main_~c~0=v_main_~c~0_1413, ~last~0=v_~last~0_304} OutVars{~SIZE~0=v_~SIZE~0_299, main_~c~0=v_main_~c~0_1413, ~last~0=v_~last~0_304} AuxVars[] AssignedVars[] [2021-05-03 00:19:08,579 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:08,579 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:08,581 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:08,597 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:08,602 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:08,629 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:08,649 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:08,652 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1415 1) v_~SIZE~0_300) (<= v_~last~0_305 v_main_~c~0_1415)) InVars {~SIZE~0=v_~SIZE~0_300, main_~c~0=v_main_~c~0_1415, ~last~0=v_~last~0_305} OutVars{~SIZE~0=v_~SIZE~0_300, main_~c~0=v_main_~c~0_1415, ~last~0=v_~last~0_305} AuxVars[] AssignedVars[] [2021-05-03 00:19:08,654 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:08,655 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:08,656 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:08,668 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:08,671 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:08,702 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:08,723 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1417 v_~last~0_306) (< (+ v_main_~c~0_1417 1) v_~SIZE~0_301)) InVars {~SIZE~0=v_~SIZE~0_301, main_~c~0=v_main_~c~0_1417, ~last~0=v_~last~0_306} OutVars{~SIZE~0=v_~SIZE~0_301, main_~c~0=v_main_~c~0_1417, ~last~0=v_~last~0_306} AuxVars[] AssignedVars[] [2021-05-03 00:19:08,725 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:08,726 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:08,727 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:08,741 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:08,747 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:08,773 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:08,792 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:08,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:08,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:08,970 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:09,942 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:09,943 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1656101728] [2021-05-03 00:19:09,943 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1656101728] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:09,943 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:09,943 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:19:09,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96138897] [2021-05-03 00:19:09,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:19:09,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:09,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:19:09,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:19:09,944 INFO L87 Difference]: Start difference. First operand 209 states and 241 transitions. Second operand has 33 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 31 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:11,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:11,121 INFO L93 Difference]: Finished difference Result 427 states and 485 transitions. [2021-05-03 00:19:11,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:19:11,123 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 31 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:19:11,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:11,124 INFO L225 Difference]: With dead ends: 427 [2021-05-03 00:19:11,124 INFO L226 Difference]: Without dead ends: 265 [2021-05-03 00:19:11,125 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 8 SyntacticMatches, 13 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1107.9ms TimeCoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:19:11,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-05-03 00:19:11,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 209. [2021-05-03 00:19:11,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 199 states have (on average 1.1557788944723617) internal successors, (230), 199 states have internal predecessors, (230), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:11,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 241 transitions. [2021-05-03 00:19:11,343 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 241 transitions. Word has length 58 [2021-05-03 00:19:11,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:11,343 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 241 transitions. [2021-05-03 00:19:11,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 31 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:11,344 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 241 transitions. [2021-05-03 00:19:11,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:19:11,345 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:11,345 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:11,345 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable381 [2021-05-03 00:19:11,346 INFO L428 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:11,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:11,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1454556316, now seen corresponding path program 64 times [2021-05-03 00:19:11,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:11,346 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [623797950] [2021-05-03 00:19:11,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:11,358 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_307 v_main_~c~0_1433) (< v_main_~c~0_1433 v_~SIZE~0_302)) InVars {~SIZE~0=v_~SIZE~0_302, main_~c~0=v_main_~c~0_1433, ~last~0=v_~last~0_307} OutVars{~SIZE~0=v_~SIZE~0_302, main_~c~0=v_main_~c~0_1433, ~last~0=v_~last~0_307} AuxVars[] AssignedVars[] [2021-05-03 00:19:11,360 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:11,383 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:11,385 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:11,403 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:11,407 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:11,430 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:11,453 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1435 v_~last~0_308) (< v_main_~c~0_1435 v_~SIZE~0_303)) InVars {~SIZE~0=v_~SIZE~0_303, main_~c~0=v_main_~c~0_1435, ~last~0=v_~last~0_308} OutVars{~SIZE~0=v_~SIZE~0_303, main_~c~0=v_main_~c~0_1435, ~last~0=v_~last~0_308} AuxVars[] AssignedVars[] [2021-05-03 00:19:11,455 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:11,456 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:11,465 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:11,481 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:11,487 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:11,514 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:11,536 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:11,538 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_309 v_main_~c~0_1437) (< (+ v_main_~c~0_1437 1) v_~SIZE~0_304)) InVars {~SIZE~0=v_~SIZE~0_304, main_~c~0=v_main_~c~0_1437, ~last~0=v_~last~0_309} OutVars{~SIZE~0=v_~SIZE~0_304, main_~c~0=v_main_~c~0_1437, ~last~0=v_~last~0_309} AuxVars[] AssignedVars[] [2021-05-03 00:19:11,541 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:11,542 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:11,544 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:11,558 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:11,561 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:11,597 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:11,624 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1439 v_~last~0_310) (< (+ v_main_~c~0_1439 1) v_~SIZE~0_305)) InVars {~SIZE~0=v_~SIZE~0_305, main_~c~0=v_main_~c~0_1439, ~last~0=v_~last~0_310} OutVars{~SIZE~0=v_~SIZE~0_305, main_~c~0=v_main_~c~0_1439, ~last~0=v_~last~0_310} AuxVars[] AssignedVars[] [2021-05-03 00:19:11,626 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:11,644 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:11,646 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:11,663 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:11,669 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:11,688 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:11,712 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:11,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:11,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:11,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:11,888 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:13,011 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:13,012 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [623797950] [2021-05-03 00:19:13,012 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [623797950] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:13,012 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:13,012 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-03 00:19:13,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811933191] [2021-05-03 00:19:13,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-03 00:19:13,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:13,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-03 00:19:13,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:19:13,013 INFO L87 Difference]: Start difference. First operand 209 states and 241 transitions. Second operand has 34 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 32 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:14,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:14,193 INFO L93 Difference]: Finished difference Result 424 states and 482 transitions. [2021-05-03 00:19:14,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:19:14,194 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 32 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:19:14,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:14,195 INFO L225 Difference]: With dead ends: 424 [2021-05-03 00:19:14,195 INFO L226 Difference]: Without dead ends: 262 [2021-05-03 00:19:14,196 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 6 SyntacticMatches, 14 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1233.4ms TimeCoverageRelationStatistics Valid=157, Invalid=1175, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:19:14,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-05-03 00:19:14,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 209. [2021-05-03 00:19:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 199 states have (on average 1.1557788944723617) internal successors, (230), 199 states have internal predecessors, (230), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 241 transitions. [2021-05-03 00:19:14,324 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 241 transitions. Word has length 58 [2021-05-03 00:19:14,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:14,324 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 241 transitions. [2021-05-03 00:19:14,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 32 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:14,324 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 241 transitions. [2021-05-03 00:19:14,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:19:14,325 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:14,325 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:14,325 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable386 [2021-05-03 00:19:14,325 INFO L428 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:14,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:14,325 INFO L82 PathProgramCache]: Analyzing trace with hash -133791586, now seen corresponding path program 65 times [2021-05-03 00:19:14,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:14,325 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1052806672] [2021-05-03 00:19:14,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:14,332 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1455 v_~SIZE~0_306) (<= v_~last~0_311 v_main_~c~0_1455)) InVars {~SIZE~0=v_~SIZE~0_306, main_~c~0=v_main_~c~0_1455, ~last~0=v_~last~0_311} OutVars{~SIZE~0=v_~SIZE~0_306, main_~c~0=v_main_~c~0_1455, ~last~0=v_~last~0_311} AuxVars[] AssignedVars[] [2021-05-03 00:19:14,334 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:14,334 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:14,336 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:14,346 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:14,349 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:14,374 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:14,394 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1457 v_~last~0_312) (< v_main_~c~0_1457 v_~SIZE~0_307)) InVars {~SIZE~0=v_~SIZE~0_307, main_~c~0=v_main_~c~0_1457, ~last~0=v_~last~0_312} OutVars{~SIZE~0=v_~SIZE~0_307, main_~c~0=v_main_~c~0_1457, ~last~0=v_~last~0_312} AuxVars[] AssignedVars[] [2021-05-03 00:19:14,396 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:14,396 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:14,398 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:14,410 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:14,414 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:14,439 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:14,457 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:14,459 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_313 v_main_~c~0_1459) (< (+ v_main_~c~0_1459 1) v_~SIZE~0_308)) InVars {~SIZE~0=v_~SIZE~0_308, main_~c~0=v_main_~c~0_1459, ~last~0=v_~last~0_313} OutVars{~SIZE~0=v_~SIZE~0_308, main_~c~0=v_main_~c~0_1459, ~last~0=v_~last~0_313} AuxVars[] AssignedVars[] [2021-05-03 00:19:14,461 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:14,462 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:14,463 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:14,472 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:14,475 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:14,502 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:14,522 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1461 v_~last~0_314) (< (+ v_main_~c~0_1461 1) v_~SIZE~0_309)) InVars {~SIZE~0=v_~SIZE~0_309, main_~c~0=v_main_~c~0_1461, ~last~0=v_~last~0_314} OutVars{~SIZE~0=v_~SIZE~0_309, main_~c~0=v_main_~c~0_1461, ~last~0=v_~last~0_314} AuxVars[] AssignedVars[] [2021-05-03 00:19:14,523 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:14,535 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:14,537 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:14,550 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:14,555 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:14,568 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:14,587 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:14,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:14,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:14,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:14,728 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:15,742 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:15,742 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1052806672] [2021-05-03 00:19:15,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1052806672] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:15,743 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:15,743 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-03 00:19:15,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173579624] [2021-05-03 00:19:15,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-03 00:19:15,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:15,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-03 00:19:15,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1106, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:19:15,744 INFO L87 Difference]: Start difference. First operand 209 states and 241 transitions. Second operand has 35 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 33 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:16,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:16,939 INFO L93 Difference]: Finished difference Result 421 states and 479 transitions. [2021-05-03 00:19:16,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:19:16,941 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 33 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:19:16,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:16,942 INFO L225 Difference]: With dead ends: 421 [2021-05-03 00:19:16,942 INFO L226 Difference]: Without dead ends: 259 [2021-05-03 00:19:16,942 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1119.1ms TimeCoverageRelationStatistics Valid=164, Invalid=1242, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:19:16,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-05-03 00:19:17,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 209. [2021-05-03 00:19:17,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 199 states have (on average 1.1557788944723617) internal successors, (230), 199 states have internal predecessors, (230), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 241 transitions. [2021-05-03 00:19:17,090 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 241 transitions. Word has length 58 [2021-05-03 00:19:17,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:17,090 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 241 transitions. [2021-05-03 00:19:17,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 33 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:17,090 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 241 transitions. [2021-05-03 00:19:17,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:19:17,090 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:17,090 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 11, 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-03 00:19:17,090 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable391 [2021-05-03 00:19:17,090 INFO L428 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:17,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:17,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1144908836, now seen corresponding path program 66 times [2021-05-03 00:19:17,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:17,091 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2140653137] [2021-05-03 00:19:17,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:17,096 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1477 v_~SIZE~0_310) (<= v_~last~0_315 v_main_~c~0_1477)) InVars {~SIZE~0=v_~SIZE~0_310, main_~c~0=v_main_~c~0_1477, ~last~0=v_~last~0_315} OutVars{~SIZE~0=v_~SIZE~0_310, main_~c~0=v_main_~c~0_1477, ~last~0=v_~last~0_315} AuxVars[] AssignedVars[] [2021-05-03 00:19:17,098 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:17,118 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:17,120 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:17,133 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:17,136 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:17,155 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:17,178 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1479 v_~last~0_316) (< v_main_~c~0_1479 v_~SIZE~0_311)) InVars {~SIZE~0=v_~SIZE~0_311, main_~c~0=v_main_~c~0_1479, ~last~0=v_~last~0_316} OutVars{~SIZE~0=v_~SIZE~0_311, main_~c~0=v_main_~c~0_1479, ~last~0=v_~last~0_316} AuxVars[] AssignedVars[] [2021-05-03 00:19:17,180 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:17,194 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:17,196 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:17,210 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:17,215 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:17,231 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:17,250 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:17,252 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1481 v_~last~0_317) (< (+ v_main_~c~0_1481 1) v_~SIZE~0_312)) InVars {~SIZE~0=v_~SIZE~0_312, main_~c~0=v_main_~c~0_1481, ~last~0=v_~last~0_317} OutVars{~SIZE~0=v_~SIZE~0_312, main_~c~0=v_main_~c~0_1481, ~last~0=v_~last~0_317} AuxVars[] AssignedVars[] [2021-05-03 00:19:17,254 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:17,276 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:17,278 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:17,292 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:17,297 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:17,313 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:17,338 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:17,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:17,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:17,491 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:18,606 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:18,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2140653137] [2021-05-03 00:19:18,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2140653137] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:18,606 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:18,606 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-03 00:19:18,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10250033] [2021-05-03 00:19:18,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-03 00:19:18,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:18,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-03 00:19:18,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1171, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:19:18,607 INFO L87 Difference]: Start difference. First operand 209 states and 241 transitions. Second operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 34 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:20,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:20,179 INFO L93 Difference]: Finished difference Result 420 states and 479 transitions. [2021-05-03 00:19:20,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:19:20,180 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 34 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:19:20,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:20,181 INFO L225 Difference]: With dead ends: 420 [2021-05-03 00:19:20,181 INFO L226 Difference]: Without dead ends: 258 [2021-05-03 00:19:20,182 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 6 SyntacticMatches, 12 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1218.5ms TimeCoverageRelationStatistics Valid=171, Invalid=1311, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:19:20,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-05-03 00:19:20,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 210. [2021-05-03 00:19:20,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 200 states have (on average 1.16) internal successors, (232), 200 states have internal predecessors, (232), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:20,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 243 transitions. [2021-05-03 00:19:20,314 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 243 transitions. Word has length 58 [2021-05-03 00:19:20,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:20,314 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 243 transitions. [2021-05-03 00:19:20,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 34 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:20,315 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 243 transitions. [2021-05-03 00:19:20,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-03 00:19:20,315 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:20,315 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:20,315 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable395 [2021-05-03 00:19:20,315 INFO L428 AbstractCegarLoop]: === Iteration 96 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:20,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:20,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1310449186, now seen corresponding path program 12 times [2021-05-03 00:19:20,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:20,316 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [854050538] [2021-05-03 00:19:20,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:20,320 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1497 v_~last~0_318) (< v_main_~c~0_1497 v_~SIZE~0_313)) InVars {~SIZE~0=v_~SIZE~0_313, main_~c~0=v_main_~c~0_1497, ~last~0=v_~last~0_318} OutVars{~SIZE~0=v_~SIZE~0_313, main_~c~0=v_main_~c~0_1497, ~last~0=v_~last~0_318} AuxVars[] AssignedVars[] [2021-05-03 00:19:20,321 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:20,322 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:20,323 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:20,335 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:20,340 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:20,362 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:20,381 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:19:20,382 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1499 1) v_~SIZE~0_314) (< v_main_~c~0_1499 v_~last~0_319)) InVars {~SIZE~0=v_~SIZE~0_314, main_~c~0=v_main_~c~0_1499, ~last~0=v_~last~0_319} OutVars{~SIZE~0=v_~SIZE~0_314, main_~c~0=v_main_~c~0_1499, ~last~0=v_~last~0_319} AuxVars[] AssignedVars[] [2021-05-03 00:19:20,383 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:20,384 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:20,385 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:20,398 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:20,402 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:20,425 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:20,443 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:19:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:20,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:20,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:20,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:21,595 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:21,595 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [854050538] [2021-05-03 00:19:21,595 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [854050538] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:21,595 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:21,595 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-03 00:19:21,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301007785] [2021-05-03 00:19:21,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-03 00:19:21,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:21,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-03 00:19:21,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1231, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:19:21,596 INFO L87 Difference]: Start difference. First operand 210 states and 243 transitions. Second operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 34 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:23,594 INFO L93 Difference]: Finished difference Result 431 states and 491 transitions. [2021-05-03 00:19:23,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-05-03 00:19:23,595 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 34 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2021-05-03 00:19:23,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:23,596 INFO L225 Difference]: With dead ends: 431 [2021-05-03 00:19:23,596 INFO L226 Difference]: Without dead ends: 269 [2021-05-03 00:19:23,597 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 11 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 1601.0ms TimeCoverageRelationStatistics Valid=281, Invalid=2371, Unknown=0, NotChecked=0, Total=2652 [2021-05-03 00:19:23,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-05-03 00:19:23,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 212. [2021-05-03 00:19:23,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 202 states have (on average 1.1584158415841583) internal successors, (234), 202 states have internal predecessors, (234), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 245 transitions. [2021-05-03 00:19:23,728 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 245 transitions. Word has length 58 [2021-05-03 00:19:23,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:23,728 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 245 transitions. [2021-05-03 00:19:23,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 34 states have internal predecessors, (52), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:23,729 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 245 transitions. [2021-05-03 00:19:23,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:19:23,729 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:23,729 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:23,729 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable398 [2021-05-03 00:19:23,729 INFO L428 AbstractCegarLoop]: === Iteration 97 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:23,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:23,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1184998237, now seen corresponding path program 13 times [2021-05-03 00:19:23,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:23,730 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1902660361] [2021-05-03 00:19:23,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:23,735 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1514 v_~SIZE~0_315) (<= v_~last~0_320 v_main_~c~0_1514)) InVars {~SIZE~0=v_~SIZE~0_315, main_~c~0=v_main_~c~0_1514, ~last~0=v_~last~0_320} OutVars{~SIZE~0=v_~SIZE~0_315, main_~c~0=v_main_~c~0_1514, ~last~0=v_~last~0_320} AuxVars[] AssignedVars[] [2021-05-03 00:19:23,736 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:23,737 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:23,738 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:23,748 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:23,751 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:23,776 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:23,795 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:19:23,796 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_321 v_main_~c~0_1516) (< (+ v_main_~c~0_1516 1) v_~SIZE~0_316)) InVars {~SIZE~0=v_~SIZE~0_316, main_~c~0=v_main_~c~0_1516, ~last~0=v_~last~0_321} OutVars{~SIZE~0=v_~SIZE~0_316, main_~c~0=v_main_~c~0_1516, ~last~0=v_~last~0_321} AuxVars[] AssignedVars[] [2021-05-03 00:19:23,798 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:23,813 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:23,814 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:23,823 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:23,825 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:23,840 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:23,858 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:19:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:23,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:23,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:24,943 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:24,944 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1902660361] [2021-05-03 00:19:24,944 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1902660361] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:24,944 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:24,944 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:19:24,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168468419] [2021-05-03 00:19:24,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:19:24,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:24,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:19:24,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:19:24,945 INFO L87 Difference]: Start difference. First operand 212 states and 245 transitions. Second operand has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 24 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:26,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:26,089 INFO L93 Difference]: Finished difference Result 454 states and 513 transitions. [2021-05-03 00:19:26,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:19:26,090 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 24 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:19:26,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:26,091 INFO L225 Difference]: With dead ends: 454 [2021-05-03 00:19:26,091 INFO L226 Difference]: Without dead ends: 292 [2021-05-03 00:19:26,092 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 24 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1048.4ms TimeCoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:19:26,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-05-03 00:19:26,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 215. [2021-05-03 00:19:26,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.1560975609756097) internal successors, (237), 205 states have internal predecessors, (237), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:26,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 248 transitions. [2021-05-03 00:19:26,245 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 248 transitions. Word has length 61 [2021-05-03 00:19:26,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:26,245 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 248 transitions. [2021-05-03 00:19:26,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 24 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:26,245 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 248 transitions. [2021-05-03 00:19:26,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:19:26,246 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:26,246 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 12, 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-03 00:19:26,246 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable401 [2021-05-03 00:19:26,246 INFO L428 AbstractCegarLoop]: === Iteration 98 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:26,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:26,246 INFO L82 PathProgramCache]: Analyzing trace with hash 831909855, now seen corresponding path program 67 times [2021-05-03 00:19:26,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:26,247 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [697111933] [2021-05-03 00:19:26,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:26,254 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1532 v_~SIZE~0_317) (<= v_~last~0_322 v_main_~c~0_1532)) InVars {~SIZE~0=v_~SIZE~0_317, main_~c~0=v_main_~c~0_1532, ~last~0=v_~last~0_322} OutVars{~SIZE~0=v_~SIZE~0_317, main_~c~0=v_main_~c~0_1532, ~last~0=v_~last~0_322} AuxVars[] AssignedVars[] [2021-05-03 00:19:26,256 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:26,276 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:26,286 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:26,299 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:26,302 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:26,320 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:26,344 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1534 v_~last~0_323) (< v_main_~c~0_1534 v_~SIZE~0_318)) InVars {~SIZE~0=v_~SIZE~0_318, main_~c~0=v_main_~c~0_1534, ~last~0=v_~last~0_323} OutVars{~SIZE~0=v_~SIZE~0_318, main_~c~0=v_main_~c~0_1534, ~last~0=v_~last~0_323} AuxVars[] AssignedVars[] [2021-05-03 00:19:26,346 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:26,347 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:26,348 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:26,369 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:26,374 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:26,403 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:26,423 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:26,425 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_324 v_main_~c~0_1536) (< (+ v_main_~c~0_1536 1) v_~SIZE~0_319)) InVars {~SIZE~0=v_~SIZE~0_319, main_~c~0=v_main_~c~0_1536, ~last~0=v_~last~0_324} OutVars{~SIZE~0=v_~SIZE~0_319, main_~c~0=v_main_~c~0_1536, ~last~0=v_~last~0_324} AuxVars[] AssignedVars[] [2021-05-03 00:19:26,427 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:26,446 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:26,448 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:26,460 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:26,463 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:26,479 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:26,502 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1538 1) v_~SIZE~0_320) (< v_main_~c~0_1538 v_~last~0_325)) InVars {~SIZE~0=v_~SIZE~0_320, main_~c~0=v_main_~c~0_1538, ~last~0=v_~last~0_325} OutVars{~SIZE~0=v_~SIZE~0_320, main_~c~0=v_main_~c~0_1538, ~last~0=v_~last~0_325} AuxVars[] AssignedVars[] [2021-05-03 00:19:26,503 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:26,504 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:26,505 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:26,520 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:26,525 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:26,552 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:26,573 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:26,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:26,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:26,725 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:27,777 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:27,777 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [697111933] [2021-05-03 00:19:27,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [697111933] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:27,778 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:27,778 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:19:27,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544534413] [2021-05-03 00:19:27,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:19:27,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:27,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:19:27,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:19:27,778 INFO L87 Difference]: Start difference. First operand 215 states and 248 transitions. Second operand has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:28,959 INFO L93 Difference]: Finished difference Result 457 states and 516 transitions. [2021-05-03 00:19:28,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:19:28,960 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:19:28,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:28,961 INFO L225 Difference]: With dead ends: 457 [2021-05-03 00:19:28,962 INFO L226 Difference]: Without dead ends: 295 [2021-05-03 00:19:28,962 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 23 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1143.1ms TimeCoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:19:28,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-05-03 00:19:29,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 215. [2021-05-03 00:19:29,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.1560975609756097) internal successors, (237), 205 states have internal predecessors, (237), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:29,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 248 transitions. [2021-05-03 00:19:29,137 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 248 transitions. Word has length 61 [2021-05-03 00:19:29,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:29,137 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 248 transitions. [2021-05-03 00:19:29,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 25 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:29,137 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 248 transitions. [2021-05-03 00:19:29,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:19:29,137 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:29,137 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:29,137 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable406 [2021-05-03 00:19:29,138 INFO L428 AbstractCegarLoop]: === Iteration 99 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:29,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:29,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1217477987, now seen corresponding path program 68 times [2021-05-03 00:19:29,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:29,138 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [496037345] [2021-05-03 00:19:29,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:29,145 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1555 v_~SIZE~0_321) (<= v_~last~0_326 v_main_~c~0_1555)) InVars {~SIZE~0=v_~SIZE~0_321, main_~c~0=v_main_~c~0_1555, ~last~0=v_~last~0_326} OutVars{~SIZE~0=v_~SIZE~0_321, main_~c~0=v_main_~c~0_1555, ~last~0=v_~last~0_326} AuxVars[] AssignedVars[] [2021-05-03 00:19:29,147 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:29,165 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:29,167 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:29,178 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:29,181 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:29,198 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:29,221 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1557 v_~SIZE~0_322) (< v_main_~c~0_1557 v_~last~0_327)) InVars {~SIZE~0=v_~SIZE~0_322, main_~c~0=v_main_~c~0_1557, ~last~0=v_~last~0_327} OutVars{~SIZE~0=v_~SIZE~0_322, main_~c~0=v_main_~c~0_1557, ~last~0=v_~last~0_327} AuxVars[] AssignedVars[] [2021-05-03 00:19:29,223 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:29,224 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:29,225 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:29,239 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:29,245 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:29,272 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:29,292 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:29,296 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1559 1) v_~SIZE~0_323) (<= v_~last~0_328 v_main_~c~0_1559)) InVars {~SIZE~0=v_~SIZE~0_323, main_~c~0=v_main_~c~0_1559, ~last~0=v_~last~0_328} OutVars{~SIZE~0=v_~SIZE~0_323, main_~c~0=v_main_~c~0_1559, ~last~0=v_~last~0_328} AuxVars[] AssignedVars[] [2021-05-03 00:19:29,298 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:29,316 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:29,318 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:29,330 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:29,332 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:29,350 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:29,372 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1561 v_~last~0_329) (< (+ v_main_~c~0_1561 1) v_~SIZE~0_324)) InVars {~SIZE~0=v_~SIZE~0_324, main_~c~0=v_main_~c~0_1561, ~last~0=v_~last~0_329} OutVars{~SIZE~0=v_~SIZE~0_324, main_~c~0=v_main_~c~0_1561, ~last~0=v_~last~0_329} AuxVars[] AssignedVars[] [2021-05-03 00:19:29,374 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:29,375 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:29,377 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:29,392 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:29,398 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:29,426 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:29,449 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:29,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:29,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:29,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-03 00:19:29,669 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:30,768 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:30,768 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [496037345] [2021-05-03 00:19:30,769 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [496037345] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:30,769 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:30,769 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:19:30,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915777930] [2021-05-03 00:19:30,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:19:30,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:30,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:19:30,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:19:30,769 INFO L87 Difference]: Start difference. First operand 215 states and 248 transitions. Second operand has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 26 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:31,994 INFO L93 Difference]: Finished difference Result 454 states and 513 transitions. [2021-05-03 00:19:31,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:19:31,995 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 26 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:19:31,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:31,996 INFO L225 Difference]: With dead ends: 454 [2021-05-03 00:19:31,996 INFO L226 Difference]: Without dead ends: 292 [2021-05-03 00:19:31,996 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 23 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1235.4ms TimeCoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:19:31,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-05-03 00:19:32,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 215. [2021-05-03 00:19:32,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.1560975609756097) internal successors, (237), 205 states have internal predecessors, (237), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:32,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 248 transitions. [2021-05-03 00:19:32,158 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 248 transitions. Word has length 61 [2021-05-03 00:19:32,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:32,159 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 248 transitions. [2021-05-03 00:19:32,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 26 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:32,159 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 248 transitions. [2021-05-03 00:19:32,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:19:32,159 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:32,159 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:32,159 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable411 [2021-05-03 00:19:32,159 INFO L428 AbstractCegarLoop]: === Iteration 100 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:32,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:32,160 INFO L82 PathProgramCache]: Analyzing trace with hash -793831265, now seen corresponding path program 69 times [2021-05-03 00:19:32,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:32,160 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [808096463] [2021-05-03 00:19:32,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:32,168 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_330 v_main_~c~0_1578) (< v_main_~c~0_1578 v_~SIZE~0_325)) InVars {~SIZE~0=v_~SIZE~0_325, main_~c~0=v_main_~c~0_1578, ~last~0=v_~last~0_330} OutVars{~SIZE~0=v_~SIZE~0_325, main_~c~0=v_main_~c~0_1578, ~last~0=v_~last~0_330} AuxVars[] AssignedVars[] [2021-05-03 00:19:32,169 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:32,170 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:32,172 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:32,182 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:32,185 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:32,213 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:32,234 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1580 v_~last~0_331) (< v_main_~c~0_1580 v_~SIZE~0_326)) InVars {~SIZE~0=v_~SIZE~0_326, main_~c~0=v_main_~c~0_1580, ~last~0=v_~last~0_331} OutVars{~SIZE~0=v_~SIZE~0_326, main_~c~0=v_main_~c~0_1580, ~last~0=v_~last~0_331} AuxVars[] AssignedVars[] [2021-05-03 00:19:32,235 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:32,248 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:32,249 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:32,262 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:32,266 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:32,280 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:32,299 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:32,301 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_332 v_main_~c~0_1582) (< (+ v_main_~c~0_1582 1) v_~SIZE~0_327)) InVars {~SIZE~0=v_~SIZE~0_327, main_~c~0=v_main_~c~0_1582, ~last~0=v_~last~0_332} OutVars{~SIZE~0=v_~SIZE~0_327, main_~c~0=v_main_~c~0_1582, ~last~0=v_~last~0_332} AuxVars[] AssignedVars[] [2021-05-03 00:19:32,303 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:32,303 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:32,305 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:32,315 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:32,318 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:32,351 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:32,373 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1584 1) v_~SIZE~0_328) (< v_main_~c~0_1584 v_~last~0_333)) InVars {~SIZE~0=v_~SIZE~0_328, main_~c~0=v_main_~c~0_1584, ~last~0=v_~last~0_333} OutVars{~SIZE~0=v_~SIZE~0_328, main_~c~0=v_main_~c~0_1584, ~last~0=v_~last~0_333} AuxVars[] AssignedVars[] [2021-05-03 00:19:32,375 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:32,376 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:32,377 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:32,396 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:32,400 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:32,425 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:32,445 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:32,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:32,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:32,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:32,587 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:33,620 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:33,620 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [808096463] [2021-05-03 00:19:33,620 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [808096463] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:33,620 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:33,621 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:19:33,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9554850] [2021-05-03 00:19:33,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:19:33,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:33,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:19:33,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:19:33,621 INFO L87 Difference]: Start difference. First operand 215 states and 248 transitions. Second operand has 29 states, 29 states have (on average 1.896551724137931) internal successors, (55), 27 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:34,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:34,824 INFO L93 Difference]: Finished difference Result 451 states and 510 transitions. [2021-05-03 00:19:34,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:19:34,826 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.896551724137931) internal successors, (55), 27 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:19:34,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:34,827 INFO L225 Difference]: With dead ends: 451 [2021-05-03 00:19:34,827 INFO L226 Difference]: Without dead ends: 289 [2021-05-03 00:19:34,828 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 22 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1126.2ms TimeCoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:19:34,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-05-03 00:19:35,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 215. [2021-05-03 00:19:35,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.1560975609756097) internal successors, (237), 205 states have internal predecessors, (237), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:35,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 248 transitions. [2021-05-03 00:19:35,004 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 248 transitions. Word has length 61 [2021-05-03 00:19:35,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:35,004 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 248 transitions. [2021-05-03 00:19:35,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 1.896551724137931) internal successors, (55), 27 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:35,004 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 248 transitions. [2021-05-03 00:19:35,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:19:35,005 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:35,005 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:35,005 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable416 [2021-05-03 00:19:35,005 INFO L428 AbstractCegarLoop]: === Iteration 101 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:35,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:35,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1823190563, now seen corresponding path program 70 times [2021-05-03 00:19:35,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:35,005 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1402948674] [2021-05-03 00:19:35,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:35,014 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1601 v_~SIZE~0_329) (<= v_~last~0_334 v_main_~c~0_1601)) InVars {~SIZE~0=v_~SIZE~0_329, main_~c~0=v_main_~c~0_1601, ~last~0=v_~last~0_334} OutVars{~SIZE~0=v_~SIZE~0_329, main_~c~0=v_main_~c~0_1601, ~last~0=v_~last~0_334} AuxVars[] AssignedVars[] [2021-05-03 00:19:35,015 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:35,032 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:35,034 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:35,044 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:35,046 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:35,062 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:35,082 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1603 v_~SIZE~0_330) (< v_main_~c~0_1603 v_~last~0_335)) InVars {~SIZE~0=v_~SIZE~0_330, main_~c~0=v_main_~c~0_1603, ~last~0=v_~last~0_335} OutVars{~SIZE~0=v_~SIZE~0_330, main_~c~0=v_main_~c~0_1603, ~last~0=v_~last~0_335} AuxVars[] AssignedVars[] [2021-05-03 00:19:35,084 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:35,084 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:35,086 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:35,098 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:35,103 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:35,128 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:35,146 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:35,148 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1605 1) v_~SIZE~0_331) (<= v_~last~0_336 v_main_~c~0_1605)) InVars {~SIZE~0=v_~SIZE~0_331, main_~c~0=v_main_~c~0_1605, ~last~0=v_~last~0_336} OutVars{~SIZE~0=v_~SIZE~0_331, main_~c~0=v_main_~c~0_1605, ~last~0=v_~last~0_336} AuxVars[] AssignedVars[] [2021-05-03 00:19:35,150 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:35,165 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:35,167 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:35,177 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:35,180 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:35,195 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:35,216 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1607 v_~last~0_337) (< (+ v_main_~c~0_1607 1) v_~SIZE~0_332)) InVars {~SIZE~0=v_~SIZE~0_332, main_~c~0=v_main_~c~0_1607, ~last~0=v_~last~0_337} OutVars{~SIZE~0=v_~SIZE~0_332, main_~c~0=v_main_~c~0_1607, ~last~0=v_~last~0_337} AuxVars[] AssignedVars[] [2021-05-03 00:19:35,217 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:35,230 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:35,231 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:35,244 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:35,249 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:35,262 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:35,282 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:35,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:35,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:35,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:35,471 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:37,020 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:37,020 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1402948674] [2021-05-03 00:19:37,020 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1402948674] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:37,020 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:37,021 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:19:37,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898105791] [2021-05-03 00:19:37,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:19:37,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:37,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:19:37,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:19:37,022 INFO L87 Difference]: Start difference. First operand 215 states and 248 transitions. Second operand has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 28 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:38,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:38,541 INFO L93 Difference]: Finished difference Result 448 states and 507 transitions. [2021-05-03 00:19:38,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:19:38,542 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 28 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:19:38,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:38,544 INFO L225 Difference]: With dead ends: 448 [2021-05-03 00:19:38,544 INFO L226 Difference]: Without dead ends: 286 [2021-05-03 00:19:38,544 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 21 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1645.7ms TimeCoverageRelationStatistics Valid=126, Invalid=930, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:19:38,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-05-03 00:19:38,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 215. [2021-05-03 00:19:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.1560975609756097) internal successors, (237), 205 states have internal predecessors, (237), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 248 transitions. [2021-05-03 00:19:38,724 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 248 transitions. Word has length 61 [2021-05-03 00:19:38,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:38,724 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 248 transitions. [2021-05-03 00:19:38,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 28 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:38,724 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 248 transitions. [2021-05-03 00:19:38,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:19:38,724 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:38,724 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:38,725 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable421 [2021-05-03 00:19:38,725 INFO L428 AbstractCegarLoop]: === Iteration 102 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:38,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:38,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1627771231, now seen corresponding path program 71 times [2021-05-03 00:19:38,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:38,725 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1559078976] [2021-05-03 00:19:38,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:38,738 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1624 v_~SIZE~0_333) (<= v_~last~0_338 v_main_~c~0_1624)) InVars {~SIZE~0=v_~SIZE~0_333, main_~c~0=v_main_~c~0_1624, ~last~0=v_~last~0_338} OutVars{~SIZE~0=v_~SIZE~0_333, main_~c~0=v_main_~c~0_1624, ~last~0=v_~last~0_338} AuxVars[] AssignedVars[] [2021-05-03 00:19:38,740 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:38,740 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:38,742 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:38,764 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:38,767 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:38,796 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:38,817 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1626 v_~SIZE~0_334) (< v_main_~c~0_1626 v_~last~0_339)) InVars {~SIZE~0=v_~SIZE~0_334, main_~c~0=v_main_~c~0_1626, ~last~0=v_~last~0_339} OutVars{~SIZE~0=v_~SIZE~0_334, main_~c~0=v_main_~c~0_1626, ~last~0=v_~last~0_339} AuxVars[] AssignedVars[] [2021-05-03 00:19:38,819 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:38,831 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:38,833 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:38,846 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:38,851 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:38,875 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:38,898 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:38,900 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1628 1) v_~SIZE~0_335) (<= v_~last~0_340 v_main_~c~0_1628)) InVars {~SIZE~0=v_~SIZE~0_335, main_~c~0=v_main_~c~0_1628, ~last~0=v_~last~0_340} OutVars{~SIZE~0=v_~SIZE~0_335, main_~c~0=v_main_~c~0_1628, ~last~0=v_~last~0_340} AuxVars[] AssignedVars[] [2021-05-03 00:19:38,902 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:38,919 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:38,921 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:38,931 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:38,934 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:38,950 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:38,972 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1630 v_~last~0_341) (< (+ v_main_~c~0_1630 1) v_~SIZE~0_336)) InVars {~SIZE~0=v_~SIZE~0_336, main_~c~0=v_main_~c~0_1630, ~last~0=v_~last~0_341} OutVars{~SIZE~0=v_~SIZE~0_336, main_~c~0=v_main_~c~0_1630, ~last~0=v_~last~0_341} AuxVars[] AssignedVars[] [2021-05-03 00:19:38,973 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:38,974 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:38,976 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:38,990 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:38,994 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:39,019 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:39,039 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:39,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:39,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:39,188 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:40,477 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:40,478 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1559078976] [2021-05-03 00:19:40,478 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1559078976] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:40,478 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:40,478 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:19:40,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831125012] [2021-05-03 00:19:40,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:19:40,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:40,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:19:40,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:19:40,479 INFO L87 Difference]: Start difference. First operand 215 states and 248 transitions. Second operand has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 29 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:41,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:41,943 INFO L93 Difference]: Finished difference Result 445 states and 504 transitions. [2021-05-03 00:19:41,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:19:41,945 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 29 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:19:41,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:41,946 INFO L225 Difference]: With dead ends: 445 [2021-05-03 00:19:41,946 INFO L226 Difference]: Without dead ends: 283 [2021-05-03 00:19:41,946 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 20 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1381.0ms TimeCoverageRelationStatistics Valid=133, Invalid=989, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:19:41,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-05-03 00:19:42,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 215. [2021-05-03 00:19:42,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.1560975609756097) internal successors, (237), 205 states have internal predecessors, (237), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 248 transitions. [2021-05-03 00:19:42,150 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 248 transitions. Word has length 61 [2021-05-03 00:19:42,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:42,150 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 248 transitions. [2021-05-03 00:19:42,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 29 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 248 transitions. [2021-05-03 00:19:42,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:19:42,151 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:42,151 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:42,151 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable426 [2021-05-03 00:19:42,151 INFO L428 AbstractCegarLoop]: === Iteration 103 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:42,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:42,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1902530845, now seen corresponding path program 72 times [2021-05-03 00:19:42,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:42,151 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1825007369] [2021-05-03 00:19:42,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:42,160 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1647 v_~SIZE~0_337) (<= v_~last~0_342 v_main_~c~0_1647)) InVars {~SIZE~0=v_~SIZE~0_337, main_~c~0=v_main_~c~0_1647, ~last~0=v_~last~0_342} OutVars{~SIZE~0=v_~SIZE~0_337, main_~c~0=v_main_~c~0_1647, ~last~0=v_~last~0_342} AuxVars[] AssignedVars[] [2021-05-03 00:19:42,162 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:42,185 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:42,189 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:42,203 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:42,207 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:42,228 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:42,255 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1649 v_~SIZE~0_338) (< v_main_~c~0_1649 v_~last~0_343)) InVars {~SIZE~0=v_~SIZE~0_338, main_~c~0=v_main_~c~0_1649, ~last~0=v_~last~0_343} OutVars{~SIZE~0=v_~SIZE~0_338, main_~c~0=v_main_~c~0_1649, ~last~0=v_~last~0_343} AuxVars[] AssignedVars[] [2021-05-03 00:19:42,257 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:42,258 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:42,260 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:42,277 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:42,283 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:42,316 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:42,341 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:42,344 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1651 1) v_~SIZE~0_339) (<= v_~last~0_344 v_main_~c~0_1651)) InVars {~SIZE~0=v_~SIZE~0_339, main_~c~0=v_main_~c~0_1651, ~last~0=v_~last~0_344} OutVars{~SIZE~0=v_~SIZE~0_339, main_~c~0=v_main_~c~0_1651, ~last~0=v_~last~0_344} AuxVars[] AssignedVars[] [2021-05-03 00:19:42,346 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:42,347 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:42,349 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:42,363 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:42,367 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:42,404 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:42,431 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1653 v_~last~0_345) (< (+ v_main_~c~0_1653 1) v_~SIZE~0_340)) InVars {~SIZE~0=v_~SIZE~0_340, main_~c~0=v_main_~c~0_1653, ~last~0=v_~last~0_345} OutVars{~SIZE~0=v_~SIZE~0_340, main_~c~0=v_main_~c~0_1653, ~last~0=v_~last~0_345} AuxVars[] AssignedVars[] [2021-05-03 00:19:42,432 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:42,446 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:42,448 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:42,461 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:42,465 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:42,480 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:42,499 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:42,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:42,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:42,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:42,669 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:44,266 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:44,266 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1825007369] [2021-05-03 00:19:44,266 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1825007369] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:44,266 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:44,266 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:19:44,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791930082] [2021-05-03 00:19:44,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:19:44,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:44,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:19:44,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=926, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:19:44,267 INFO L87 Difference]: Start difference. First operand 215 states and 248 transitions. Second operand has 32 states, 32 states have (on average 1.71875) internal successors, (55), 30 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:46,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:46,580 INFO L93 Difference]: Finished difference Result 442 states and 501 transitions. [2021-05-03 00:19:46,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:19:46,582 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.71875) internal successors, (55), 30 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:19:46,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:46,583 INFO L225 Difference]: With dead ends: 442 [2021-05-03 00:19:46,583 INFO L226 Difference]: Without dead ends: 280 [2021-05-03 00:19:46,583 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 19 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1724.4ms TimeCoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:19:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-05-03 00:19:46,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 215. [2021-05-03 00:19:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.1560975609756097) internal successors, (237), 205 states have internal predecessors, (237), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:46,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 248 transitions. [2021-05-03 00:19:46,771 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 248 transitions. Word has length 61 [2021-05-03 00:19:46,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:46,772 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 248 transitions. [2021-05-03 00:19:46,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 1.71875) internal successors, (55), 30 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:46,772 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 248 transitions. [2021-05-03 00:19:46,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:19:46,772 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:46,772 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:46,772 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable431 [2021-05-03 00:19:46,772 INFO L428 AbstractCegarLoop]: === Iteration 104 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:46,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:46,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1006233057, now seen corresponding path program 73 times [2021-05-03 00:19:46,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:46,773 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [122960220] [2021-05-03 00:19:46,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:46,781 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1670 v_~SIZE~0_341) (<= v_~last~0_346 v_main_~c~0_1670)) InVars {~SIZE~0=v_~SIZE~0_341, main_~c~0=v_main_~c~0_1670, ~last~0=v_~last~0_346} OutVars{~SIZE~0=v_~SIZE~0_341, main_~c~0=v_main_~c~0_1670, ~last~0=v_~last~0_346} AuxVars[] AssignedVars[] [2021-05-03 00:19:46,783 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:46,784 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:46,793 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:46,806 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:46,809 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:46,845 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:46,872 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1672 v_~last~0_347) (< v_main_~c~0_1672 v_~SIZE~0_342)) InVars {~SIZE~0=v_~SIZE~0_342, main_~c~0=v_main_~c~0_1672, ~last~0=v_~last~0_347} OutVars{~SIZE~0=v_~SIZE~0_342, main_~c~0=v_main_~c~0_1672, ~last~0=v_~last~0_347} AuxVars[] AssignedVars[] [2021-05-03 00:19:46,874 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:46,890 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:46,892 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:46,909 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:46,915 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:46,932 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:46,960 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:46,963 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1674 1) v_~SIZE~0_343) (<= v_~last~0_348 v_main_~c~0_1674)) InVars {~SIZE~0=v_~SIZE~0_343, main_~c~0=v_main_~c~0_1674, ~last~0=v_~last~0_348} OutVars{~SIZE~0=v_~SIZE~0_343, main_~c~0=v_main_~c~0_1674, ~last~0=v_~last~0_348} AuxVars[] AssignedVars[] [2021-05-03 00:19:46,965 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:46,987 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:46,989 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:47,002 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:47,005 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:47,027 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:47,055 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1676 v_~last~0_349) (< (+ v_main_~c~0_1676 1) v_~SIZE~0_344)) InVars {~SIZE~0=v_~SIZE~0_344, main_~c~0=v_main_~c~0_1676, ~last~0=v_~last~0_349} OutVars{~SIZE~0=v_~SIZE~0_344, main_~c~0=v_main_~c~0_1676, ~last~0=v_~last~0_349} AuxVars[] AssignedVars[] [2021-05-03 00:19:47,057 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:47,074 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:47,077 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:47,095 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:47,101 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:47,116 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:47,137 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:47,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:47,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:47,286 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:48,473 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:48,473 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [122960220] [2021-05-03 00:19:48,473 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [122960220] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:48,473 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:48,474 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:19:48,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388833689] [2021-05-03 00:19:48,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:19:48,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:48,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:19:48,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=985, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:19:48,475 INFO L87 Difference]: Start difference. First operand 215 states and 248 transitions. Second operand has 33 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 31 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:50,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:50,119 INFO L93 Difference]: Finished difference Result 439 states and 498 transitions. [2021-05-03 00:19:50,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:19:50,121 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 31 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:19:50,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:50,122 INFO L225 Difference]: With dead ends: 439 [2021-05-03 00:19:50,122 INFO L226 Difference]: Without dead ends: 277 [2021-05-03 00:19:50,122 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 18 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1288.6ms TimeCoverageRelationStatistics Valid=147, Invalid=1113, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:19:50,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-05-03 00:19:50,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 215. [2021-05-03 00:19:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.1560975609756097) internal successors, (237), 205 states have internal predecessors, (237), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 248 transitions. [2021-05-03 00:19:50,313 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 248 transitions. Word has length 61 [2021-05-03 00:19:50,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:50,313 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 248 transitions. [2021-05-03 00:19:50,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 31 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:50,313 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 248 transitions. [2021-05-03 00:19:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:19:50,314 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:50,314 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:50,314 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable436 [2021-05-03 00:19:50,314 INFO L428 AbstractCegarLoop]: === Iteration 105 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:50,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:50,314 INFO L82 PathProgramCache]: Analyzing trace with hash -944193443, now seen corresponding path program 74 times [2021-05-03 00:19:50,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:50,314 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1577178592] [2021-05-03 00:19:50,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:50,335 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_350 v_main_~c~0_1693) (< v_main_~c~0_1693 v_~SIZE~0_345)) InVars {~SIZE~0=v_~SIZE~0_345, main_~c~0=v_main_~c~0_1693, ~last~0=v_~last~0_350} OutVars{~SIZE~0=v_~SIZE~0_345, main_~c~0=v_main_~c~0_1693, ~last~0=v_~last~0_350} AuxVars[] AssignedVars[] [2021-05-03 00:19:50,338 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:50,365 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:50,367 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:50,385 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:50,389 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:50,413 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:50,440 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1695 v_~SIZE~0_346) (< v_main_~c~0_1695 v_~last~0_351)) InVars {~SIZE~0=v_~SIZE~0_346, main_~c~0=v_main_~c~0_1695, ~last~0=v_~last~0_351} OutVars{~SIZE~0=v_~SIZE~0_346, main_~c~0=v_main_~c~0_1695, ~last~0=v_~last~0_351} AuxVars[] AssignedVars[] [2021-05-03 00:19:50,442 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:50,443 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:50,446 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:50,463 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:50,469 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:50,517 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:50,550 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:50,554 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_352 v_main_~c~0_1697) (< (+ v_main_~c~0_1697 1) v_~SIZE~0_347)) InVars {~SIZE~0=v_~SIZE~0_347, main_~c~0=v_main_~c~0_1697, ~last~0=v_~last~0_352} OutVars{~SIZE~0=v_~SIZE~0_347, main_~c~0=v_main_~c~0_1697, ~last~0=v_~last~0_352} AuxVars[] AssignedVars[] [2021-05-03 00:19:50,556 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:50,558 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:50,560 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:50,578 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:50,582 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:50,633 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:50,681 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1699 v_~last~0_353) (< (+ v_main_~c~0_1699 1) v_~SIZE~0_348)) InVars {~SIZE~0=v_~SIZE~0_348, main_~c~0=v_main_~c~0_1699, ~last~0=v_~last~0_353} OutVars{~SIZE~0=v_~SIZE~0_348, main_~c~0=v_main_~c~0_1699, ~last~0=v_~last~0_353} AuxVars[] AssignedVars[] [2021-05-03 00:19:50,684 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:50,686 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:50,689 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:50,718 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:50,730 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:50,784 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:50,813 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:51,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:51,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:51,048 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:52,466 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:52,467 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1577178592] [2021-05-03 00:19:52,467 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1577178592] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:52,467 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:52,467 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-03 00:19:52,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130398471] [2021-05-03 00:19:52,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-03 00:19:52,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:52,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-03 00:19:52,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1046, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:19:52,468 INFO L87 Difference]: Start difference. First operand 215 states and 248 transitions. Second operand has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 32 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:54,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:54,015 INFO L93 Difference]: Finished difference Result 436 states and 495 transitions. [2021-05-03 00:19:54,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:19:54,017 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 32 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:19:54,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:54,017 INFO L225 Difference]: With dead ends: 436 [2021-05-03 00:19:54,017 INFO L226 Difference]: Without dead ends: 274 [2021-05-03 00:19:54,018 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 8 SyntacticMatches, 15 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1566.7ms TimeCoverageRelationStatistics Valid=154, Invalid=1178, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:19:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-05-03 00:19:54,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 215. [2021-05-03 00:19:54,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.1560975609756097) internal successors, (237), 205 states have internal predecessors, (237), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:54,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 248 transitions. [2021-05-03 00:19:54,204 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 248 transitions. Word has length 61 [2021-05-03 00:19:54,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:54,204 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 248 transitions. [2021-05-03 00:19:54,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 32 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:54,204 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 248 transitions. [2021-05-03 00:19:54,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:19:54,205 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:54,205 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:54,205 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable441 [2021-05-03 00:19:54,205 INFO L428 AbstractCegarLoop]: === Iteration 106 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:54,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:54,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1545335519, now seen corresponding path program 75 times [2021-05-03 00:19:54,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:54,206 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1900950630] [2021-05-03 00:19:54,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:54,215 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_354 v_main_~c~0_1716) (< v_main_~c~0_1716 v_~SIZE~0_349)) InVars {~SIZE~0=v_~SIZE~0_349, main_~c~0=v_main_~c~0_1716, ~last~0=v_~last~0_354} OutVars{~SIZE~0=v_~SIZE~0_349, main_~c~0=v_main_~c~0_1716, ~last~0=v_~last~0_354} AuxVars[] AssignedVars[] [2021-05-03 00:19:54,216 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:54,232 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:54,234 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:54,244 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:54,247 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:54,262 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:54,283 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1718 v_~last~0_355) (< v_main_~c~0_1718 v_~SIZE~0_350)) InVars {~SIZE~0=v_~SIZE~0_350, main_~c~0=v_main_~c~0_1718, ~last~0=v_~last~0_355} OutVars{~SIZE~0=v_~SIZE~0_350, main_~c~0=v_main_~c~0_1718, ~last~0=v_~last~0_355} AuxVars[] AssignedVars[] [2021-05-03 00:19:54,285 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:54,297 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:54,299 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:54,311 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:54,316 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:54,330 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:54,349 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:54,351 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1720 1) v_~SIZE~0_351) (<= v_~last~0_356 v_main_~c~0_1720)) InVars {~SIZE~0=v_~SIZE~0_351, main_~c~0=v_main_~c~0_1720, ~last~0=v_~last~0_356} OutVars{~SIZE~0=v_~SIZE~0_351, main_~c~0=v_main_~c~0_1720, ~last~0=v_~last~0_356} AuxVars[] AssignedVars[] [2021-05-03 00:19:54,352 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:54,353 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:54,354 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:54,365 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:54,368 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:54,396 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:54,417 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1722 v_~last~0_357) (< (+ v_main_~c~0_1722 1) v_~SIZE~0_352)) InVars {~SIZE~0=v_~SIZE~0_352, main_~c~0=v_main_~c~0_1722, ~last~0=v_~last~0_357} OutVars{~SIZE~0=v_~SIZE~0_352, main_~c~0=v_main_~c~0_1722, ~last~0=v_~last~0_357} AuxVars[] AssignedVars[] [2021-05-03 00:19:54,419 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:54,420 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:54,421 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:54,435 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:54,439 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:54,465 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:54,487 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:54,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:54,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:54,643 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:55,833 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:55,833 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1900950630] [2021-05-03 00:19:55,833 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1900950630] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:55,833 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:55,833 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-03 00:19:55,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645930420] [2021-05-03 00:19:55,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-03 00:19:55,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:55,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-03 00:19:55,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1109, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:19:55,834 INFO L87 Difference]: Start difference. First operand 215 states and 248 transitions. Second operand has 35 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 33 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:57,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:57,729 INFO L93 Difference]: Finished difference Result 433 states and 492 transitions. [2021-05-03 00:19:57,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:19:57,730 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 33 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:19:57,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:57,731 INFO L225 Difference]: With dead ends: 433 [2021-05-03 00:19:57,731 INFO L226 Difference]: Without dead ends: 271 [2021-05-03 00:19:57,732 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 15 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1285.0ms TimeCoverageRelationStatistics Valid=161, Invalid=1245, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:19:57,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-05-03 00:19:57,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 215. [2021-05-03 00:19:57,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.1560975609756097) internal successors, (237), 205 states have internal predecessors, (237), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:19:57,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 248 transitions. [2021-05-03 00:19:57,920 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 248 transitions. Word has length 61 [2021-05-03 00:19:57,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:57,921 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 248 transitions. [2021-05-03 00:19:57,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 33 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:19:57,921 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 248 transitions. [2021-05-03 00:19:57,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:19:57,921 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:57,921 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:57,921 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable446 [2021-05-03 00:19:57,921 INFO L428 AbstractCegarLoop]: === Iteration 107 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:57,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:57,922 INFO L82 PathProgramCache]: Analyzing trace with hash 727687069, now seen corresponding path program 76 times [2021-05-03 00:19:57,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:57,922 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [606418596] [2021-05-03 00:19:57,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:57,931 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1739 v_~SIZE~0_353) (<= v_~last~0_358 v_main_~c~0_1739)) InVars {~SIZE~0=v_~SIZE~0_353, main_~c~0=v_main_~c~0_1739, ~last~0=v_~last~0_358} OutVars{~SIZE~0=v_~SIZE~0_353, main_~c~0=v_main_~c~0_1739, ~last~0=v_~last~0_358} AuxVars[] AssignedVars[] [2021-05-03 00:19:57,933 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:57,934 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:57,936 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:57,950 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:57,954 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:58,003 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:58,030 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1741 v_~SIZE~0_354) (< v_main_~c~0_1741 v_~last~0_359)) InVars {~SIZE~0=v_~SIZE~0_354, main_~c~0=v_main_~c~0_1741, ~last~0=v_~last~0_359} OutVars{~SIZE~0=v_~SIZE~0_354, main_~c~0=v_main_~c~0_1741, ~last~0=v_~last~0_359} AuxVars[] AssignedVars[] [2021-05-03 00:19:58,032 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:19:58,050 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:58,053 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:58,083 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:58,090 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:58,110 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:19:58,138 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:58,141 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1743 1) v_~SIZE~0_355) (<= v_~last~0_360 v_main_~c~0_1743)) InVars {~SIZE~0=v_~SIZE~0_355, main_~c~0=v_main_~c~0_1743, ~last~0=v_~last~0_360} OutVars{~SIZE~0=v_~SIZE~0_355, main_~c~0=v_main_~c~0_1743, ~last~0=v_~last~0_360} AuxVars[] AssignedVars[] [2021-05-03 00:19:58,143 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:19:58,166 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:58,168 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:58,183 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:58,187 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:58,210 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:19:58,232 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1745 1) v_~SIZE~0_356) (< v_main_~c~0_1745 v_~last~0_361)) InVars {~SIZE~0=v_~SIZE~0_356, main_~c~0=v_main_~c~0_1745, ~last~0=v_~last~0_361} OutVars{~SIZE~0=v_~SIZE~0_356, main_~c~0=v_main_~c~0_1745, ~last~0=v_~last~0_361} AuxVars[] AssignedVars[] [2021-05-03 00:19:58,234 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:19:58,234 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:58,236 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:58,249 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:19:58,254 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:19:58,279 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:19:58,298 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:58,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:58,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:19:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:58,450 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:59,712 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:59,713 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [606418596] [2021-05-03 00:19:59,713 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [606418596] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:59,713 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:59,713 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-03 00:19:59,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014739740] [2021-05-03 00:19:59,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-03 00:19:59,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:59,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-03 00:19:59,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1174, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:19:59,714 INFO L87 Difference]: Start difference. First operand 215 states and 248 transitions. Second operand has 36 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 34 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:01,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:01,837 INFO L93 Difference]: Finished difference Result 430 states and 489 transitions. [2021-05-03 00:20:01,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:20:01,839 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 34 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:20:01,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:01,839 INFO L225 Difference]: With dead ends: 430 [2021-05-03 00:20:01,840 INFO L226 Difference]: Without dead ends: 268 [2021-05-03 00:20:01,840 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 14 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1373.5ms TimeCoverageRelationStatistics Valid=168, Invalid=1314, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:20:01,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-05-03 00:20:02,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 215. [2021-05-03 00:20:02,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.1560975609756097) internal successors, (237), 205 states have internal predecessors, (237), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:02,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 248 transitions. [2021-05-03 00:20:02,078 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 248 transitions. Word has length 61 [2021-05-03 00:20:02,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:02,079 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 248 transitions. [2021-05-03 00:20:02,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 34 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:02,079 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 248 transitions. [2021-05-03 00:20:02,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:20:02,079 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:02,079 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:02,080 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable451 [2021-05-03 00:20:02,080 INFO L428 AbstractCegarLoop]: === Iteration 108 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:02,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:02,080 INFO L82 PathProgramCache]: Analyzing trace with hash -860660833, now seen corresponding path program 77 times [2021-05-03 00:20:02,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:02,080 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1920203560] [2021-05-03 00:20:02,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:02,095 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_362 v_main_~c~0_1762) (< v_main_~c~0_1762 v_~SIZE~0_357)) InVars {~SIZE~0=v_~SIZE~0_357, main_~c~0=v_main_~c~0_1762, ~last~0=v_~last~0_362} OutVars{~SIZE~0=v_~SIZE~0_357, main_~c~0=v_main_~c~0_1762, ~last~0=v_~last~0_362} AuxVars[] AssignedVars[] [2021-05-03 00:20:02,098 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:02,099 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:02,102 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:02,120 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:02,125 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:02,170 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:02,204 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1764 v_~SIZE~0_358) (< v_main_~c~0_1764 v_~last~0_363)) InVars {~SIZE~0=v_~SIZE~0_358, main_~c~0=v_main_~c~0_1764, ~last~0=v_~last~0_363} OutVars{~SIZE~0=v_~SIZE~0_358, main_~c~0=v_main_~c~0_1764, ~last~0=v_~last~0_363} AuxVars[] AssignedVars[] [2021-05-03 00:20:02,206 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:02,207 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:02,209 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:02,229 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:02,236 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:02,278 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:02,309 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:02,313 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_364 v_main_~c~0_1766) (< (+ v_main_~c~0_1766 1) v_~SIZE~0_359)) InVars {~SIZE~0=v_~SIZE~0_359, main_~c~0=v_main_~c~0_1766, ~last~0=v_~last~0_364} OutVars{~SIZE~0=v_~SIZE~0_359, main_~c~0=v_main_~c~0_1766, ~last~0=v_~last~0_364} AuxVars[] AssignedVars[] [2021-05-03 00:20:02,315 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:20:02,340 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:02,342 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:02,358 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:02,362 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:02,387 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:20:02,416 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1768 1) v_~SIZE~0_360) (< v_main_~c~0_1768 v_~last~0_365)) InVars {~SIZE~0=v_~SIZE~0_360, main_~c~0=v_main_~c~0_1768, ~last~0=v_~last~0_365} OutVars{~SIZE~0=v_~SIZE~0_360, main_~c~0=v_main_~c~0_1768, ~last~0=v_~last~0_365} AuxVars[] AssignedVars[] [2021-05-03 00:20:02,418 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:02,420 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:02,422 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:02,444 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:02,451 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:02,489 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:02,520 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:02,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:02,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:02,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:02,752 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:04,675 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:04,675 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1920203560] [2021-05-03 00:20:04,675 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1920203560] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:04,676 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:04,676 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-03 00:20:04,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544103975] [2021-05-03 00:20:04,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-03 00:20:04,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:04,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-03 00:20:04,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1241, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:20:04,677 INFO L87 Difference]: Start difference. First operand 215 states and 248 transitions. Second operand has 37 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 35 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:07,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:07,040 INFO L93 Difference]: Finished difference Result 427 states and 486 transitions. [2021-05-03 00:20:07,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-03 00:20:07,042 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 35 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:20:07,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:07,043 INFO L225 Difference]: With dead ends: 427 [2021-05-03 00:20:07,043 INFO L226 Difference]: Without dead ends: 265 [2021-05-03 00:20:07,044 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 14 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 2062.5ms TimeCoverageRelationStatistics Valid=175, Invalid=1385, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:20:07,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-05-03 00:20:07,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 215. [2021-05-03 00:20:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.1560975609756097) internal successors, (237), 205 states have internal predecessors, (237), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 248 transitions. [2021-05-03 00:20:07,262 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 248 transitions. Word has length 61 [2021-05-03 00:20:07,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:07,262 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 248 transitions. [2021-05-03 00:20:07,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 35 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:07,262 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 248 transitions. [2021-05-03 00:20:07,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:20:07,263 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:07,263 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 12, 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-03 00:20:07,263 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable456 [2021-05-03 00:20:07,263 INFO L428 AbstractCegarLoop]: === Iteration 109 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:07,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:07,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1871778083, now seen corresponding path program 78 times [2021-05-03 00:20:07,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:07,263 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [727347505] [2021-05-03 00:20:07,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:07,273 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_366 v_main_~c~0_1785) (< v_main_~c~0_1785 v_~SIZE~0_361)) InVars {~SIZE~0=v_~SIZE~0_361, main_~c~0=v_main_~c~0_1785, ~last~0=v_~last~0_366} OutVars{~SIZE~0=v_~SIZE~0_361, main_~c~0=v_main_~c~0_1785, ~last~0=v_~last~0_366} AuxVars[] AssignedVars[] [2021-05-03 00:20:07,275 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:07,302 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:07,305 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:07,321 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:07,325 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:07,350 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:07,380 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1787 v_~last~0_367) (< v_main_~c~0_1787 v_~SIZE~0_362)) InVars {~SIZE~0=v_~SIZE~0_362, main_~c~0=v_main_~c~0_1787, ~last~0=v_~last~0_367} OutVars{~SIZE~0=v_~SIZE~0_362, main_~c~0=v_main_~c~0_1787, ~last~0=v_~last~0_367} AuxVars[] AssignedVars[] [2021-05-03 00:20:07,383 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:07,404 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:07,406 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:07,425 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:07,432 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:07,455 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:07,482 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:07,484 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1789 v_~last~0_368) (< (+ v_main_~c~0_1789 1) v_~SIZE~0_363)) InVars {~SIZE~0=v_~SIZE~0_363, main_~c~0=v_main_~c~0_1789, ~last~0=v_~last~0_368} OutVars{~SIZE~0=v_~SIZE~0_363, main_~c~0=v_main_~c~0_1789, ~last~0=v_~last~0_368} AuxVars[] AssignedVars[] [2021-05-03 00:20:07,486 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:07,504 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:07,507 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:07,525 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:07,534 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:07,555 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:07,581 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:07,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:07,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:07,812 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:09,602 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:09,603 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [727347505] [2021-05-03 00:20:09,603 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [727347505] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:09,603 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:09,603 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-03 00:20:09,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588258310] [2021-05-03 00:20:09,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-03 00:20:09,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:09,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-03 00:20:09,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1310, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:20:09,604 INFO L87 Difference]: Start difference. First operand 215 states and 248 transitions. Second operand has 38 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 36 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:11,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:11,313 INFO L93 Difference]: Finished difference Result 426 states and 486 transitions. [2021-05-03 00:20:11,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-03 00:20:11,315 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 36 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:20:11,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:11,316 INFO L225 Difference]: With dead ends: 426 [2021-05-03 00:20:11,316 INFO L226 Difference]: Without dead ends: 264 [2021-05-03 00:20:11,317 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 13 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1929.1ms TimeCoverageRelationStatistics Valid=182, Invalid=1458, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:20:11,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-05-03 00:20:11,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 216. [2021-05-03 00:20:11,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 206 states have (on average 1.1601941747572815) internal successors, (239), 206 states have internal predecessors, (239), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:11,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 250 transitions. [2021-05-03 00:20:11,504 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 250 transitions. Word has length 61 [2021-05-03 00:20:11,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:11,504 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 250 transitions. [2021-05-03 00:20:11,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 36 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:11,504 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 250 transitions. [2021-05-03 00:20:11,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:20:11,505 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:11,505 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:11,505 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable460 [2021-05-03 00:20:11,505 INFO L428 AbstractCegarLoop]: === Iteration 110 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:11,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:11,505 INFO L82 PathProgramCache]: Analyzing trace with hash -2037318433, now seen corresponding path program 13 times [2021-05-03 00:20:11,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:11,506 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2143696452] [2021-05-03 00:20:11,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:11,513 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1806 v_~SIZE~0_364) (< v_main_~c~0_1806 v_~last~0_369)) InVars {~SIZE~0=v_~SIZE~0_364, main_~c~0=v_main_~c~0_1806, ~last~0=v_~last~0_369} OutVars{~SIZE~0=v_~SIZE~0_364, main_~c~0=v_main_~c~0_1806, ~last~0=v_~last~0_369} AuxVars[] AssignedVars[] [2021-05-03 00:20:11,514 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:11,515 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:11,516 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:11,530 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:11,535 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:11,563 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:11,582 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:11,584 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1808 1) v_~SIZE~0_365) (< v_main_~c~0_1808 v_~last~0_370)) InVars {~SIZE~0=v_~SIZE~0_365, main_~c~0=v_main_~c~0_1808, ~last~0=v_~last~0_370} OutVars{~SIZE~0=v_~SIZE~0_365, main_~c~0=v_main_~c~0_1808, ~last~0=v_~last~0_370} AuxVars[] AssignedVars[] [2021-05-03 00:20:11,586 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:11,604 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:11,606 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:11,619 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:11,624 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:11,642 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:11,661 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:11,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:11,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:13,030 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:13,030 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2143696452] [2021-05-03 00:20:13,031 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2143696452] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:13,031 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:13,031 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-03 00:20:13,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281797055] [2021-05-03 00:20:13,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-03 00:20:13,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:13,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-03 00:20:13,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1374, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:20:13,032 INFO L87 Difference]: Start difference. First operand 216 states and 250 transitions. Second operand has 38 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 36 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:15,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:15,198 INFO L93 Difference]: Finished difference Result 438 states and 499 transitions. [2021-05-03 00:20:15,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-05-03 00:20:15,200 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 36 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-05-03 00:20:15,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:15,200 INFO L225 Difference]: With dead ends: 438 [2021-05-03 00:20:15,201 INFO L226 Difference]: Without dead ends: 276 [2021-05-03 00:20:15,201 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 6 SyntacticMatches, 12 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 1887.1ms TimeCoverageRelationStatistics Valid=300, Invalid=2670, Unknown=0, NotChecked=0, Total=2970 [2021-05-03 00:20:15,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-05-03 00:20:15,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 218. [2021-05-03 00:20:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 208 states have (on average 1.1586538461538463) internal successors, (241), 208 states have internal predecessors, (241), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 252 transitions. [2021-05-03 00:20:15,395 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 252 transitions. Word has length 61 [2021-05-03 00:20:15,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:15,395 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 252 transitions. [2021-05-03 00:20:15,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 36 states have internal predecessors, (55), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:15,395 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 252 transitions. [2021-05-03 00:20:15,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:20:15,396 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:15,396 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:15,396 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable463 [2021-05-03 00:20:15,396 INFO L428 AbstractCegarLoop]: === Iteration 111 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:15,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:15,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1565519746, now seen corresponding path program 14 times [2021-05-03 00:20:15,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:15,397 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [193760421] [2021-05-03 00:20:15,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:15,403 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1824 v_~SIZE~0_366) (<= v_~last~0_371 v_main_~c~0_1824)) InVars {~SIZE~0=v_~SIZE~0_366, main_~c~0=v_main_~c~0_1824, ~last~0=v_~last~0_371} OutVars{~SIZE~0=v_~SIZE~0_366, main_~c~0=v_main_~c~0_1824, ~last~0=v_~last~0_371} AuxVars[] AssignedVars[] [2021-05-03 00:20:15,405 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:15,422 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:15,424 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:15,436 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:15,439 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:15,458 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:15,480 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:15,482 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1826 1) v_~SIZE~0_367) (<= v_~last~0_372 v_main_~c~0_1826)) InVars {~SIZE~0=v_~SIZE~0_367, main_~c~0=v_main_~c~0_1826, ~last~0=v_~last~0_372} OutVars{~SIZE~0=v_~SIZE~0_367, main_~c~0=v_main_~c~0_1826, ~last~0=v_~last~0_372} AuxVars[] AssignedVars[] [2021-05-03 00:20:15,485 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:20:15,505 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:15,507 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:15,519 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:15,522 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:15,540 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:20:15,561 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:15,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:15,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:15,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:16,817 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:16,817 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [193760421] [2021-05-03 00:20:16,817 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [193760421] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:16,817 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:16,817 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:20:16,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235170910] [2021-05-03 00:20:16,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:20:16,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:16,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:20:16,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:20:16,818 INFO L87 Difference]: Start difference. First operand 218 states and 252 transitions. Second operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 25 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:18,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:18,164 INFO L93 Difference]: Finished difference Result 463 states and 523 transitions. [2021-05-03 00:20:18,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:20:18,166 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 25 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:20:18,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:18,167 INFO L225 Difference]: With dead ends: 463 [2021-05-03 00:20:18,167 INFO L226 Difference]: Without dead ends: 301 [2021-05-03 00:20:18,168 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 6 SyntacticMatches, 27 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1201.5ms TimeCoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:20:18,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-05-03 00:20:18,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 221. [2021-05-03 00:20:18,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 211 states have (on average 1.1563981042654028) internal successors, (244), 211 states have internal predecessors, (244), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 255 transitions. [2021-05-03 00:20:18,401 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 255 transitions. Word has length 64 [2021-05-03 00:20:18,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:18,401 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 255 transitions. [2021-05-03 00:20:18,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 25 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:18,401 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 255 transitions. [2021-05-03 00:20:18,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:20:18,401 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:18,401 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 13, 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-03 00:20:18,401 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable466 [2021-05-03 00:20:18,402 INFO L428 AbstractCegarLoop]: === Iteration 112 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:18,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:18,402 INFO L82 PathProgramCache]: Analyzing trace with hash -2046600004, now seen corresponding path program 79 times [2021-05-03 00:20:18,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:18,402 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1671384771] [2021-05-03 00:20:18,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:18,415 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1843 v_~SIZE~0_368) (<= v_~last~0_373 v_main_~c~0_1843)) InVars {~SIZE~0=v_~SIZE~0_368, main_~c~0=v_main_~c~0_1843, ~last~0=v_~last~0_373} OutVars{~SIZE~0=v_~SIZE~0_368, main_~c~0=v_main_~c~0_1843, ~last~0=v_~last~0_373} AuxVars[] AssignedVars[] [2021-05-03 00:20:18,418 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:18,444 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:18,446 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:18,462 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:18,465 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:18,486 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:18,521 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1845 v_~last~0_374) (< v_main_~c~0_1845 v_~SIZE~0_369)) InVars {~SIZE~0=v_~SIZE~0_369, main_~c~0=v_main_~c~0_1845, ~last~0=v_~last~0_374} OutVars{~SIZE~0=v_~SIZE~0_369, main_~c~0=v_main_~c~0_1845, ~last~0=v_~last~0_374} AuxVars[] AssignedVars[] [2021-05-03 00:20:18,523 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:18,524 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:18,526 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:18,546 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:18,554 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:18,592 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:18,615 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:18,617 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_375 v_main_~c~0_1847) (< (+ v_main_~c~0_1847 1) v_~SIZE~0_370)) InVars {~SIZE~0=v_~SIZE~0_370, main_~c~0=v_main_~c~0_1847, ~last~0=v_~last~0_375} OutVars{~SIZE~0=v_~SIZE~0_370, main_~c~0=v_main_~c~0_1847, ~last~0=v_~last~0_375} AuxVars[] AssignedVars[] [2021-05-03 00:20:18,620 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:20:18,639 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:18,641 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:18,653 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:18,657 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:18,676 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:20:18,702 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1849 v_~last~0_376) (< (+ v_main_~c~0_1849 1) v_~SIZE~0_371)) InVars {~SIZE~0=v_~SIZE~0_371, main_~c~0=v_main_~c~0_1849, ~last~0=v_~last~0_376} OutVars{~SIZE~0=v_~SIZE~0_371, main_~c~0=v_main_~c~0_1849, ~last~0=v_~last~0_376} AuxVars[] AssignedVars[] [2021-05-03 00:20:18,704 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:18,720 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:18,722 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:18,740 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:18,745 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:18,763 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:18,788 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:18,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:18,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:18,996 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:20,193 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:20,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1671384771] [2021-05-03 00:20:20,194 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1671384771] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:20,194 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:20,194 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:20:20,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535991807] [2021-05-03 00:20:20,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:20:20,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:20,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:20:20,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:20:20,195 INFO L87 Difference]: Start difference. First operand 221 states and 255 transitions. Second operand has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 26 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:21,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:21,688 INFO L93 Difference]: Finished difference Result 466 states and 526 transitions. [2021-05-03 00:20:21,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:20:21,689 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 26 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:20:21,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:21,690 INFO L225 Difference]: With dead ends: 466 [2021-05-03 00:20:21,690 INFO L226 Difference]: Without dead ends: 304 [2021-05-03 00:20:21,691 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 6 SyntacticMatches, 26 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1334.8ms TimeCoverageRelationStatistics Valid=109, Invalid=821, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:20:21,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-05-03 00:20:21,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 221. [2021-05-03 00:20:21,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 211 states have (on average 1.1563981042654028) internal successors, (244), 211 states have internal predecessors, (244), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:21,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 255 transitions. [2021-05-03 00:20:21,921 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 255 transitions. Word has length 64 [2021-05-03 00:20:21,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:21,921 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 255 transitions. [2021-05-03 00:20:21,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 26 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:21,921 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 255 transitions. [2021-05-03 00:20:21,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:20:21,921 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:21,921 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:21,922 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable471 [2021-05-03 00:20:21,922 INFO L428 AbstractCegarLoop]: === Iteration 113 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:21,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:21,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1895278910, now seen corresponding path program 80 times [2021-05-03 00:20:21,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:21,922 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [99529496] [2021-05-03 00:20:21,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:21,932 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1867 v_~SIZE~0_372) (<= v_~last~0_377 v_main_~c~0_1867)) InVars {~SIZE~0=v_~SIZE~0_372, main_~c~0=v_main_~c~0_1867, ~last~0=v_~last~0_377} OutVars{~SIZE~0=v_~SIZE~0_372, main_~c~0=v_main_~c~0_1867, ~last~0=v_~last~0_377} AuxVars[] AssignedVars[] [2021-05-03 00:20:21,934 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:21,935 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:21,938 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:21,954 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:21,957 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:22,005 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:22,038 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1869 v_~SIZE~0_373) (< v_main_~c~0_1869 v_~last~0_378)) InVars {~SIZE~0=v_~SIZE~0_373, main_~c~0=v_main_~c~0_1869, ~last~0=v_~last~0_378} OutVars{~SIZE~0=v_~SIZE~0_373, main_~c~0=v_main_~c~0_1869, ~last~0=v_~last~0_378} AuxVars[] AssignedVars[] [2021-05-03 00:20:22,041 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:22,042 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:22,044 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:22,068 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:22,076 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:22,119 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:22,158 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:22,161 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1871 1) v_~SIZE~0_374) (<= v_~last~0_379 v_main_~c~0_1871)) InVars {~SIZE~0=v_~SIZE~0_374, main_~c~0=v_main_~c~0_1871, ~last~0=v_~last~0_379} OutVars{~SIZE~0=v_~SIZE~0_374, main_~c~0=v_main_~c~0_1871, ~last~0=v_~last~0_379} AuxVars[] AssignedVars[] [2021-05-03 00:20:22,164 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:20:22,165 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:22,168 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:22,182 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:22,186 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:22,233 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:20:22,266 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1873 1) v_~SIZE~0_375) (< v_main_~c~0_1873 v_~last~0_380)) InVars {~SIZE~0=v_~SIZE~0_375, main_~c~0=v_main_~c~0_1873, ~last~0=v_~last~0_380} OutVars{~SIZE~0=v_~SIZE~0_375, main_~c~0=v_main_~c~0_1873, ~last~0=v_~last~0_380} AuxVars[] AssignedVars[] [2021-05-03 00:20:22,269 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:22,271 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:22,275 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:22,307 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:22,318 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:22,373 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:22,405 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:22,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:22,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:22,581 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:23,937 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:23,937 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [99529496] [2021-05-03 00:20:23,937 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [99529496] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:23,937 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:23,937 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:20:23,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215169047] [2021-05-03 00:20:23,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:20:23,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:23,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:20:23,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:20:23,938 INFO L87 Difference]: Start difference. First operand 221 states and 255 transitions. Second operand has 29 states, 29 states have (on average 2.0) internal successors, (58), 27 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:25,841 INFO L93 Difference]: Finished difference Result 463 states and 523 transitions. [2021-05-03 00:20:25,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:20:25,842 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 27 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:20:25,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:25,843 INFO L225 Difference]: With dead ends: 463 [2021-05-03 00:20:25,843 INFO L226 Difference]: Without dead ends: 301 [2021-05-03 00:20:25,844 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 6 SyntacticMatches, 25 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1467.8ms TimeCoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:20:25,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-05-03 00:20:26,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 221. [2021-05-03 00:20:26,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 211 states have (on average 1.1563981042654028) internal successors, (244), 211 states have internal predecessors, (244), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 255 transitions. [2021-05-03 00:20:26,076 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 255 transitions. Word has length 64 [2021-05-03 00:20:26,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:26,076 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 255 transitions. [2021-05-03 00:20:26,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 2.0) internal successors, (58), 27 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:26,076 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 255 transitions. [2021-05-03 00:20:26,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:20:26,076 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:26,076 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:26,076 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable476 [2021-05-03 00:20:26,076 INFO L428 AbstractCegarLoop]: === Iteration 114 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:26,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:26,077 INFO L82 PathProgramCache]: Analyzing trace with hash -154108932, now seen corresponding path program 81 times [2021-05-03 00:20:26,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:26,077 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2051624885] [2021-05-03 00:20:26,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:26,087 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1891 v_~SIZE~0_376) (<= v_~last~0_381 v_main_~c~0_1891)) InVars {~SIZE~0=v_~SIZE~0_376, main_~c~0=v_main_~c~0_1891, ~last~0=v_~last~0_381} OutVars{~SIZE~0=v_~SIZE~0_376, main_~c~0=v_main_~c~0_1891, ~last~0=v_~last~0_381} AuxVars[] AssignedVars[] [2021-05-03 00:20:26,089 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:26,109 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:26,111 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:26,122 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:26,126 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:26,145 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:26,169 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1893 v_~SIZE~0_377) (< v_main_~c~0_1893 v_~last~0_382)) InVars {~SIZE~0=v_~SIZE~0_377, main_~c~0=v_main_~c~0_1893, ~last~0=v_~last~0_382} OutVars{~SIZE~0=v_~SIZE~0_377, main_~c~0=v_main_~c~0_1893, ~last~0=v_~last~0_382} AuxVars[] AssignedVars[] [2021-05-03 00:20:26,171 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:26,172 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:26,174 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:26,192 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:26,198 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:26,230 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:26,253 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:26,256 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_383 v_main_~c~0_1895) (< (+ v_main_~c~0_1895 1) v_~SIZE~0_378)) InVars {~SIZE~0=v_~SIZE~0_378, main_~c~0=v_main_~c~0_1895, ~last~0=v_~last~0_383} OutVars{~SIZE~0=v_~SIZE~0_378, main_~c~0=v_main_~c~0_1895, ~last~0=v_~last~0_383} AuxVars[] AssignedVars[] [2021-05-03 00:20:26,259 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:20:26,261 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:26,262 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:26,274 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:26,278 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:26,313 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:20:26,335 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1897 v_~last~0_384) (< (+ v_main_~c~0_1897 1) v_~SIZE~0_379)) InVars {~SIZE~0=v_~SIZE~0_379, main_~c~0=v_main_~c~0_1897, ~last~0=v_~last~0_384} OutVars{~SIZE~0=v_~SIZE~0_379, main_~c~0=v_main_~c~0_1897, ~last~0=v_~last~0_384} AuxVars[] AssignedVars[] [2021-05-03 00:20:26,337 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:26,351 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:26,352 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:26,367 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:26,372 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:26,387 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:26,410 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:26,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:26,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:26,578 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:27,731 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:27,731 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2051624885] [2021-05-03 00:20:27,731 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2051624885] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:27,731 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:27,731 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:20:27,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535323399] [2021-05-03 00:20:27,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:20:27,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:27,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:20:27,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:20:27,732 INFO L87 Difference]: Start difference. First operand 221 states and 255 transitions. Second operand has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 28 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:29,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:29,153 INFO L93 Difference]: Finished difference Result 460 states and 520 transitions. [2021-05-03 00:20:29,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:20:29,154 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 28 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:20:29,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:29,155 INFO L225 Difference]: With dead ends: 460 [2021-05-03 00:20:29,155 INFO L226 Difference]: Without dead ends: 298 [2021-05-03 00:20:29,156 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 6 SyntacticMatches, 24 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1247.2ms TimeCoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:20:29,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-05-03 00:20:29,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 221. [2021-05-03 00:20:29,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 211 states have (on average 1.1563981042654028) internal successors, (244), 211 states have internal predecessors, (244), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:29,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 255 transitions. [2021-05-03 00:20:29,368 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 255 transitions. Word has length 64 [2021-05-03 00:20:29,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:29,368 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 255 transitions. [2021-05-03 00:20:29,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 28 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:29,368 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 255 transitions. [2021-05-03 00:20:29,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:20:29,369 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:29,369 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:29,369 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable481 [2021-05-03 00:20:29,369 INFO L428 AbstractCegarLoop]: === Iteration 115 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:29,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:29,370 INFO L82 PathProgramCache]: Analyzing trace with hash 269537790, now seen corresponding path program 82 times [2021-05-03 00:20:29,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:29,370 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1836704516] [2021-05-03 00:20:29,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:29,386 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_385 v_main_~c~0_1915) (< v_main_~c~0_1915 v_~SIZE~0_380)) InVars {~SIZE~0=v_~SIZE~0_380, main_~c~0=v_main_~c~0_1915, ~last~0=v_~last~0_385} OutVars{~SIZE~0=v_~SIZE~0_380, main_~c~0=v_main_~c~0_1915, ~last~0=v_~last~0_385} AuxVars[] AssignedVars[] [2021-05-03 00:20:29,388 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:29,389 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:29,391 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:29,402 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:29,405 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:29,434 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:29,460 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1917 v_~last~0_386) (< v_main_~c~0_1917 v_~SIZE~0_381)) InVars {~SIZE~0=v_~SIZE~0_381, main_~c~0=v_main_~c~0_1917, ~last~0=v_~last~0_386} OutVars{~SIZE~0=v_~SIZE~0_381, main_~c~0=v_main_~c~0_1917, ~last~0=v_~last~0_386} AuxVars[] AssignedVars[] [2021-05-03 00:20:29,462 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:29,482 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:29,484 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:29,503 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:29,510 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:29,528 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:29,552 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:29,554 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1919 1) v_~SIZE~0_382) (<= v_~last~0_387 v_main_~c~0_1919)) InVars {~SIZE~0=v_~SIZE~0_382, main_~c~0=v_main_~c~0_1919, ~last~0=v_~last~0_387} OutVars{~SIZE~0=v_~SIZE~0_382, main_~c~0=v_main_~c~0_1919, ~last~0=v_~last~0_387} AuxVars[] AssignedVars[] [2021-05-03 00:20:29,556 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:20:29,577 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:29,580 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:29,595 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:29,599 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:29,623 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:20:29,655 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1921 v_~last~0_388) (< (+ v_main_~c~0_1921 1) v_~SIZE~0_383)) InVars {~SIZE~0=v_~SIZE~0_383, main_~c~0=v_main_~c~0_1921, ~last~0=v_~last~0_388} OutVars{~SIZE~0=v_~SIZE~0_383, main_~c~0=v_main_~c~0_1921, ~last~0=v_~last~0_388} AuxVars[] AssignedVars[] [2021-05-03 00:20:29,658 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:29,676 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:29,678 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:29,697 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:29,704 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:29,723 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:29,748 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:29,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:29,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:29,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:29,985 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:31,709 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:31,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1836704516] [2021-05-03 00:20:31,709 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1836704516] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:31,709 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:31,709 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:20:31,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659178835] [2021-05-03 00:20:31,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:20:31,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:31,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:20:31,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:20:31,710 INFO L87 Difference]: Start difference. First operand 221 states and 255 transitions. Second operand has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 29 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:33,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:33,455 INFO L93 Difference]: Finished difference Result 457 states and 517 transitions. [2021-05-03 00:20:33,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:20:33,456 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 29 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:20:33,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:33,457 INFO L225 Difference]: With dead ends: 457 [2021-05-03 00:20:33,457 INFO L226 Difference]: Without dead ends: 295 [2021-05-03 00:20:33,457 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 7 SyntacticMatches, 22 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1866.8ms TimeCoverageRelationStatistics Valid=130, Invalid=992, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:20:33,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-05-03 00:20:33,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 221. [2021-05-03 00:20:33,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 211 states have (on average 1.1563981042654028) internal successors, (244), 211 states have internal predecessors, (244), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:33,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 255 transitions. [2021-05-03 00:20:33,673 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 255 transitions. Word has length 64 [2021-05-03 00:20:33,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:33,673 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 255 transitions. [2021-05-03 00:20:33,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 29 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:33,673 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 255 transitions. [2021-05-03 00:20:33,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:20:33,673 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:33,673 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:33,674 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable486 [2021-05-03 00:20:33,674 INFO L428 AbstractCegarLoop]: === Iteration 116 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:33,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:33,674 INFO L82 PathProgramCache]: Analyzing trace with hash -759821508, now seen corresponding path program 83 times [2021-05-03 00:20:33,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:33,674 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [735312443] [2021-05-03 00:20:33,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:33,689 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1939 v_~SIZE~0_384) (<= v_~last~0_389 v_main_~c~0_1939)) InVars {~SIZE~0=v_~SIZE~0_384, main_~c~0=v_main_~c~0_1939, ~last~0=v_~last~0_389} OutVars{~SIZE~0=v_~SIZE~0_384, main_~c~0=v_main_~c~0_1939, ~last~0=v_~last~0_389} AuxVars[] AssignedVars[] [2021-05-03 00:20:33,691 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:33,692 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:33,693 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:33,702 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:33,705 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:33,732 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:33,752 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1941 v_~last~0_390) (< v_main_~c~0_1941 v_~SIZE~0_385)) InVars {~SIZE~0=v_~SIZE~0_385, main_~c~0=v_main_~c~0_1941, ~last~0=v_~last~0_390} OutVars{~SIZE~0=v_~SIZE~0_385, main_~c~0=v_main_~c~0_1941, ~last~0=v_~last~0_390} AuxVars[] AssignedVars[] [2021-05-03 00:20:33,754 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:33,766 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:33,767 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:33,779 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:33,784 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:33,797 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:33,818 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:33,820 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1943 1) v_~SIZE~0_386) (<= v_~last~0_391 v_main_~c~0_1943)) InVars {~SIZE~0=v_~SIZE~0_386, main_~c~0=v_main_~c~0_1943, ~last~0=v_~last~0_391} OutVars{~SIZE~0=v_~SIZE~0_386, main_~c~0=v_main_~c~0_1943, ~last~0=v_~last~0_391} AuxVars[] AssignedVars[] [2021-05-03 00:20:33,821 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:20:33,837 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:33,838 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:33,848 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:33,851 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:33,866 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:20:33,895 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1945 v_~last~0_392) (< (+ v_main_~c~0_1945 1) v_~SIZE~0_387)) InVars {~SIZE~0=v_~SIZE~0_387, main_~c~0=v_main_~c~0_1945, ~last~0=v_~last~0_392} OutVars{~SIZE~0=v_~SIZE~0_387, main_~c~0=v_main_~c~0_1945, ~last~0=v_~last~0_392} AuxVars[] AssignedVars[] [2021-05-03 00:20:33,897 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:33,898 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:33,899 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:33,911 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:33,916 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:33,940 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:33,959 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:34,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:34,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:34,134 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:36,154 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:36,154 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [735312443] [2021-05-03 00:20:36,154 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [735312443] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:36,154 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:36,154 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:20:36,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079849682] [2021-05-03 00:20:36,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:20:36,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:36,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:20:36,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=929, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:20:36,155 INFO L87 Difference]: Start difference. First operand 221 states and 255 transitions. Second operand has 32 states, 32 states have (on average 1.8125) internal successors, (58), 30 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:38,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:38,174 INFO L93 Difference]: Finished difference Result 454 states and 514 transitions. [2021-05-03 00:20:38,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:20:38,175 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.8125) internal successors, (58), 30 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:20:38,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:38,176 INFO L225 Difference]: With dead ends: 454 [2021-05-03 00:20:38,176 INFO L226 Difference]: Without dead ends: 292 [2021-05-03 00:20:38,176 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 6 SyntacticMatches, 22 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 2098.9ms TimeCoverageRelationStatistics Valid=137, Invalid=1053, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:20:38,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-05-03 00:20:38,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 221. [2021-05-03 00:20:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 211 states have (on average 1.1563981042654028) internal successors, (244), 211 states have internal predecessors, (244), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 255 transitions. [2021-05-03 00:20:38,404 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 255 transitions. Word has length 64 [2021-05-03 00:20:38,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:38,404 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 255 transitions. [2021-05-03 00:20:38,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 1.8125) internal successors, (58), 30 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:38,404 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 255 transitions. [2021-05-03 00:20:38,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:20:38,406 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:38,406 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:38,407 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable491 [2021-05-03 00:20:38,407 INFO L428 AbstractCegarLoop]: === Iteration 117 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:38,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:38,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1603827010, now seen corresponding path program 84 times [2021-05-03 00:20:38,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:38,407 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1129338003] [2021-05-03 00:20:38,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:38,429 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1963 v_~SIZE~0_388) (<= v_~last~0_393 v_main_~c~0_1963)) InVars {~SIZE~0=v_~SIZE~0_388, main_~c~0=v_main_~c~0_1963, ~last~0=v_~last~0_393} OutVars{~SIZE~0=v_~SIZE~0_388, main_~c~0=v_main_~c~0_1963, ~last~0=v_~last~0_393} AuxVars[] AssignedVars[] [2021-05-03 00:20:38,432 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:38,455 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:38,457 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:38,478 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:38,482 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:38,502 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:38,529 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1965 v_~last~0_394) (< v_main_~c~0_1965 v_~SIZE~0_389)) InVars {~SIZE~0=v_~SIZE~0_389, main_~c~0=v_main_~c~0_1965, ~last~0=v_~last~0_394} OutVars{~SIZE~0=v_~SIZE~0_389, main_~c~0=v_main_~c~0_1965, ~last~0=v_~last~0_394} AuxVars[] AssignedVars[] [2021-05-03 00:20:38,531 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:38,532 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:38,534 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:38,551 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:38,558 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:38,589 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:38,613 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:38,615 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1967 1) v_~SIZE~0_390) (<= v_~last~0_395 v_main_~c~0_1967)) InVars {~SIZE~0=v_~SIZE~0_390, main_~c~0=v_main_~c~0_1967, ~last~0=v_~last~0_395} OutVars{~SIZE~0=v_~SIZE~0_390, main_~c~0=v_main_~c~0_1967, ~last~0=v_~last~0_395} AuxVars[] AssignedVars[] [2021-05-03 00:20:38,617 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:20:38,633 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:38,635 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:38,646 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:38,648 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:38,664 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:20:38,686 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1969 1) v_~SIZE~0_391) (< v_main_~c~0_1969 v_~last~0_396)) InVars {~SIZE~0=v_~SIZE~0_391, main_~c~0=v_main_~c~0_1969, ~last~0=v_~last~0_396} OutVars{~SIZE~0=v_~SIZE~0_391, main_~c~0=v_main_~c~0_1969, ~last~0=v_~last~0_396} AuxVars[] AssignedVars[] [2021-05-03 00:20:38,687 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:38,688 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:38,689 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:38,703 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:38,708 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:38,733 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:38,754 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:38,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:38,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:38,939 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:40,414 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:40,415 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1129338003] [2021-05-03 00:20:40,415 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1129338003] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:40,415 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:40,415 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:20:40,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419253708] [2021-05-03 00:20:40,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:20:40,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:40,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:20:40,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:20:40,416 INFO L87 Difference]: Start difference. First operand 221 states and 255 transitions. Second operand has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 31 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:41,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:41,982 INFO L93 Difference]: Finished difference Result 451 states and 511 transitions. [2021-05-03 00:20:41,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:20:41,984 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 31 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:20:41,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:41,984 INFO L225 Difference]: With dead ends: 451 [2021-05-03 00:20:41,984 INFO L226 Difference]: Without dead ends: 289 [2021-05-03 00:20:41,985 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 7 SyntacticMatches, 20 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1577.6ms TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:20:41,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-05-03 00:20:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 221. [2021-05-03 00:20:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 211 states have (on average 1.1563981042654028) internal successors, (244), 211 states have internal predecessors, (244), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:42,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 255 transitions. [2021-05-03 00:20:42,214 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 255 transitions. Word has length 64 [2021-05-03 00:20:42,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:42,214 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 255 transitions. [2021-05-03 00:20:42,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 31 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:42,214 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 255 transitions. [2021-05-03 00:20:42,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:20:42,215 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:42,215 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:42,215 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable496 [2021-05-03 00:20:42,215 INFO L428 AbstractCegarLoop]: === Iteration 118 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:42,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:42,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1329067396, now seen corresponding path program 85 times [2021-05-03 00:20:42,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:42,216 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1264225159] [2021-05-03 00:20:42,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:42,227 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1987 v_~SIZE~0_392) (<= v_~last~0_397 v_main_~c~0_1987)) InVars {~SIZE~0=v_~SIZE~0_392, main_~c~0=v_main_~c~0_1987, ~last~0=v_~last~0_397} OutVars{~SIZE~0=v_~SIZE~0_392, main_~c~0=v_main_~c~0_1987, ~last~0=v_~last~0_397} AuxVars[] AssignedVars[] [2021-05-03 00:20:42,229 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:42,247 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:42,248 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:42,260 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:42,263 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:42,281 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:42,303 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_1989 v_~SIZE~0_393) (< v_main_~c~0_1989 v_~last~0_398)) InVars {~SIZE~0=v_~SIZE~0_393, main_~c~0=v_main_~c~0_1989, ~last~0=v_~last~0_398} OutVars{~SIZE~0=v_~SIZE~0_393, main_~c~0=v_main_~c~0_1989, ~last~0=v_~last~0_398} AuxVars[] AssignedVars[] [2021-05-03 00:20:42,305 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:42,306 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:42,307 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:42,322 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:42,327 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:42,353 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:42,373 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:42,376 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1991 1) v_~SIZE~0_394) (<= v_~last~0_399 v_main_~c~0_1991)) InVars {~SIZE~0=v_~SIZE~0_394, main_~c~0=v_main_~c~0_1991, ~last~0=v_~last~0_399} OutVars{~SIZE~0=v_~SIZE~0_394, main_~c~0=v_main_~c~0_1991, ~last~0=v_~last~0_399} AuxVars[] AssignedVars[] [2021-05-03 00:20:42,381 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:20:42,382 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:42,383 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:42,394 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:42,397 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:42,426 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:20:42,455 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_1993 1) v_~SIZE~0_395) (< v_main_~c~0_1993 v_~last~0_400)) InVars {~SIZE~0=v_~SIZE~0_395, main_~c~0=v_main_~c~0_1993, ~last~0=v_~last~0_400} OutVars{~SIZE~0=v_~SIZE~0_395, main_~c~0=v_main_~c~0_1993, ~last~0=v_~last~0_400} AuxVars[] AssignedVars[] [2021-05-03 00:20:42,456 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:42,470 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:42,474 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:42,488 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:42,493 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:42,509 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:42,529 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:42,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:42,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:42,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:42,688 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:43,977 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:43,977 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1264225159] [2021-05-03 00:20:43,977 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1264225159] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:43,977 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:43,977 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-03 00:20:43,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301202028] [2021-05-03 00:20:43,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-03 00:20:43,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:43,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-03 00:20:43,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1049, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:20:43,978 INFO L87 Difference]: Start difference. First operand 221 states and 255 transitions. Second operand has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 32 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:45,722 INFO L93 Difference]: Finished difference Result 448 states and 508 transitions. [2021-05-03 00:20:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:20:45,724 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 32 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:20:45,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:45,725 INFO L225 Difference]: With dead ends: 448 [2021-05-03 00:20:45,725 INFO L226 Difference]: Without dead ends: 286 [2021-05-03 00:20:45,726 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 6 SyntacticMatches, 20 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1398.0ms TimeCoverageRelationStatistics Valid=151, Invalid=1181, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:20:45,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-05-03 00:20:45,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 221. [2021-05-03 00:20:45,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 211 states have (on average 1.1563981042654028) internal successors, (244), 211 states have internal predecessors, (244), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:45,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 255 transitions. [2021-05-03 00:20:45,993 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 255 transitions. Word has length 64 [2021-05-03 00:20:45,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:45,993 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 255 transitions. [2021-05-03 00:20:45,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 32 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 255 transitions. [2021-05-03 00:20:45,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:20:45,993 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:45,993 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:45,993 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable501 [2021-05-03 00:20:45,993 INFO L428 AbstractCegarLoop]: === Iteration 119 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:45,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:45,994 INFO L82 PathProgramCache]: Analyzing trace with hash 57135998, now seen corresponding path program 86 times [2021-05-03 00:20:45,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:45,994 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2023685237] [2021-05-03 00:20:45,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:46,005 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_401 v_main_~c~0_2011) (< v_main_~c~0_2011 v_~SIZE~0_396)) InVars {~SIZE~0=v_~SIZE~0_396, main_~c~0=v_main_~c~0_2011, ~last~0=v_~last~0_401} OutVars{~SIZE~0=v_~SIZE~0_396, main_~c~0=v_main_~c~0_2011, ~last~0=v_~last~0_401} AuxVars[] AssignedVars[] [2021-05-03 00:20:46,008 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:46,037 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:46,040 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:46,059 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:46,063 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:46,093 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:46,128 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2013 v_~SIZE~0_397) (< v_main_~c~0_2013 v_~last~0_402)) InVars {~SIZE~0=v_~SIZE~0_397, main_~c~0=v_main_~c~0_2013, ~last~0=v_~last~0_402} OutVars{~SIZE~0=v_~SIZE~0_397, main_~c~0=v_main_~c~0_2013, ~last~0=v_~last~0_402} AuxVars[] AssignedVars[] [2021-05-03 00:20:46,130 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:46,132 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:46,134 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:46,160 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:46,169 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:46,209 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:46,236 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:46,239 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2015 1) v_~SIZE~0_398) (<= v_~last~0_403 v_main_~c~0_2015)) InVars {~SIZE~0=v_~SIZE~0_398, main_~c~0=v_main_~c~0_2015, ~last~0=v_~last~0_403} OutVars{~SIZE~0=v_~SIZE~0_398, main_~c~0=v_main_~c~0_2015, ~last~0=v_~last~0_403} AuxVars[] AssignedVars[] [2021-05-03 00:20:46,241 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:20:46,243 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:46,245 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:46,262 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:46,265 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:46,309 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:20:46,339 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2017 1) v_~SIZE~0_399) (< v_main_~c~0_2017 v_~last~0_404)) InVars {~SIZE~0=v_~SIZE~0_399, main_~c~0=v_main_~c~0_2017, ~last~0=v_~last~0_404} OutVars{~SIZE~0=v_~SIZE~0_399, main_~c~0=v_main_~c~0_2017, ~last~0=v_~last~0_404} AuxVars[] AssignedVars[] [2021-05-03 00:20:46,342 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:46,343 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:46,345 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:46,366 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:46,373 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:46,411 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:46,440 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:46,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:46,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:46,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:46,655 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:48,363 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:48,363 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2023685237] [2021-05-03 00:20:48,363 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2023685237] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:48,363 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:48,363 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-03 00:20:48,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308497582] [2021-05-03 00:20:48,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-03 00:20:48,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:48,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-03 00:20:48,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1112, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:20:48,364 INFO L87 Difference]: Start difference. First operand 221 states and 255 transitions. Second operand has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 33 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:50,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:50,308 INFO L93 Difference]: Finished difference Result 445 states and 505 transitions. [2021-05-03 00:20:50,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:20:50,310 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 33 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:20:50,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:50,310 INFO L225 Difference]: With dead ends: 445 [2021-05-03 00:20:50,310 INFO L226 Difference]: Without dead ends: 283 [2021-05-03 00:20:50,311 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 6 SyntacticMatches, 19 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1843.4ms TimeCoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:20:50,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-05-03 00:20:50,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 221. [2021-05-03 00:20:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 211 states have (on average 1.1563981042654028) internal successors, (244), 211 states have internal predecessors, (244), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:50,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 255 transitions. [2021-05-03 00:20:50,547 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 255 transitions. Word has length 64 [2021-05-03 00:20:50,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:50,547 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 255 transitions. [2021-05-03 00:20:50,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 33 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:50,547 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 255 transitions. [2021-05-03 00:20:50,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:20:50,548 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:50,548 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:50,548 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable506 [2021-05-03 00:20:50,548 INFO L428 AbstractCegarLoop]: === Iteration 120 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:50,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:50,548 INFO L82 PathProgramCache]: Analyzing trace with hash 119175612, now seen corresponding path program 87 times [2021-05-03 00:20:50,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:50,548 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1059068939] [2021-05-03 00:20:50,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:50,556 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_405 v_main_~c~0_2035) (< v_main_~c~0_2035 v_~SIZE~0_400)) InVars {~SIZE~0=v_~SIZE~0_400, main_~c~0=v_main_~c~0_2035, ~last~0=v_~last~0_405} OutVars{~SIZE~0=v_~SIZE~0_400, main_~c~0=v_main_~c~0_2035, ~last~0=v_~last~0_405} AuxVars[] AssignedVars[] [2021-05-03 00:20:50,558 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:50,577 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:50,579 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:50,591 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:50,594 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:50,612 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:50,635 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2037 v_~last~0_406) (< v_main_~c~0_2037 v_~SIZE~0_401)) InVars {~SIZE~0=v_~SIZE~0_401, main_~c~0=v_main_~c~0_2037, ~last~0=v_~last~0_406} OutVars{~SIZE~0=v_~SIZE~0_401, main_~c~0=v_main_~c~0_2037, ~last~0=v_~last~0_406} AuxVars[] AssignedVars[] [2021-05-03 00:20:50,637 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:50,650 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:50,651 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:50,664 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:50,669 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:50,683 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:50,705 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:50,708 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2039 1) v_~SIZE~0_402) (<= v_~last~0_407 v_main_~c~0_2039)) InVars {~SIZE~0=v_~SIZE~0_402, main_~c~0=v_main_~c~0_2039, ~last~0=v_~last~0_407} OutVars{~SIZE~0=v_~SIZE~0_402, main_~c~0=v_main_~c~0_2039, ~last~0=v_~last~0_407} AuxVars[] AssignedVars[] [2021-05-03 00:20:50,709 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:20:50,710 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:50,711 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:50,723 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:50,726 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:50,758 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:20:50,780 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2041 1) v_~SIZE~0_403) (< v_main_~c~0_2041 v_~last~0_408)) InVars {~SIZE~0=v_~SIZE~0_403, main_~c~0=v_main_~c~0_2041, ~last~0=v_~last~0_408} OutVars{~SIZE~0=v_~SIZE~0_403, main_~c~0=v_main_~c~0_2041, ~last~0=v_~last~0_408} AuxVars[] AssignedVars[] [2021-05-03 00:20:50,782 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:50,783 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:50,789 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:50,805 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:50,810 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:50,838 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:50,860 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:51,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:51,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:51,013 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:53,032 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:53,032 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1059068939] [2021-05-03 00:20:53,032 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1059068939] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:53,032 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:53,032 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-03 00:20:53,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890184765] [2021-05-03 00:20:53,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-03 00:20:53,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:53,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-03 00:20:53,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1177, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:20:53,033 INFO L87 Difference]: Start difference. First operand 221 states and 255 transitions. Second operand has 36 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 34 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:55,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:55,702 INFO L93 Difference]: Finished difference Result 442 states and 502 transitions. [2021-05-03 00:20:55,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:20:55,703 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 34 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:20:55,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:55,704 INFO L225 Difference]: With dead ends: 442 [2021-05-03 00:20:55,704 INFO L226 Difference]: Without dead ends: 280 [2021-05-03 00:20:55,704 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 6 SyntacticMatches, 18 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 2126.6ms TimeCoverageRelationStatistics Valid=165, Invalid=1317, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:20:55,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-05-03 00:20:55,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 221. [2021-05-03 00:20:55,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 211 states have (on average 1.1563981042654028) internal successors, (244), 211 states have internal predecessors, (244), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 255 transitions. [2021-05-03 00:20:55,927 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 255 transitions. Word has length 64 [2021-05-03 00:20:55,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:55,927 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 255 transitions. [2021-05-03 00:20:55,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 34 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:55,927 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 255 transitions. [2021-05-03 00:20:55,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:20:55,928 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:55,928 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:55,928 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable511 [2021-05-03 00:20:55,928 INFO L428 AbstractCegarLoop]: === Iteration 121 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:55,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:55,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1686262722, now seen corresponding path program 88 times [2021-05-03 00:20:55,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:55,928 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1463672229] [2021-05-03 00:20:55,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:55,936 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2059 v_~SIZE~0_404) (<= v_~last~0_409 v_main_~c~0_2059)) InVars {~SIZE~0=v_~SIZE~0_404, main_~c~0=v_main_~c~0_2059, ~last~0=v_~last~0_409} OutVars{~SIZE~0=v_~SIZE~0_404, main_~c~0=v_main_~c~0_2059, ~last~0=v_~last~0_409} AuxVars[] AssignedVars[] [2021-05-03 00:20:55,938 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:55,955 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:55,957 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:55,968 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:55,972 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:55,990 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:56,017 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2061 v_~SIZE~0_405) (< v_main_~c~0_2061 v_~last~0_410)) InVars {~SIZE~0=v_~SIZE~0_405, main_~c~0=v_main_~c~0_2061, ~last~0=v_~last~0_410} OutVars{~SIZE~0=v_~SIZE~0_405, main_~c~0=v_main_~c~0_2061, ~last~0=v_~last~0_410} AuxVars[] AssignedVars[] [2021-05-03 00:20:56,019 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:56,020 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:56,022 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:56,038 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:56,043 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:56,069 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:20:56,092 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:56,094 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2063 1) v_~SIZE~0_406) (<= v_~last~0_411 v_main_~c~0_2063)) InVars {~SIZE~0=v_~SIZE~0_406, main_~c~0=v_main_~c~0_2063, ~last~0=v_~last~0_411} OutVars{~SIZE~0=v_~SIZE~0_406, main_~c~0=v_main_~c~0_2063, ~last~0=v_~last~0_411} AuxVars[] AssignedVars[] [2021-05-03 00:20:56,096 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:20:56,097 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:56,099 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:56,110 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:56,112 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:56,145 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:20:56,168 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2065 v_~last~0_412) (< (+ v_main_~c~0_2065 1) v_~SIZE~0_407)) InVars {~SIZE~0=v_~SIZE~0_407, main_~c~0=v_main_~c~0_2065, ~last~0=v_~last~0_412} OutVars{~SIZE~0=v_~SIZE~0_407, main_~c~0=v_main_~c~0_2065, ~last~0=v_~last~0_412} AuxVars[] AssignedVars[] [2021-05-03 00:20:56,169 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:56,184 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:56,186 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:56,201 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:20:56,206 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:20:56,221 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:56,244 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:56,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:56,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:20:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:56,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:56,412 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:58,005 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:58,005 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1463672229] [2021-05-03 00:20:58,005 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1463672229] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:58,005 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:58,005 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-03 00:20:58,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514774179] [2021-05-03 00:20:58,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-03 00:20:58,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:58,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-03 00:20:58,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1244, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:20:58,006 INFO L87 Difference]: Start difference. First operand 221 states and 255 transitions. Second operand has 37 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 35 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:59,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:59,587 INFO L93 Difference]: Finished difference Result 439 states and 499 transitions. [2021-05-03 00:20:59,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-03 00:20:59,588 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 35 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:20:59,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:59,589 INFO L225 Difference]: With dead ends: 439 [2021-05-03 00:20:59,589 INFO L226 Difference]: Without dead ends: 277 [2021-05-03 00:20:59,590 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 6 SyntacticMatches, 17 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1703.0ms TimeCoverageRelationStatistics Valid=172, Invalid=1388, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:20:59,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-05-03 00:20:59,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 221. [2021-05-03 00:20:59,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 211 states have (on average 1.1563981042654028) internal successors, (244), 211 states have internal predecessors, (244), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:20:59,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 255 transitions. [2021-05-03 00:20:59,831 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 255 transitions. Word has length 64 [2021-05-03 00:20:59,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:59,831 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 255 transitions. [2021-05-03 00:20:59,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 35 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:20:59,831 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 255 transitions. [2021-05-03 00:20:59,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:20:59,832 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:59,832 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:59,832 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable516 [2021-05-03 00:20:59,832 INFO L428 AbstractCegarLoop]: === Iteration 122 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:59,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:59,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1791056124, now seen corresponding path program 89 times [2021-05-03 00:20:59,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:59,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1726573998] [2021-05-03 00:20:59,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:59,841 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_413 v_main_~c~0_2083) (< v_main_~c~0_2083 v_~SIZE~0_408)) InVars {~SIZE~0=v_~SIZE~0_408, main_~c~0=v_main_~c~0_2083, ~last~0=v_~last~0_413} OutVars{~SIZE~0=v_~SIZE~0_408, main_~c~0=v_main_~c~0_2083, ~last~0=v_~last~0_413} AuxVars[] AssignedVars[] [2021-05-03 00:20:59,844 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:20:59,867 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:59,869 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:59,885 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:59,889 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:59,907 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:20:59,929 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2085 v_~SIZE~0_409) (< v_main_~c~0_2085 v_~last~0_414)) InVars {~SIZE~0=v_~SIZE~0_409, main_~c~0=v_main_~c~0_2085, ~last~0=v_~last~0_414} OutVars{~SIZE~0=v_~SIZE~0_409, main_~c~0=v_main_~c~0_2085, ~last~0=v_~last~0_414} AuxVars[] AssignedVars[] [2021-05-03 00:20:59,931 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:20:59,932 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:59,933 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:59,948 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:59,953 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:59,982 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:00,006 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:00,009 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2087 1) v_~SIZE~0_410) (<= v_~last~0_415 v_main_~c~0_2087)) InVars {~SIZE~0=v_~SIZE~0_410, main_~c~0=v_main_~c~0_2087, ~last~0=v_~last~0_415} OutVars{~SIZE~0=v_~SIZE~0_410, main_~c~0=v_main_~c~0_2087, ~last~0=v_~last~0_415} AuxVars[] AssignedVars[] [2021-05-03 00:21:00,011 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:21:00,033 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:00,034 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:00,046 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:00,050 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:00,067 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:21:00,088 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2089 v_~last~0_416) (< (+ v_main_~c~0_2089 1) v_~SIZE~0_411)) InVars {~SIZE~0=v_~SIZE~0_411, main_~c~0=v_main_~c~0_2089, ~last~0=v_~last~0_416} OutVars{~SIZE~0=v_~SIZE~0_411, main_~c~0=v_main_~c~0_2089, ~last~0=v_~last~0_416} AuxVars[] AssignedVars[] [2021-05-03 00:21:00,090 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:00,102 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:00,103 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:00,116 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:00,120 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:00,134 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:00,156 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:00,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:00,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:00,327 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:01,640 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:01,640 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1726573998] [2021-05-03 00:21:01,640 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1726573998] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:01,640 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:01,640 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-03 00:21:01,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064903338] [2021-05-03 00:21:01,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-03 00:21:01,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:01,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-03 00:21:01,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1313, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:21:01,641 INFO L87 Difference]: Start difference. First operand 221 states and 255 transitions. Second operand has 38 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 36 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:03,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:03,863 INFO L93 Difference]: Finished difference Result 436 states and 496 transitions. [2021-05-03 00:21:03,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-03 00:21:03,865 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 36 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:21:03,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:03,865 INFO L225 Difference]: With dead ends: 436 [2021-05-03 00:21:03,865 INFO L226 Difference]: Without dead ends: 274 [2021-05-03 00:21:03,866 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 14 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1459.5ms TimeCoverageRelationStatistics Valid=179, Invalid=1461, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:21:03,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-05-03 00:21:04,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 221. [2021-05-03 00:21:04,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 211 states have (on average 1.1563981042654028) internal successors, (244), 211 states have internal predecessors, (244), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:04,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 255 transitions. [2021-05-03 00:21:04,142 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 255 transitions. Word has length 64 [2021-05-03 00:21:04,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:04,142 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 255 transitions. [2021-05-03 00:21:04,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 36 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:04,142 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 255 transitions. [2021-05-03 00:21:04,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:21:04,143 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:04,143 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:04,143 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable521 [2021-05-03 00:21:04,143 INFO L428 AbstractCegarLoop]: === Iteration 123 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:04,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:04,143 INFO L82 PathProgramCache]: Analyzing trace with hash 202708222, now seen corresponding path program 90 times [2021-05-03 00:21:04,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:04,143 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [796529930] [2021-05-03 00:21:04,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:04,154 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_417 v_main_~c~0_2107) (< v_main_~c~0_2107 v_~SIZE~0_412)) InVars {~SIZE~0=v_~SIZE~0_412, main_~c~0=v_main_~c~0_2107, ~last~0=v_~last~0_417} OutVars{~SIZE~0=v_~SIZE~0_412, main_~c~0=v_main_~c~0_2107, ~last~0=v_~last~0_417} AuxVars[] AssignedVars[] [2021-05-03 00:21:04,157 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:04,185 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:04,187 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:04,203 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:04,207 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:04,235 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:04,269 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2109 v_~SIZE~0_413) (< v_main_~c~0_2109 v_~last~0_418)) InVars {~SIZE~0=v_~SIZE~0_413, main_~c~0=v_main_~c~0_2109, ~last~0=v_~last~0_418} OutVars{~SIZE~0=v_~SIZE~0_413, main_~c~0=v_main_~c~0_2109, ~last~0=v_~last~0_418} AuxVars[] AssignedVars[] [2021-05-03 00:21:04,271 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:04,292 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:04,295 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:04,316 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:04,321 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:04,346 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:04,375 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:04,379 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2111 1) v_~SIZE~0_414) (<= v_~last~0_419 v_main_~c~0_2111)) InVars {~SIZE~0=v_~SIZE~0_414, main_~c~0=v_main_~c~0_2111, ~last~0=v_~last~0_419} OutVars{~SIZE~0=v_~SIZE~0_414, main_~c~0=v_main_~c~0_2111, ~last~0=v_~last~0_419} AuxVars[] AssignedVars[] [2021-05-03 00:21:04,381 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:21:04,382 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:04,384 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:04,401 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:04,406 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:04,451 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:21:04,484 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2113 1) v_~SIZE~0_415) (< v_main_~c~0_2113 v_~last~0_420)) InVars {~SIZE~0=v_~SIZE~0_415, main_~c~0=v_main_~c~0_2113, ~last~0=v_~last~0_420} OutVars{~SIZE~0=v_~SIZE~0_415, main_~c~0=v_main_~c~0_2113, ~last~0=v_~last~0_420} AuxVars[] AssignedVars[] [2021-05-03 00:21:04,486 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:04,487 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:04,488 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:04,507 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:04,514 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:04,548 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:04,577 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:04,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:04,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:04,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:04,779 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:06,397 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:06,398 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [796529930] [2021-05-03 00:21:06,398 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [796529930] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:06,398 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:06,398 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-03 00:21:06,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680702259] [2021-05-03 00:21:06,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-03 00:21:06,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:06,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-03 00:21:06,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1384, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:21:06,399 INFO L87 Difference]: Start difference. First operand 221 states and 255 transitions. Second operand has 39 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 37 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:08,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:08,170 INFO L93 Difference]: Finished difference Result 433 states and 493 transitions. [2021-05-03 00:21:08,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-03 00:21:08,171 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 37 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:21:08,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:08,172 INFO L225 Difference]: With dead ends: 433 [2021-05-03 00:21:08,172 INFO L226 Difference]: Without dead ends: 271 [2021-05-03 00:21:08,173 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 6 SyntacticMatches, 15 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 1740.0ms TimeCoverageRelationStatistics Valid=186, Invalid=1536, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:21:08,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-05-03 00:21:08,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 221. [2021-05-03 00:21:08,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 211 states have (on average 1.1563981042654028) internal successors, (244), 211 states have internal predecessors, (244), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:08,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 255 transitions. [2021-05-03 00:21:08,440 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 255 transitions. Word has length 64 [2021-05-03 00:21:08,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:08,440 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 255 transitions. [2021-05-03 00:21:08,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 37 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:08,440 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 255 transitions. [2021-05-03 00:21:08,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:21:08,440 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:08,440 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 13, 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-03 00:21:08,440 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable526 [2021-05-03 00:21:08,440 INFO L428 AbstractCegarLoop]: === Iteration 124 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:08,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:08,441 INFO L82 PathProgramCache]: Analyzing trace with hash -808409028, now seen corresponding path program 91 times [2021-05-03 00:21:08,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:08,441 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [192787855] [2021-05-03 00:21:08,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:08,450 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_421 v_main_~c~0_2131) (< v_main_~c~0_2131 v_~SIZE~0_416)) InVars {~SIZE~0=v_~SIZE~0_416, main_~c~0=v_main_~c~0_2131, ~last~0=v_~last~0_421} OutVars{~SIZE~0=v_~SIZE~0_416, main_~c~0=v_main_~c~0_2131, ~last~0=v_~last~0_421} AuxVars[] AssignedVars[] [2021-05-03 00:21:08,452 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:08,453 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:08,455 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:08,470 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:08,475 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:08,519 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:08,551 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2133 v_~SIZE~0_417) (< v_main_~c~0_2133 v_~last~0_422)) InVars {~SIZE~0=v_~SIZE~0_417, main_~c~0=v_main_~c~0_2133, ~last~0=v_~last~0_422} OutVars{~SIZE~0=v_~SIZE~0_417, main_~c~0=v_main_~c~0_2133, ~last~0=v_~last~0_422} AuxVars[] AssignedVars[] [2021-05-03 00:21:08,552 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:08,572 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:08,574 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:08,594 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:08,602 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:08,622 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:08,653 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:08,655 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2135 v_~last~0_423) (< (+ v_main_~c~0_2135 1) v_~SIZE~0_418)) InVars {~SIZE~0=v_~SIZE~0_418, main_~c~0=v_main_~c~0_2135, ~last~0=v_~last~0_423} OutVars{~SIZE~0=v_~SIZE~0_418, main_~c~0=v_main_~c~0_2135, ~last~0=v_~last~0_423} AuxVars[] AssignedVars[] [2021-05-03 00:21:08,657 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:08,658 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:08,661 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:08,680 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:08,687 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:08,729 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:08,757 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:08,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:08,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:08,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:08,974 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:10,880 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:10,880 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [192787855] [2021-05-03 00:21:10,880 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [192787855] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:10,880 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:10,880 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-03 00:21:10,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311322385] [2021-05-03 00:21:10,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-03 00:21:10,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:10,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-03 00:21:10,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1457, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:21:10,881 INFO L87 Difference]: Start difference. First operand 221 states and 255 transitions. Second operand has 40 states, 40 states have (on average 1.45) internal successors, (58), 38 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:12,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:12,696 INFO L93 Difference]: Finished difference Result 432 states and 493 transitions. [2021-05-03 00:21:12,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-03 00:21:12,698 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.45) internal successors, (58), 38 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:21:12,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:12,699 INFO L225 Difference]: With dead ends: 432 [2021-05-03 00:21:12,699 INFO L226 Difference]: Without dead ends: 270 [2021-05-03 00:21:12,700 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 6 SyntacticMatches, 14 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 2020.5ms TimeCoverageRelationStatistics Valid=193, Invalid=1613, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:21:12,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-05-03 00:21:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 222. [2021-05-03 00:21:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 212 states have (on average 1.1603773584905661) internal successors, (246), 212 states have internal predecessors, (246), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 257 transitions. [2021-05-03 00:21:12,955 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 257 transitions. Word has length 64 [2021-05-03 00:21:12,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:12,956 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 257 transitions. [2021-05-03 00:21:12,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 1.45) internal successors, (58), 38 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:12,956 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 257 transitions. [2021-05-03 00:21:12,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-03 00:21:12,956 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:12,956 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:12,956 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable530 [2021-05-03 00:21:12,956 INFO L428 AbstractCegarLoop]: === Iteration 125 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:12,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:12,957 INFO L82 PathProgramCache]: Analyzing trace with hash -973949378, now seen corresponding path program 14 times [2021-05-03 00:21:12,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:12,957 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1634347593] [2021-05-03 00:21:12,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:12,964 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2153 v_~SIZE~0_419) (< v_main_~c~0_2153 v_~last~0_424)) InVars {~SIZE~0=v_~SIZE~0_419, main_~c~0=v_main_~c~0_2153, ~last~0=v_~last~0_424} OutVars{~SIZE~0=v_~SIZE~0_419, main_~c~0=v_main_~c~0_2153, ~last~0=v_~last~0_424} AuxVars[] AssignedVars[] [2021-05-03 00:21:12,966 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:12,985 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:12,987 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:13,007 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:13,014 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:13,036 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:13,065 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:21:13,067 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2155 1) v_~SIZE~0_420) (< v_main_~c~0_2155 v_~last~0_425)) InVars {~SIZE~0=v_~SIZE~0_420, main_~c~0=v_main_~c~0_2155, ~last~0=v_~last~0_425} OutVars{~SIZE~0=v_~SIZE~0_420, main_~c~0=v_main_~c~0_2155, ~last~0=v_~last~0_425} AuxVars[] AssignedVars[] [2021-05-03 00:21:13,069 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:13,088 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:13,090 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:13,110 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:13,117 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:13,139 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:13,170 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:21:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:13,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:13,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:13,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:15,236 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:15,236 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1634347593] [2021-05-03 00:21:15,236 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1634347593] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:15,236 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:15,236 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-03 00:21:15,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484109918] [2021-05-03 00:21:15,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-03 00:21:15,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:15,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-03 00:21:15,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1446, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:21:15,238 INFO L87 Difference]: Start difference. First operand 222 states and 257 transitions. Second operand has 39 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 37 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:18,417 INFO L93 Difference]: Finished difference Result 445 states and 507 transitions. [2021-05-03 00:21:18,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-05-03 00:21:18,419 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 37 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2021-05-03 00:21:18,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:18,421 INFO L225 Difference]: With dead ends: 445 [2021-05-03 00:21:18,421 INFO L226 Difference]: Without dead ends: 283 [2021-05-03 00:21:18,421 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 6 SyntacticMatches, 13 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 2732.7ms TimeCoverageRelationStatistics Valid=316, Invalid=2876, Unknown=0, NotChecked=0, Total=3192 [2021-05-03 00:21:18,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-05-03 00:21:18,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 224. [2021-05-03 00:21:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 214 states have (on average 1.158878504672897) internal successors, (248), 214 states have internal predecessors, (248), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:18,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 259 transitions. [2021-05-03 00:21:18,713 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 259 transitions. Word has length 64 [2021-05-03 00:21:18,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:18,713 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 259 transitions. [2021-05-03 00:21:18,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 37 states have internal predecessors, (58), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:18,714 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 259 transitions. [2021-05-03 00:21:18,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:21:18,714 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:18,714 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:18,714 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable533 [2021-05-03 00:21:18,714 INFO L428 AbstractCegarLoop]: === Iteration 126 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:18,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:18,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1434289085, now seen corresponding path program 15 times [2021-05-03 00:21:18,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:18,715 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [523046426] [2021-05-03 00:21:18,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:18,723 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_426 v_main_~c~0_2172) (< v_main_~c~0_2172 v_~SIZE~0_421)) InVars {~SIZE~0=v_~SIZE~0_421, main_~c~0=v_main_~c~0_2172, ~last~0=v_~last~0_426} OutVars{~SIZE~0=v_~SIZE~0_421, main_~c~0=v_main_~c~0_2172, ~last~0=v_~last~0_426} AuxVars[] AssignedVars[] [2021-05-03 00:21:18,726 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:18,751 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:18,753 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:18,769 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:18,774 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:18,801 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:18,834 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:21:18,838 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_427 v_main_~c~0_2174) (< (+ v_main_~c~0_2174 1) v_~SIZE~0_422)) InVars {~SIZE~0=v_~SIZE~0_422, main_~c~0=v_main_~c~0_2174, ~last~0=v_~last~0_427} OutVars{~SIZE~0=v_~SIZE~0_422, main_~c~0=v_main_~c~0_2174, ~last~0=v_~last~0_427} AuxVars[] AssignedVars[] [2021-05-03 00:21:18,840 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:21:18,842 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:18,844 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:18,862 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:18,867 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:18,913 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:21:18,946 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:21:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:19,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:19,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:20,371 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:20,372 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [523046426] [2021-05-03 00:21:20,372 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [523046426] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:20,372 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:20,372 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:21:20,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94932867] [2021-05-03 00:21:20,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:21:20,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:20,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:21:20,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:21:20,373 INFO L87 Difference]: Start difference. First operand 224 states and 259 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:22,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:22,573 INFO L93 Difference]: Finished difference Result 495 states and 560 transitions. [2021-05-03 00:21:22,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:21:22,574 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:21:22,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:22,575 INFO L225 Difference]: With dead ends: 495 [2021-05-03 00:21:22,575 INFO L226 Difference]: Without dead ends: 333 [2021-05-03 00:21:22,575 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 12 SyntacticMatches, 29 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1330.7ms TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:21:22,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-05-03 00:21:22,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 245. [2021-05-03 00:21:22,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 235 states have (on average 1.1446808510638298) internal successors, (269), 235 states have internal predecessors, (269), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:22,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 280 transitions. [2021-05-03 00:21:22,888 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 280 transitions. Word has length 67 [2021-05-03 00:21:22,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:22,888 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 280 transitions. [2021-05-03 00:21:22,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:22,889 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 280 transitions. [2021-05-03 00:21:22,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:21:22,889 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:22,889 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 14, 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-03 00:21:22,889 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable536 [2021-05-03 00:21:22,889 INFO L428 AbstractCegarLoop]: === Iteration 127 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:22,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:22,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1878189759, now seen corresponding path program 92 times [2021-05-03 00:21:22,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:22,890 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2136256386] [2021-05-03 00:21:22,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:22,900 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_428 v_main_~c~0_2192) (< v_main_~c~0_2192 v_~SIZE~0_423)) InVars {~SIZE~0=v_~SIZE~0_423, main_~c~0=v_main_~c~0_2192, ~last~0=v_~last~0_428} OutVars{~SIZE~0=v_~SIZE~0_423, main_~c~0=v_main_~c~0_2192, ~last~0=v_~last~0_428} AuxVars[] AssignedVars[] [2021-05-03 00:21:22,902 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:22,903 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:22,904 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:22,929 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:22,932 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:22,964 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:22,988 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2194 v_~last~0_429) (< v_main_~c~0_2194 v_~SIZE~0_424)) InVars {~SIZE~0=v_~SIZE~0_424, main_~c~0=v_main_~c~0_2194, ~last~0=v_~last~0_429} OutVars{~SIZE~0=v_~SIZE~0_424, main_~c~0=v_main_~c~0_2194, ~last~0=v_~last~0_429} AuxVars[] AssignedVars[] [2021-05-03 00:21:22,990 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:23,005 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:23,009 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:23,041 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:23,047 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:23,066 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:23,087 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:23,089 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_430 v_main_~c~0_2196) (< (+ v_main_~c~0_2196 1) v_~SIZE~0_425)) InVars {~SIZE~0=v_~SIZE~0_425, main_~c~0=v_main_~c~0_2196, ~last~0=v_~last~0_430} OutVars{~SIZE~0=v_~SIZE~0_425, main_~c~0=v_main_~c~0_2196, ~last~0=v_~last~0_430} AuxVars[] AssignedVars[] [2021-05-03 00:21:23,090 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:21:23,107 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:23,109 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:23,124 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:23,128 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:23,149 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:21:23,178 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2198 1) v_~SIZE~0_426) (< v_main_~c~0_2198 v_~last~0_431)) InVars {~SIZE~0=v_~SIZE~0_426, main_~c~0=v_main_~c~0_2198, ~last~0=v_~last~0_431} OutVars{~SIZE~0=v_~SIZE~0_426, main_~c~0=v_main_~c~0_2198, ~last~0=v_~last~0_431} AuxVars[] AssignedVars[] [2021-05-03 00:21:23,181 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:23,182 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:23,184 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:23,206 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:23,214 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:23,253 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:23,279 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:23,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:23,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:23,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:23,461 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:25,372 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:25,372 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2136256386] [2021-05-03 00:21:25,372 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2136256386] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:25,372 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:25,372 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:21:25,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803340473] [2021-05-03 00:21:25,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:21:25,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:25,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:21:25,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:21:25,373 INFO L87 Difference]: Start difference. First operand 245 states and 280 transitions. Second operand has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 27 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:27,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:27,428 INFO L93 Difference]: Finished difference Result 529 states and 590 transitions. [2021-05-03 00:21:27,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:21:27,430 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 27 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:21:27,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:27,431 INFO L225 Difference]: With dead ends: 529 [2021-05-03 00:21:27,431 INFO L226 Difference]: Without dead ends: 340 [2021-05-03 00:21:27,431 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 28 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 2015.7ms TimeCoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:21:27,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-05-03 00:21:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 245. [2021-05-03 00:21:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 235 states have (on average 1.1446808510638298) internal successors, (269), 235 states have internal predecessors, (269), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 280 transitions. [2021-05-03 00:21:27,747 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 280 transitions. Word has length 67 [2021-05-03 00:21:27,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:27,747 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 280 transitions. [2021-05-03 00:21:27,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 27 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 280 transitions. [2021-05-03 00:21:27,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:21:27,747 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:27,747 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:27,748 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable541 [2021-05-03 00:21:27,748 INFO L428 AbstractCegarLoop]: === Iteration 128 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:27,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:27,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1397109501, now seen corresponding path program 93 times [2021-05-03 00:21:27,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:27,748 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [982256679] [2021-05-03 00:21:27,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:27,757 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_432 v_main_~c~0_2217) (< v_main_~c~0_2217 v_~SIZE~0_427)) InVars {~SIZE~0=v_~SIZE~0_427, main_~c~0=v_main_~c~0_2217, ~last~0=v_~last~0_432} OutVars{~SIZE~0=v_~SIZE~0_427, main_~c~0=v_main_~c~0_2217, ~last~0=v_~last~0_432} AuxVars[] AssignedVars[] [2021-05-03 00:21:27,759 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:27,760 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:27,761 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:27,773 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:27,776 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:27,809 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:27,834 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2219 v_~last~0_433) (< v_main_~c~0_2219 v_~SIZE~0_428)) InVars {~SIZE~0=v_~SIZE~0_428, main_~c~0=v_main_~c~0_2219, ~last~0=v_~last~0_433} OutVars{~SIZE~0=v_~SIZE~0_428, main_~c~0=v_main_~c~0_2219, ~last~0=v_~last~0_433} AuxVars[] AssignedVars[] [2021-05-03 00:21:27,835 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:27,851 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:27,853 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:27,873 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:27,880 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:27,898 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:27,922 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:27,925 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2221 1) v_~SIZE~0_429) (<= v_~last~0_434 v_main_~c~0_2221)) InVars {~SIZE~0=v_~SIZE~0_429, main_~c~0=v_main_~c~0_2221, ~last~0=v_~last~0_434} OutVars{~SIZE~0=v_~SIZE~0_429, main_~c~0=v_main_~c~0_2221, ~last~0=v_~last~0_434} AuxVars[] AssignedVars[] [2021-05-03 00:21:27,927 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:21:27,928 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:27,929 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:27,940 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:27,943 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:27,977 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:21:28,002 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2223 1) v_~SIZE~0_430) (< v_main_~c~0_2223 v_~last~0_435)) InVars {~SIZE~0=v_~SIZE~0_430, main_~c~0=v_main_~c~0_2223, ~last~0=v_~last~0_435} OutVars{~SIZE~0=v_~SIZE~0_430, main_~c~0=v_main_~c~0_2223, ~last~0=v_~last~0_435} AuxVars[] AssignedVars[] [2021-05-03 00:21:28,004 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:28,019 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:28,021 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:28,037 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:28,042 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:28,059 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:28,087 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:28,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:28,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:28,270 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:30,392 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:30,392 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [982256679] [2021-05-03 00:21:30,392 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [982256679] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:30,392 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:30,392 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:21:30,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432633569] [2021-05-03 00:21:30,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:21:30,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:30,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:21:30,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:21:30,394 INFO L87 Difference]: Start difference. First operand 245 states and 280 transitions. Second operand has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 28 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:32,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:32,987 INFO L93 Difference]: Finished difference Result 526 states and 587 transitions. [2021-05-03 00:21:32,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:21:32,990 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 28 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:21:32,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:32,991 INFO L225 Difference]: With dead ends: 526 [2021-05-03 00:21:32,991 INFO L226 Difference]: Without dead ends: 337 [2021-05-03 00:21:32,991 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 27 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 2254.9ms TimeCoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:21:32,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-05-03 00:21:33,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 245. [2021-05-03 00:21:33,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 235 states have (on average 1.1446808510638298) internal successors, (269), 235 states have internal predecessors, (269), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:33,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 280 transitions. [2021-05-03 00:21:33,364 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 280 transitions. Word has length 67 [2021-05-03 00:21:33,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:33,364 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 280 transitions. [2021-05-03 00:21:33,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 28 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:33,364 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 280 transitions. [2021-05-03 00:21:33,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:21:33,365 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:33,365 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:33,365 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable546 [2021-05-03 00:21:33,365 INFO L428 AbstractCegarLoop]: === Iteration 129 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:33,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:33,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1044021119, now seen corresponding path program 94 times [2021-05-03 00:21:33,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:33,366 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [988264479] [2021-05-03 00:21:33,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:33,381 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_436 v_main_~c~0_2242) (< v_main_~c~0_2242 v_~SIZE~0_431)) InVars {~SIZE~0=v_~SIZE~0_431, main_~c~0=v_main_~c~0_2242, ~last~0=v_~last~0_436} OutVars{~SIZE~0=v_~SIZE~0_431, main_~c~0=v_main_~c~0_2242, ~last~0=v_~last~0_436} AuxVars[] AssignedVars[] [2021-05-03 00:21:33,383 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:33,385 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:33,387 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:33,411 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:33,416 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:33,476 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:33,505 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2244 v_~SIZE~0_432) (< v_main_~c~0_2244 v_~last~0_437)) InVars {~SIZE~0=v_~SIZE~0_432, main_~c~0=v_main_~c~0_2244, ~last~0=v_~last~0_437} OutVars{~SIZE~0=v_~SIZE~0_432, main_~c~0=v_main_~c~0_2244, ~last~0=v_~last~0_437} AuxVars[] AssignedVars[] [2021-05-03 00:21:33,507 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:33,532 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:33,535 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:33,556 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:33,564 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:33,588 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:33,621 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:33,624 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_438 v_main_~c~0_2246) (< (+ v_main_~c~0_2246 1) v_~SIZE~0_433)) InVars {~SIZE~0=v_~SIZE~0_433, main_~c~0=v_main_~c~0_2246, ~last~0=v_~last~0_438} OutVars{~SIZE~0=v_~SIZE~0_433, main_~c~0=v_main_~c~0_2246, ~last~0=v_~last~0_438} AuxVars[] AssignedVars[] [2021-05-03 00:21:33,626 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:21:33,628 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:33,631 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:33,649 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:33,654 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:33,740 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:21:33,784 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2248 1) v_~SIZE~0_434) (< v_main_~c~0_2248 v_~last~0_439)) InVars {~SIZE~0=v_~SIZE~0_434, main_~c~0=v_main_~c~0_2248, ~last~0=v_~last~0_439} OutVars{~SIZE~0=v_~SIZE~0_434, main_~c~0=v_main_~c~0_2248, ~last~0=v_~last~0_439} AuxVars[] AssignedVars[] [2021-05-03 00:21:33,787 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:33,812 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:33,814 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:33,834 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:33,841 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:33,869 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:33,904 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:34,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:34,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:34,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:34,144 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:35,852 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:35,852 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [988264479] [2021-05-03 00:21:35,852 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [988264479] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:35,852 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:35,852 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:21:35,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319838013] [2021-05-03 00:21:35,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:21:35,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:35,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:21:35,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:21:35,854 INFO L87 Difference]: Start difference. First operand 245 states and 280 transitions. Second operand has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 29 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:37,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:37,812 INFO L93 Difference]: Finished difference Result 523 states and 584 transitions. [2021-05-03 00:21:37,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:21:37,814 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 29 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:21:37,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:37,815 INFO L225 Difference]: With dead ends: 523 [2021-05-03 00:21:37,815 INFO L226 Difference]: Without dead ends: 334 [2021-05-03 00:21:37,816 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 26 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1842.7ms TimeCoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:21:37,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-05-03 00:21:38,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 245. [2021-05-03 00:21:38,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 235 states have (on average 1.1446808510638298) internal successors, (269), 235 states have internal predecessors, (269), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 280 transitions. [2021-05-03 00:21:38,170 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 280 transitions. Word has length 67 [2021-05-03 00:21:38,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:38,170 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 280 transitions. [2021-05-03 00:21:38,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 29 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:38,170 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 280 transitions. [2021-05-03 00:21:38,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:21:38,171 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:38,171 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:38,171 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable551 [2021-05-03 00:21:38,171 INFO L428 AbstractCegarLoop]: === Iteration 130 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:38,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:38,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1005366723, now seen corresponding path program 95 times [2021-05-03 00:21:38,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:38,171 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1309052410] [2021-05-03 00:21:38,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:38,180 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2267 v_~SIZE~0_435) (<= v_~last~0_440 v_main_~c~0_2267)) InVars {~SIZE~0=v_~SIZE~0_435, main_~c~0=v_main_~c~0_2267, ~last~0=v_~last~0_440} OutVars{~SIZE~0=v_~SIZE~0_435, main_~c~0=v_main_~c~0_2267, ~last~0=v_~last~0_440} AuxVars[] AssignedVars[] [2021-05-03 00:21:38,182 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:38,183 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:38,184 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:38,198 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:38,202 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:38,238 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:38,262 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2269 v_~last~0_441) (< v_main_~c~0_2269 v_~SIZE~0_436)) InVars {~SIZE~0=v_~SIZE~0_436, main_~c~0=v_main_~c~0_2269, ~last~0=v_~last~0_441} OutVars{~SIZE~0=v_~SIZE~0_436, main_~c~0=v_main_~c~0_2269, ~last~0=v_~last~0_441} AuxVars[] AssignedVars[] [2021-05-03 00:21:38,264 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:38,266 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:38,268 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:38,284 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:38,290 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:38,319 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:38,342 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:38,345 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2271 1) v_~SIZE~0_437) (<= v_~last~0_442 v_main_~c~0_2271)) InVars {~SIZE~0=v_~SIZE~0_437, main_~c~0=v_main_~c~0_2271, ~last~0=v_~last~0_442} OutVars{~SIZE~0=v_~SIZE~0_437, main_~c~0=v_main_~c~0_2271, ~last~0=v_~last~0_442} AuxVars[] AssignedVars[] [2021-05-03 00:21:38,347 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:21:38,348 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:38,350 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:38,363 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:38,367 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:38,399 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:21:38,422 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2273 v_~last~0_443) (< (+ v_main_~c~0_2273 1) v_~SIZE~0_438)) InVars {~SIZE~0=v_~SIZE~0_438, main_~c~0=v_main_~c~0_2273, ~last~0=v_~last~0_443} OutVars{~SIZE~0=v_~SIZE~0_438, main_~c~0=v_main_~c~0_2273, ~last~0=v_~last~0_443} AuxVars[] AssignedVars[] [2021-05-03 00:21:38,424 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:38,440 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:38,442 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:38,458 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:38,463 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:38,480 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:38,502 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:38,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:38,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:38,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-03 00:21:38,670 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:40,018 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:40,018 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1309052410] [2021-05-03 00:21:40,018 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1309052410] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:40,018 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:40,018 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:21:40,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104528671] [2021-05-03 00:21:40,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:21:40,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:40,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:21:40,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:21:40,019 INFO L87 Difference]: Start difference. First operand 245 states and 280 transitions. Second operand has 32 states, 32 states have (on average 1.90625) internal successors, (61), 30 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:42,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:42,034 INFO L93 Difference]: Finished difference Result 520 states and 581 transitions. [2021-05-03 00:21:42,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:21:42,035 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.90625) internal successors, (61), 30 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:21:42,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:42,036 INFO L225 Difference]: With dead ends: 520 [2021-05-03 00:21:42,036 INFO L226 Difference]: Without dead ends: 331 [2021-05-03 00:21:42,037 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 25 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1463.5ms TimeCoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:21:42,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-05-03 00:21:42,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 245. [2021-05-03 00:21:42,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 235 states have (on average 1.1446808510638298) internal successors, (269), 235 states have internal predecessors, (269), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 280 transitions. [2021-05-03 00:21:42,347 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 280 transitions. Word has length 67 [2021-05-03 00:21:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:42,347 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 280 transitions. [2021-05-03 00:21:42,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 1.90625) internal successors, (61), 30 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 280 transitions. [2021-05-03 00:21:42,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:21:42,347 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:42,348 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:42,348 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable556 [2021-05-03 00:21:42,348 INFO L428 AbstractCegarLoop]: === Iteration 131 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:42,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:42,348 INFO L82 PathProgramCache]: Analyzing trace with hash -581720001, now seen corresponding path program 96 times [2021-05-03 00:21:42,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:42,348 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1586722730] [2021-05-03 00:21:42,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:42,356 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_444 v_main_~c~0_2292) (< v_main_~c~0_2292 v_~SIZE~0_439)) InVars {~SIZE~0=v_~SIZE~0_439, main_~c~0=v_main_~c~0_2292, ~last~0=v_~last~0_444} OutVars{~SIZE~0=v_~SIZE~0_439, main_~c~0=v_main_~c~0_2292, ~last~0=v_~last~0_444} AuxVars[] AssignedVars[] [2021-05-03 00:21:42,357 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:42,374 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:42,376 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:42,388 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:42,390 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:42,406 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:42,429 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2294 v_~SIZE~0_440) (< v_main_~c~0_2294 v_~last~0_445)) InVars {~SIZE~0=v_~SIZE~0_440, main_~c~0=v_main_~c~0_2294, ~last~0=v_~last~0_445} OutVars{~SIZE~0=v_~SIZE~0_440, main_~c~0=v_main_~c~0_2294, ~last~0=v_~last~0_445} AuxVars[] AssignedVars[] [2021-05-03 00:21:42,430 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:42,431 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:42,432 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:42,447 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:42,452 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:42,477 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:42,497 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:42,499 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2296 1) v_~SIZE~0_441) (<= v_~last~0_446 v_main_~c~0_2296)) InVars {~SIZE~0=v_~SIZE~0_441, main_~c~0=v_main_~c~0_2296, ~last~0=v_~last~0_446} OutVars{~SIZE~0=v_~SIZE~0_441, main_~c~0=v_main_~c~0_2296, ~last~0=v_~last~0_446} AuxVars[] AssignedVars[] [2021-05-03 00:21:42,501 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:21:42,501 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:42,503 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:42,513 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:42,516 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:42,547 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:21:42,568 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2298 1) v_~SIZE~0_442) (< v_main_~c~0_2298 v_~last~0_447)) InVars {~SIZE~0=v_~SIZE~0_442, main_~c~0=v_main_~c~0_2298, ~last~0=v_~last~0_447} OutVars{~SIZE~0=v_~SIZE~0_442, main_~c~0=v_main_~c~0_2298, ~last~0=v_~last~0_447} AuxVars[] AssignedVars[] [2021-05-03 00:21:42,570 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:42,571 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:42,572 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:42,586 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:42,591 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:42,617 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:42,638 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:42,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:42,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:42,791 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:44,137 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:44,137 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1586722730] [2021-05-03 00:21:44,137 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1586722730] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:44,137 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:44,137 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:21:44,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491826919] [2021-05-03 00:21:44,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:21:44,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:44,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:21:44,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=991, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:21:44,138 INFO L87 Difference]: Start difference. First operand 245 states and 280 transitions. Second operand has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 31 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:45,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:45,866 INFO L93 Difference]: Finished difference Result 517 states and 578 transitions. [2021-05-03 00:21:45,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:21:45,867 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 31 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:21:45,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:45,868 INFO L225 Difference]: With dead ends: 517 [2021-05-03 00:21:45,868 INFO L226 Difference]: Without dead ends: 328 [2021-05-03 00:21:45,869 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 24 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1439.0ms TimeCoverageRelationStatistics Valid=141, Invalid=1119, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:21:45,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-05-03 00:21:46,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 245. [2021-05-03 00:21:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 235 states have (on average 1.1446808510638298) internal successors, (269), 235 states have internal predecessors, (269), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 280 transitions. [2021-05-03 00:21:46,191 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 280 transitions. Word has length 67 [2021-05-03 00:21:46,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:46,191 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 280 transitions. [2021-05-03 00:21:46,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 31 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:46,191 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 280 transitions. [2021-05-03 00:21:46,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:21:46,191 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:46,191 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:46,191 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable561 [2021-05-03 00:21:46,192 INFO L428 AbstractCegarLoop]: === Iteration 132 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:46,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:46,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1611079299, now seen corresponding path program 97 times [2021-05-03 00:21:46,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:46,192 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1943622677] [2021-05-03 00:21:46,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:46,200 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2317 v_~SIZE~0_443) (<= v_~last~0_448 v_main_~c~0_2317)) InVars {~SIZE~0=v_~SIZE~0_443, main_~c~0=v_main_~c~0_2317, ~last~0=v_~last~0_448} OutVars{~SIZE~0=v_~SIZE~0_443, main_~c~0=v_main_~c~0_2317, ~last~0=v_~last~0_448} AuxVars[] AssignedVars[] [2021-05-03 00:21:46,202 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:46,219 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:46,221 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:46,234 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:46,237 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:46,254 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:46,277 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2319 v_~last~0_449) (< v_main_~c~0_2319 v_~SIZE~0_444)) InVars {~SIZE~0=v_~SIZE~0_444, main_~c~0=v_main_~c~0_2319, ~last~0=v_~last~0_449} OutVars{~SIZE~0=v_~SIZE~0_444, main_~c~0=v_main_~c~0_2319, ~last~0=v_~last~0_449} AuxVars[] AssignedVars[] [2021-05-03 00:21:46,278 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:46,292 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:46,294 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:46,308 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:46,313 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:46,328 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:46,349 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:46,351 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_450 v_main_~c~0_2321) (< (+ v_main_~c~0_2321 1) v_~SIZE~0_445)) InVars {~SIZE~0=v_~SIZE~0_445, main_~c~0=v_main_~c~0_2321, ~last~0=v_~last~0_450} OutVars{~SIZE~0=v_~SIZE~0_445, main_~c~0=v_main_~c~0_2321, ~last~0=v_~last~0_450} AuxVars[] AssignedVars[] [2021-05-03 00:21:46,353 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:21:46,370 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:46,372 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:46,382 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:46,385 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:46,402 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:21:46,425 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2323 v_~last~0_451) (< (+ v_main_~c~0_2323 1) v_~SIZE~0_446)) InVars {~SIZE~0=v_~SIZE~0_446, main_~c~0=v_main_~c~0_2323, ~last~0=v_~last~0_451} OutVars{~SIZE~0=v_~SIZE~0_446, main_~c~0=v_main_~c~0_2323, ~last~0=v_~last~0_451} AuxVars[] AssignedVars[] [2021-05-03 00:21:46,427 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:46,429 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:46,430 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:46,449 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:46,454 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:46,482 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:46,504 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:46,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:46,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:46,707 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:48,419 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:48,420 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1943622677] [2021-05-03 00:21:48,420 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1943622677] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:48,420 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:48,420 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-03 00:21:48,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335730150] [2021-05-03 00:21:48,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-03 00:21:48,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:48,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-03 00:21:48,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:21:48,421 INFO L87 Difference]: Start difference. First operand 245 states and 280 transitions. Second operand has 34 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 32 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:51,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:51,544 INFO L93 Difference]: Finished difference Result 514 states and 575 transitions. [2021-05-03 00:21:51,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:21:51,547 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 32 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:21:51,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:51,547 INFO L225 Difference]: With dead ends: 514 [2021-05-03 00:21:51,547 INFO L226 Difference]: Without dead ends: 325 [2021-05-03 00:21:51,548 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 23 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 1864.7ms TimeCoverageRelationStatistics Valid=148, Invalid=1184, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:21:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-05-03 00:21:51,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 245. [2021-05-03 00:21:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 235 states have (on average 1.1446808510638298) internal successors, (269), 235 states have internal predecessors, (269), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:51,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 280 transitions. [2021-05-03 00:21:51,931 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 280 transitions. Word has length 67 [2021-05-03 00:21:51,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:51,931 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 280 transitions. [2021-05-03 00:21:51,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 32 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:51,931 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 280 transitions. [2021-05-03 00:21:51,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:21:51,931 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:51,932 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:51,932 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable566 [2021-05-03 00:21:51,932 INFO L428 AbstractCegarLoop]: === Iteration 133 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:51,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:51,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1839882495, now seen corresponding path program 98 times [2021-05-03 00:21:51,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:51,932 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1955306006] [2021-05-03 00:21:51,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:51,949 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_452 v_main_~c~0_2342) (< v_main_~c~0_2342 v_~SIZE~0_447)) InVars {~SIZE~0=v_~SIZE~0_447, main_~c~0=v_main_~c~0_2342, ~last~0=v_~last~0_452} OutVars{~SIZE~0=v_~SIZE~0_447, main_~c~0=v_main_~c~0_2342, ~last~0=v_~last~0_452} AuxVars[] AssignedVars[] [2021-05-03 00:21:51,952 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:51,953 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:51,955 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:51,972 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:51,976 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:52,029 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:52,063 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2344 v_~SIZE~0_448) (< v_main_~c~0_2344 v_~last~0_453)) InVars {~SIZE~0=v_~SIZE~0_448, main_~c~0=v_main_~c~0_2344, ~last~0=v_~last~0_453} OutVars{~SIZE~0=v_~SIZE~0_448, main_~c~0=v_main_~c~0_2344, ~last~0=v_~last~0_453} AuxVars[] AssignedVars[] [2021-05-03 00:21:52,066 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:52,068 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:52,071 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:52,099 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:52,108 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:52,168 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:52,216 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:52,221 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2346 1) v_~SIZE~0_449) (<= v_~last~0_454 v_main_~c~0_2346)) InVars {~SIZE~0=v_~SIZE~0_449, main_~c~0=v_main_~c~0_2346, ~last~0=v_~last~0_454} OutVars{~SIZE~0=v_~SIZE~0_449, main_~c~0=v_main_~c~0_2346, ~last~0=v_~last~0_454} AuxVars[] AssignedVars[] [2021-05-03 00:21:52,224 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:21:52,263 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:52,266 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:52,289 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:52,295 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:52,334 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:21:52,385 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2348 v_~last~0_455) (< (+ v_main_~c~0_2348 1) v_~SIZE~0_450)) InVars {~SIZE~0=v_~SIZE~0_450, main_~c~0=v_main_~c~0_2348, ~last~0=v_~last~0_455} OutVars{~SIZE~0=v_~SIZE~0_450, main_~c~0=v_main_~c~0_2348, ~last~0=v_~last~0_455} AuxVars[] AssignedVars[] [2021-05-03 00:21:52,388 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:52,419 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:52,422 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:52,457 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:52,470 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:52,505 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:52,544 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:52,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:52,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:52,892 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:53,004 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2021-05-03 00:21:54,377 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:54,378 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1955306006] [2021-05-03 00:21:54,378 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1955306006] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:54,378 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:54,378 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-03 00:21:54,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452102457] [2021-05-03 00:21:54,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-03 00:21:54,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:54,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-03 00:21:54,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1115, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:21:54,379 INFO L87 Difference]: Start difference. First operand 245 states and 280 transitions. Second operand has 35 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 33 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:56,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:56,483 INFO L93 Difference]: Finished difference Result 511 states and 572 transitions. [2021-05-03 00:21:56,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:21:56,485 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 33 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:21:56,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:56,486 INFO L225 Difference]: With dead ends: 511 [2021-05-03 00:21:56,486 INFO L226 Difference]: Without dead ends: 322 [2021-05-03 00:21:56,487 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 22 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 1700.3ms TimeCoverageRelationStatistics Valid=155, Invalid=1251, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:21:56,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-05-03 00:21:56,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 245. [2021-05-03 00:21:56,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 235 states have (on average 1.1446808510638298) internal successors, (269), 235 states have internal predecessors, (269), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:21:56,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 280 transitions. [2021-05-03 00:21:56,902 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 280 transitions. Word has length 67 [2021-05-03 00:21:56,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:56,902 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 280 transitions. [2021-05-03 00:21:56,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 33 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:21:56,902 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 280 transitions. [2021-05-03 00:21:56,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:21:56,902 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:56,902 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:56,903 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable571 [2021-05-03 00:21:56,903 INFO L428 AbstractCegarLoop]: === Iteration 134 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:56,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:56,903 INFO L82 PathProgramCache]: Analyzing trace with hash 2114642109, now seen corresponding path program 99 times [2021-05-03 00:21:56,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:56,903 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1369857476] [2021-05-03 00:21:56,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:56,915 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2367 v_~SIZE~0_451) (<= v_~last~0_456 v_main_~c~0_2367)) InVars {~SIZE~0=v_~SIZE~0_451, main_~c~0=v_main_~c~0_2367, ~last~0=v_~last~0_456} OutVars{~SIZE~0=v_~SIZE~0_451, main_~c~0=v_main_~c~0_2367, ~last~0=v_~last~0_456} AuxVars[] AssignedVars[] [2021-05-03 00:21:56,917 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:56,947 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:56,949 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:56,968 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:56,973 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:57,004 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:57,041 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2369 v_~last~0_457) (< v_main_~c~0_2369 v_~SIZE~0_452)) InVars {~SIZE~0=v_~SIZE~0_452, main_~c~0=v_main_~c~0_2369, ~last~0=v_~last~0_457} OutVars{~SIZE~0=v_~SIZE~0_452, main_~c~0=v_main_~c~0_2369, ~last~0=v_~last~0_457} AuxVars[] AssignedVars[] [2021-05-03 00:21:57,043 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:21:57,069 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:57,072 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:57,095 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:57,104 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:57,131 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:21:57,167 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:57,172 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2371 1) v_~SIZE~0_453) (<= v_~last~0_458 v_main_~c~0_2371)) InVars {~SIZE~0=v_~SIZE~0_453, main_~c~0=v_main_~c~0_2371, ~last~0=v_~last~0_458} OutVars{~SIZE~0=v_~SIZE~0_453, main_~c~0=v_main_~c~0_2371, ~last~0=v_~last~0_458} AuxVars[] AssignedVars[] [2021-05-03 00:21:57,174 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:21:57,175 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:57,178 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:57,197 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:57,206 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:57,262 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:21:57,298 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2373 v_~last~0_459) (< (+ v_main_~c~0_2373 1) v_~SIZE~0_454)) InVars {~SIZE~0=v_~SIZE~0_454, main_~c~0=v_main_~c~0_2373, ~last~0=v_~last~0_459} OutVars{~SIZE~0=v_~SIZE~0_454, main_~c~0=v_main_~c~0_2373, ~last~0=v_~last~0_459} AuxVars[] AssignedVars[] [2021-05-03 00:21:57,300 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:21:57,302 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:57,304 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:57,323 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:21:57,334 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:21:57,378 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:21:57,414 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:57,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:57,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:21:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:57,651 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:59,990 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:59,991 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1369857476] [2021-05-03 00:21:59,991 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1369857476] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:59,991 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:59,991 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-03 00:21:59,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382778087] [2021-05-03 00:21:59,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-03 00:21:59,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:59,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-03 00:21:59,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1180, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:21:59,992 INFO L87 Difference]: Start difference. First operand 245 states and 280 transitions. Second operand has 36 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 34 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:02,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:02,579 INFO L93 Difference]: Finished difference Result 508 states and 569 transitions. [2021-05-03 00:22:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:22:02,582 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 34 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:22:02,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:02,582 INFO L225 Difference]: With dead ends: 508 [2021-05-03 00:22:02,582 INFO L226 Difference]: Without dead ends: 319 [2021-05-03 00:22:02,583 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 21 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 2470.9ms TimeCoverageRelationStatistics Valid=162, Invalid=1320, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:22:02,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-05-03 00:22:02,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 245. [2021-05-03 00:22:02,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 235 states have (on average 1.1446808510638298) internal successors, (269), 235 states have internal predecessors, (269), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:02,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 280 transitions. [2021-05-03 00:22:02,947 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 280 transitions. Word has length 67 [2021-05-03 00:22:02,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:02,947 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 280 transitions. [2021-05-03 00:22:02,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 34 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:02,948 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 280 transitions. [2021-05-03 00:22:02,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:22:02,948 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:02,948 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:02,948 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable576 [2021-05-03 00:22:02,948 INFO L428 AbstractCegarLoop]: === Iteration 135 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:02,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:02,948 INFO L82 PathProgramCache]: Analyzing trace with hash -794121793, now seen corresponding path program 100 times [2021-05-03 00:22:02,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:02,949 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [502885042] [2021-05-03 00:22:02,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:02,959 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_460 v_main_~c~0_2392) (< v_main_~c~0_2392 v_~SIZE~0_455)) InVars {~SIZE~0=v_~SIZE~0_455, main_~c~0=v_main_~c~0_2392, ~last~0=v_~last~0_460} OutVars{~SIZE~0=v_~SIZE~0_455, main_~c~0=v_main_~c~0_2392, ~last~0=v_~last~0_460} AuxVars[] AssignedVars[] [2021-05-03 00:22:02,961 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:02,963 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:02,965 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:02,981 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:02,986 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:03,041 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:03,079 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2394 v_~last~0_461) (< v_main_~c~0_2394 v_~SIZE~0_456)) InVars {~SIZE~0=v_~SIZE~0_456, main_~c~0=v_main_~c~0_2394, ~last~0=v_~last~0_461} OutVars{~SIZE~0=v_~SIZE~0_456, main_~c~0=v_main_~c~0_2394, ~last~0=v_~last~0_461} AuxVars[] AssignedVars[] [2021-05-03 00:22:03,081 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:22:03,105 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:03,107 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:03,131 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:03,139 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:03,167 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:22:03,206 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:03,210 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2396 1) v_~SIZE~0_457) (<= v_~last~0_462 v_main_~c~0_2396)) InVars {~SIZE~0=v_~SIZE~0_457, main_~c~0=v_main_~c~0_2396, ~last~0=v_~last~0_462} OutVars{~SIZE~0=v_~SIZE~0_457, main_~c~0=v_main_~c~0_2396, ~last~0=v_~last~0_462} AuxVars[] AssignedVars[] [2021-05-03 00:22:03,212 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:22:03,243 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:03,246 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:03,266 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:03,271 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:03,303 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:22:03,344 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2398 1) v_~SIZE~0_458) (< v_main_~c~0_2398 v_~last~0_463)) InVars {~SIZE~0=v_~SIZE~0_458, main_~c~0=v_main_~c~0_2398, ~last~0=v_~last~0_463} OutVars{~SIZE~0=v_~SIZE~0_458, main_~c~0=v_main_~c~0_2398, ~last~0=v_~last~0_463} AuxVars[] AssignedVars[] [2021-05-03 00:22:03,346 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:03,348 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:03,350 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:03,377 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:03,389 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:03,441 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:03,480 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:03,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:03,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:22:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:03,764 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:22:06,239 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:06,240 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [502885042] [2021-05-03 00:22:06,240 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [502885042] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:06,240 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:06,240 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-03 00:22:06,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980744056] [2021-05-03 00:22:06,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-03 00:22:06,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:06,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-03 00:22:06,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1247, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:22:06,241 INFO L87 Difference]: Start difference. First operand 245 states and 280 transitions. Second operand has 37 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 35 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:08,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:08,483 INFO L93 Difference]: Finished difference Result 505 states and 566 transitions. [2021-05-03 00:22:08,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-03 00:22:08,485 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 35 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:22:08,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:08,485 INFO L225 Difference]: With dead ends: 505 [2021-05-03 00:22:08,485 INFO L226 Difference]: Without dead ends: 316 [2021-05-03 00:22:08,486 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 7 SyntacticMatches, 19 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 2650.7ms TimeCoverageRelationStatistics Valid=169, Invalid=1391, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:22:08,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-05-03 00:22:08,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 245. [2021-05-03 00:22:08,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 235 states have (on average 1.1446808510638298) internal successors, (269), 235 states have internal predecessors, (269), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 280 transitions. [2021-05-03 00:22:08,805 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 280 transitions. Word has length 67 [2021-05-03 00:22:08,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:08,805 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 280 transitions. [2021-05-03 00:22:08,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 35 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:08,805 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 280 transitions. [2021-05-03 00:22:08,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:22:08,806 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:08,806 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:08,806 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable581 [2021-05-03 00:22:08,806 INFO L428 AbstractCegarLoop]: === Iteration 136 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:08,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:08,806 INFO L82 PathProgramCache]: Analyzing trace with hash -732082179, now seen corresponding path program 101 times [2021-05-03 00:22:08,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:08,806 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1737019096] [2021-05-03 00:22:08,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:08,813 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2417 v_~SIZE~0_459) (<= v_~last~0_464 v_main_~c~0_2417)) InVars {~SIZE~0=v_~SIZE~0_459, main_~c~0=v_main_~c~0_2417, ~last~0=v_~last~0_464} OutVars{~SIZE~0=v_~SIZE~0_459, main_~c~0=v_main_~c~0_2417, ~last~0=v_~last~0_464} AuxVars[] AssignedVars[] [2021-05-03 00:22:08,814 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:08,831 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:08,832 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:08,842 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:08,845 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:08,860 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:08,882 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2419 v_~last~0_465) (< v_main_~c~0_2419 v_~SIZE~0_460)) InVars {~SIZE~0=v_~SIZE~0_460, main_~c~0=v_main_~c~0_2419, ~last~0=v_~last~0_465} OutVars{~SIZE~0=v_~SIZE~0_460, main_~c~0=v_main_~c~0_2419, ~last~0=v_~last~0_465} AuxVars[] AssignedVars[] [2021-05-03 00:22:08,883 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:22:08,884 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:08,886 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:08,898 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:08,903 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:08,928 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:22:08,948 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:08,950 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_466 v_main_~c~0_2421) (< (+ v_main_~c~0_2421 1) v_~SIZE~0_461)) InVars {~SIZE~0=v_~SIZE~0_461, main_~c~0=v_main_~c~0_2421, ~last~0=v_~last~0_466} OutVars{~SIZE~0=v_~SIZE~0_461, main_~c~0=v_main_~c~0_2421, ~last~0=v_~last~0_466} AuxVars[] AssignedVars[] [2021-05-03 00:22:08,951 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:22:08,952 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:08,953 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:08,963 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:08,966 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:08,998 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:22:09,021 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2423 1) v_~SIZE~0_462) (< v_main_~c~0_2423 v_~last~0_467)) InVars {~SIZE~0=v_~SIZE~0_462, main_~c~0=v_main_~c~0_2423, ~last~0=v_~last~0_467} OutVars{~SIZE~0=v_~SIZE~0_462, main_~c~0=v_main_~c~0_2423, ~last~0=v_~last~0_467} AuxVars[] AssignedVars[] [2021-05-03 00:22:09,022 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:09,023 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:09,025 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:09,038 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:09,043 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:09,070 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:09,091 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:09,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:09,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:22:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:09,243 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:22:10,652 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:10,652 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1737019096] [2021-05-03 00:22:10,652 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1737019096] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:10,652 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:10,653 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-03 00:22:10,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296669631] [2021-05-03 00:22:10,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-03 00:22:10,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:10,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-03 00:22:10,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1316, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:22:10,653 INFO L87 Difference]: Start difference. First operand 245 states and 280 transitions. Second operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 36 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:12,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:12,314 INFO L93 Difference]: Finished difference Result 502 states and 563 transitions. [2021-05-03 00:22:12,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-03 00:22:12,315 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 36 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:22:12,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:12,316 INFO L225 Difference]: With dead ends: 502 [2021-05-03 00:22:12,316 INFO L226 Difference]: Without dead ends: 313 [2021-05-03 00:22:12,316 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 7 SyntacticMatches, 18 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1506.9ms TimeCoverageRelationStatistics Valid=176, Invalid=1464, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:22:12,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-05-03 00:22:12,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 245. [2021-05-03 00:22:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 235 states have (on average 1.1446808510638298) internal successors, (269), 235 states have internal predecessors, (269), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 280 transitions. [2021-05-03 00:22:12,630 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 280 transitions. Word has length 67 [2021-05-03 00:22:12,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:12,630 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 280 transitions. [2021-05-03 00:22:12,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 36 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 280 transitions. [2021-05-03 00:22:12,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:22:12,631 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:12,631 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:12,631 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable586 [2021-05-03 00:22:12,631 INFO L428 AbstractCegarLoop]: === Iteration 137 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:12,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:12,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1757446783, now seen corresponding path program 102 times [2021-05-03 00:22:12,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:12,631 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [804360461] [2021-05-03 00:22:12,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:12,639 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_468 v_main_~c~0_2442) (< v_main_~c~0_2442 v_~SIZE~0_463)) InVars {~SIZE~0=v_~SIZE~0_463, main_~c~0=v_main_~c~0_2442, ~last~0=v_~last~0_468} OutVars{~SIZE~0=v_~SIZE~0_463, main_~c~0=v_main_~c~0_2442, ~last~0=v_~last~0_468} AuxVars[] AssignedVars[] [2021-05-03 00:22:12,640 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:12,641 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:12,642 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:12,652 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:12,655 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:12,685 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:12,707 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2444 v_~last~0_469) (< v_main_~c~0_2444 v_~SIZE~0_464)) InVars {~SIZE~0=v_~SIZE~0_464, main_~c~0=v_main_~c~0_2444, ~last~0=v_~last~0_469} OutVars{~SIZE~0=v_~SIZE~0_464, main_~c~0=v_main_~c~0_2444, ~last~0=v_~last~0_469} AuxVars[] AssignedVars[] [2021-05-03 00:22:12,708 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:22:12,721 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:12,723 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:12,735 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:12,740 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:12,754 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:22:12,776 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:12,778 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2446 1) v_~SIZE~0_465) (<= v_~last~0_470 v_main_~c~0_2446)) InVars {~SIZE~0=v_~SIZE~0_465, main_~c~0=v_main_~c~0_2446, ~last~0=v_~last~0_470} OutVars{~SIZE~0=v_~SIZE~0_465, main_~c~0=v_main_~c~0_2446, ~last~0=v_~last~0_470} AuxVars[] AssignedVars[] [2021-05-03 00:22:12,779 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:22:12,795 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:12,796 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:12,806 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:12,809 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:12,824 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:22:12,847 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2448 1) v_~SIZE~0_466) (< v_main_~c~0_2448 v_~last~0_471)) InVars {~SIZE~0=v_~SIZE~0_466, main_~c~0=v_main_~c~0_2448, ~last~0=v_~last~0_471} OutVars{~SIZE~0=v_~SIZE~0_466, main_~c~0=v_main_~c~0_2448, ~last~0=v_~last~0_471} AuxVars[] AssignedVars[] [2021-05-03 00:22:12,848 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:12,861 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:12,862 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:12,876 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:12,881 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:12,896 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:12,916 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:13,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:13,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:22:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:13,067 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:22:14,520 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:14,521 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [804360461] [2021-05-03 00:22:14,521 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [804360461] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:14,521 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:14,521 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-03 00:22:14,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2426708] [2021-05-03 00:22:14,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-03 00:22:14,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:14,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-03 00:22:14,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1387, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:22:14,522 INFO L87 Difference]: Start difference. First operand 245 states and 280 transitions. Second operand has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 37 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:16,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:16,858 INFO L93 Difference]: Finished difference Result 499 states and 560 transitions. [2021-05-03 00:22:16,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-03 00:22:16,860 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 37 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:22:16,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:16,861 INFO L225 Difference]: With dead ends: 499 [2021-05-03 00:22:16,861 INFO L226 Difference]: Without dead ends: 310 [2021-05-03 00:22:16,861 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 18 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 1564.8ms TimeCoverageRelationStatistics Valid=183, Invalid=1539, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:22:16,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-05-03 00:22:17,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 245. [2021-05-03 00:22:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 235 states have (on average 1.1446808510638298) internal successors, (269), 235 states have internal predecessors, (269), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:17,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 280 transitions. [2021-05-03 00:22:17,178 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 280 transitions. Word has length 67 [2021-05-03 00:22:17,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:17,178 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 280 transitions. [2021-05-03 00:22:17,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 37 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:17,178 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 280 transitions. [2021-05-03 00:22:17,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:22:17,179 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:17,179 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:17,179 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable591 [2021-05-03 00:22:17,179 INFO L428 AbstractCegarLoop]: === Iteration 138 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:17,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:17,179 INFO L82 PathProgramCache]: Analyzing trace with hash 939798333, now seen corresponding path program 103 times [2021-05-03 00:22:17,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:17,179 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1504580804] [2021-05-03 00:22:17,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:17,187 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_472 v_main_~c~0_2467) (< v_main_~c~0_2467 v_~SIZE~0_467)) InVars {~SIZE~0=v_~SIZE~0_467, main_~c~0=v_main_~c~0_2467, ~last~0=v_~last~0_472} OutVars{~SIZE~0=v_~SIZE~0_467, main_~c~0=v_main_~c~0_2467, ~last~0=v_~last~0_472} AuxVars[] AssignedVars[] [2021-05-03 00:22:17,191 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:17,196 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:17,201 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:17,213 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:17,216 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:17,251 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:17,273 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2469 v_~last~0_473) (< v_main_~c~0_2469 v_~SIZE~0_468)) InVars {~SIZE~0=v_~SIZE~0_468, main_~c~0=v_main_~c~0_2469, ~last~0=v_~last~0_473} OutVars{~SIZE~0=v_~SIZE~0_468, main_~c~0=v_main_~c~0_2469, ~last~0=v_~last~0_473} AuxVars[] AssignedVars[] [2021-05-03 00:22:17,274 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:22:17,275 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:17,276 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:17,290 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:17,295 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:17,319 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:22:17,342 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:17,344 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_474 v_main_~c~0_2471) (< (+ v_main_~c~0_2471 1) v_~SIZE~0_469)) InVars {~SIZE~0=v_~SIZE~0_469, main_~c~0=v_main_~c~0_2471, ~last~0=v_~last~0_474} OutVars{~SIZE~0=v_~SIZE~0_469, main_~c~0=v_main_~c~0_2471, ~last~0=v_~last~0_474} AuxVars[] AssignedVars[] [2021-05-03 00:22:17,345 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:22:17,346 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:17,347 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:17,357 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:17,360 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:17,393 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:22:17,414 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2473 1) v_~SIZE~0_470) (< v_main_~c~0_2473 v_~last~0_475)) InVars {~SIZE~0=v_~SIZE~0_470, main_~c~0=v_main_~c~0_2473, ~last~0=v_~last~0_475} OutVars{~SIZE~0=v_~SIZE~0_470, main_~c~0=v_main_~c~0_2473, ~last~0=v_~last~0_475} AuxVars[] AssignedVars[] [2021-05-03 00:22:17,416 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:17,416 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:17,418 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:17,431 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:17,435 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:17,461 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:17,483 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:17,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:17,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:22:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:17,630 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:22:19,073 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:19,073 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1504580804] [2021-05-03 00:22:19,073 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1504580804] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:19,073 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:19,073 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-03 00:22:19,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234560442] [2021-05-03 00:22:19,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-03 00:22:19,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:19,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-03 00:22:19,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1460, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:22:19,074 INFO L87 Difference]: Start difference. First operand 245 states and 280 transitions. Second operand has 40 states, 40 states have (on average 1.525) internal successors, (61), 38 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:21,879 INFO L93 Difference]: Finished difference Result 496 states and 557 transitions. [2021-05-03 00:22:21,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-03 00:22:21,881 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.525) internal successors, (61), 38 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:22:21,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:21,882 INFO L225 Difference]: With dead ends: 496 [2021-05-03 00:22:21,882 INFO L226 Difference]: Without dead ends: 307 [2021-05-03 00:22:21,883 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 8 SyntacticMatches, 15 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1563.9ms TimeCoverageRelationStatistics Valid=190, Invalid=1616, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:22:21,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-05-03 00:22:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 245. [2021-05-03 00:22:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 235 states have (on average 1.1446808510638298) internal successors, (269), 235 states have internal predecessors, (269), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 280 transitions. [2021-05-03 00:22:22,454 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 280 transitions. Word has length 67 [2021-05-03 00:22:22,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:22,454 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 280 transitions. [2021-05-03 00:22:22,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 1.525) internal successors, (61), 38 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 280 transitions. [2021-05-03 00:22:22,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:22:22,455 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:22,455 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:22,455 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable596 [2021-05-03 00:22:22,455 INFO L428 AbstractCegarLoop]: === Iteration 139 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:22,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:22,456 INFO L82 PathProgramCache]: Analyzing trace with hash -648549569, now seen corresponding path program 104 times [2021-05-03 00:22:22,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:22,456 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1854001943] [2021-05-03 00:22:22,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:22,473 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_476 v_main_~c~0_2492) (< v_main_~c~0_2492 v_~SIZE~0_471)) InVars {~SIZE~0=v_~SIZE~0_471, main_~c~0=v_main_~c~0_2492, ~last~0=v_~last~0_476} OutVars{~SIZE~0=v_~SIZE~0_471, main_~c~0=v_main_~c~0_2492, ~last~0=v_~last~0_476} AuxVars[] AssignedVars[] [2021-05-03 00:22:22,477 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:22,521 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:22,524 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:22,555 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:22,562 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:22,604 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:22,679 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2494 v_~SIZE~0_472) (< v_main_~c~0_2494 v_~last~0_477)) InVars {~SIZE~0=v_~SIZE~0_472, main_~c~0=v_main_~c~0_2494, ~last~0=v_~last~0_477} OutVars{~SIZE~0=v_~SIZE~0_472, main_~c~0=v_main_~c~0_2494, ~last~0=v_~last~0_477} AuxVars[] AssignedVars[] [2021-05-03 00:22:22,682 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:22:22,684 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:22,688 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:22,736 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:22,750 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:22,824 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:22:22,891 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:22,896 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_478 v_main_~c~0_2496) (< (+ v_main_~c~0_2496 1) v_~SIZE~0_473)) InVars {~SIZE~0=v_~SIZE~0_473, main_~c~0=v_main_~c~0_2496, ~last~0=v_~last~0_478} OutVars{~SIZE~0=v_~SIZE~0_473, main_~c~0=v_main_~c~0_2496, ~last~0=v_~last~0_478} AuxVars[] AssignedVars[] [2021-05-03 00:22:22,900 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:22:22,948 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:22,952 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:22,983 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:22,991 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:23,040 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:22:23,138 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2498 v_~last~0_479) (< (+ v_main_~c~0_2498 1) v_~SIZE~0_474)) InVars {~SIZE~0=v_~SIZE~0_474, main_~c~0=v_main_~c~0_2498, ~last~0=v_~last~0_479} OutVars{~SIZE~0=v_~SIZE~0_474, main_~c~0=v_main_~c~0_2498, ~last~0=v_~last~0_479} AuxVars[] AssignedVars[] [2021-05-03 00:22:23,141 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:23,143 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:23,148 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:23,191 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:23,205 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:23,279 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:23,353 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:23,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:23,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:22:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:23,754 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:22:23,875 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2021-05-03 00:22:26,655 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:26,655 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1854001943] [2021-05-03 00:22:26,655 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1854001943] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:26,655 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:26,656 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-05-03 00:22:26,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897507100] [2021-05-03 00:22:26,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-05-03 00:22:26,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:26,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-05-03 00:22:26,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1535, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:22:26,657 INFO L87 Difference]: Start difference. First operand 245 states and 280 transitions. Second operand has 41 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 39 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:28,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:28,975 INFO L93 Difference]: Finished difference Result 493 states and 554 transitions. [2021-05-03 00:22:28,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-03 00:22:28,976 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 39 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:22:28,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:28,977 INFO L225 Difference]: With dead ends: 493 [2021-05-03 00:22:28,977 INFO L226 Difference]: Without dead ends: 304 [2021-05-03 00:22:28,978 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 16 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 3133.5ms TimeCoverageRelationStatistics Valid=197, Invalid=1695, Unknown=0, NotChecked=0, Total=1892 [2021-05-03 00:22:28,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-05-03 00:22:29,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 245. [2021-05-03 00:22:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 235 states have (on average 1.1446808510638298) internal successors, (269), 235 states have internal predecessors, (269), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:29,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 280 transitions. [2021-05-03 00:22:29,296 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 280 transitions. Word has length 67 [2021-05-03 00:22:29,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:29,296 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 280 transitions. [2021-05-03 00:22:29,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 41 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 39 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:29,297 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 280 transitions. [2021-05-03 00:22:29,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:22:29,297 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:29,297 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 14, 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-03 00:22:29,297 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable601 [2021-05-03 00:22:29,297 INFO L428 AbstractCegarLoop]: === Iteration 140 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:29,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:29,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1659666819, now seen corresponding path program 105 times [2021-05-03 00:22:29,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:29,297 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1887293323] [2021-05-03 00:22:29,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:29,304 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_480 v_main_~c~0_2517) (< v_main_~c~0_2517 v_~SIZE~0_475)) InVars {~SIZE~0=v_~SIZE~0_475, main_~c~0=v_main_~c~0_2517, ~last~0=v_~last~0_480} OutVars{~SIZE~0=v_~SIZE~0_475, main_~c~0=v_main_~c~0_2517, ~last~0=v_~last~0_480} AuxVars[] AssignedVars[] [2021-05-03 00:22:29,306 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:29,323 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:29,324 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:29,336 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:29,339 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:29,356 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:29,379 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2519 v_~last~0_481) (< v_main_~c~0_2519 v_~SIZE~0_476)) InVars {~SIZE~0=v_~SIZE~0_476, main_~c~0=v_main_~c~0_2519, ~last~0=v_~last~0_481} OutVars{~SIZE~0=v_~SIZE~0_476, main_~c~0=v_main_~c~0_2519, ~last~0=v_~last~0_481} AuxVars[] AssignedVars[] [2021-05-03 00:22:29,381 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:22:29,398 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:29,400 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:29,413 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:29,417 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:29,432 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:22:29,452 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:29,453 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2521 v_~last~0_482) (< (+ v_main_~c~0_2521 1) v_~SIZE~0_477)) InVars {~SIZE~0=v_~SIZE~0_477, main_~c~0=v_main_~c~0_2521, ~last~0=v_~last~0_482} OutVars{~SIZE~0=v_~SIZE~0_477, main_~c~0=v_main_~c~0_2521, ~last~0=v_~last~0_482} AuxVars[] AssignedVars[] [2021-05-03 00:22:29,455 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:29,467 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:29,469 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:29,481 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:29,486 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:29,501 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:29,521 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:29,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:29,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:22:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:29,672 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:22:31,269 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:31,269 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1887293323] [2021-05-03 00:22:31,269 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1887293323] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:31,269 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:31,269 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-03 00:22:31,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332414202] [2021-05-03 00:22:31,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-03 00:22:31,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:31,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-03 00:22:31,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1612, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:22:31,270 INFO L87 Difference]: Start difference. First operand 245 states and 280 transitions. Second operand has 42 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 40 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:33,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:33,100 INFO L93 Difference]: Finished difference Result 492 states and 554 transitions. [2021-05-03 00:22:33,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-03 00:22:33,102 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 40 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:22:33,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:33,103 INFO L225 Difference]: With dead ends: 492 [2021-05-03 00:22:33,103 INFO L226 Difference]: Without dead ends: 303 [2021-05-03 00:22:33,103 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 15 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 1699.3ms TimeCoverageRelationStatistics Valid=204, Invalid=1776, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:22:33,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-05-03 00:22:33,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 246. [2021-05-03 00:22:33,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 236 states have (on average 1.1483050847457628) internal successors, (271), 236 states have internal predecessors, (271), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 282 transitions. [2021-05-03 00:22:33,500 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 282 transitions. Word has length 67 [2021-05-03 00:22:33,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:33,500 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 282 transitions. [2021-05-03 00:22:33,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 40 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:33,501 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 282 transitions. [2021-05-03 00:22:33,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:22:33,501 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:33,501 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:33,501 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable605 [2021-05-03 00:22:33,501 INFO L428 AbstractCegarLoop]: === Iteration 141 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:33,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:33,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1825207169, now seen corresponding path program 15 times [2021-05-03 00:22:33,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:33,501 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [938933705] [2021-05-03 00:22:33,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:33,508 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2540 v_~last~0_483) (< v_main_~c~0_2540 v_~SIZE~0_478)) InVars {~SIZE~0=v_~SIZE~0_478, main_~c~0=v_main_~c~0_2540, ~last~0=v_~last~0_483} OutVars{~SIZE~0=v_~SIZE~0_478, main_~c~0=v_main_~c~0_2540, ~last~0=v_~last~0_483} AuxVars[] AssignedVars[] [2021-05-03 00:22:33,510 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:22:33,511 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:33,513 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:33,541 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:33,552 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:33,601 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:22:33,637 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:22:33,639 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2542 v_~last~0_484) (< (+ v_main_~c~0_2542 1) v_~SIZE~0_479)) InVars {~SIZE~0=v_~SIZE~0_479, main_~c~0=v_main_~c~0_2542, ~last~0=v_~last~0_484} OutVars{~SIZE~0=v_~SIZE~0_479, main_~c~0=v_main_~c~0_2542, ~last~0=v_~last~0_484} AuxVars[] AssignedVars[] [2021-05-03 00:22:33,642 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:33,643 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:33,646 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:33,673 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:33,685 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:33,727 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:33,753 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:22:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:33,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:33,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:22:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:33,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:36,220 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:36,221 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [938933705] [2021-05-03 00:22:36,221 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [938933705] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:36,221 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:36,221 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-03 00:22:36,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522465768] [2021-05-03 00:22:36,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-03 00:22:36,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:36,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-03 00:22:36,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1684, Unknown=0, NotChecked=0, Total=1892 [2021-05-03 00:22:36,222 INFO L87 Difference]: Start difference. First operand 246 states and 282 transitions. Second operand has 42 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 40 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:39,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:39,016 INFO L93 Difference]: Finished difference Result 506 states and 569 transitions. [2021-05-03 00:22:39,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-05-03 00:22:39,018 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 40 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2021-05-03 00:22:39,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:39,019 INFO L225 Difference]: With dead ends: 506 [2021-05-03 00:22:39,019 INFO L226 Difference]: Without dead ends: 317 [2021-05-03 00:22:39,019 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 6 SyntacticMatches, 14 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 3046.4ms TimeCoverageRelationStatistics Valid=338, Invalid=3322, Unknown=0, NotChecked=0, Total=3660 [2021-05-03 00:22:39,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-05-03 00:22:39,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 248. [2021-05-03 00:22:39,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 238 states have (on average 1.1470588235294117) internal successors, (273), 238 states have internal predecessors, (273), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 284 transitions. [2021-05-03 00:22:39,342 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 284 transitions. Word has length 67 [2021-05-03 00:22:39,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:39,342 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 284 transitions. [2021-05-03 00:22:39,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 40 states have internal predecessors, (61), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:39,342 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 284 transitions. [2021-05-03 00:22:39,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:22:39,342 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:39,342 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:39,342 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable608 [2021-05-03 00:22:39,342 INFO L428 AbstractCegarLoop]: === Iteration 142 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:39,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:39,343 INFO L82 PathProgramCache]: Analyzing trace with hash -940321762, now seen corresponding path program 16 times [2021-05-03 00:22:39,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:39,343 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [337543939] [2021-05-03 00:22:39,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:39,348 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_485 v_main_~c~0_2560) (< v_main_~c~0_2560 v_~SIZE~0_480)) InVars {~SIZE~0=v_~SIZE~0_480, main_~c~0=v_main_~c~0_2560, ~last~0=v_~last~0_485} OutVars{~SIZE~0=v_~SIZE~0_480, main_~c~0=v_main_~c~0_2560, ~last~0=v_~last~0_485} AuxVars[] AssignedVars[] [2021-05-03 00:22:39,349 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:39,350 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:39,352 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:39,371 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:39,374 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:39,402 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:39,425 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:22:39,427 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_486 v_main_~c~0_2562) (< (+ v_main_~c~0_2562 1) v_~SIZE~0_481)) InVars {~SIZE~0=v_~SIZE~0_481, main_~c~0=v_main_~c~0_2562, ~last~0=v_~last~0_486} OutVars{~SIZE~0=v_~SIZE~0_481, main_~c~0=v_main_~c~0_2562, ~last~0=v_~last~0_486} AuxVars[] AssignedVars[] [2021-05-03 00:22:39,428 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:22:39,445 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:39,446 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:39,459 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:39,461 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:39,478 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:22:39,500 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:22:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:39,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:39,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:22:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:39,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:41,027 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:41,027 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [337543939] [2021-05-03 00:22:41,027 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [337543939] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:41,027 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:41,027 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:22:41,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328295596] [2021-05-03 00:22:41,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:22:41,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:41,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:22:41,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:22:41,028 INFO L87 Difference]: Start difference. First operand 248 states and 284 transitions. Second operand has 29 states, 29 states have (on average 2.206896551724138) internal successors, (64), 27 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:42,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:42,958 INFO L93 Difference]: Finished difference Result 535 states and 597 transitions. [2021-05-03 00:22:42,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:22:42,959 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.206896551724138) internal successors, (64), 27 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:22:42,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:42,960 INFO L225 Difference]: With dead ends: 535 [2021-05-03 00:22:42,960 INFO L226 Difference]: Without dead ends: 346 [2021-05-03 00:22:42,960 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 31 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1489.0ms TimeCoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:22:42,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-05-03 00:22:43,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 251. [2021-05-03 00:22:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 241 states have (on average 1.1452282157676348) internal successors, (276), 241 states have internal predecessors, (276), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 287 transitions. [2021-05-03 00:22:43,311 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 287 transitions. Word has length 70 [2021-05-03 00:22:43,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:43,311 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 287 transitions. [2021-05-03 00:22:43,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 2.206896551724138) internal successors, (64), 27 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:43,312 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 287 transitions. [2021-05-03 00:22:43,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:22:43,312 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:43,312 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 15, 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-03 00:22:43,312 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable611 [2021-05-03 00:22:43,312 INFO L428 AbstractCegarLoop]: === Iteration 143 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:43,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:43,312 INFO L82 PathProgramCache]: Analyzing trace with hash -899647012, now seen corresponding path program 106 times [2021-05-03 00:22:43,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:43,313 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1017904065] [2021-05-03 00:22:43,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:43,320 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2581 v_~SIZE~0_482) (<= v_~last~0_487 v_main_~c~0_2581)) InVars {~SIZE~0=v_~SIZE~0_482, main_~c~0=v_main_~c~0_2581, ~last~0=v_~last~0_487} OutVars{~SIZE~0=v_~SIZE~0_482, main_~c~0=v_main_~c~0_2581, ~last~0=v_~last~0_487} AuxVars[] AssignedVars[] [2021-05-03 00:22:43,321 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:43,322 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:43,323 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:43,334 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:43,337 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:43,368 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:43,392 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2583 v_~last~0_488) (< v_main_~c~0_2583 v_~SIZE~0_483)) InVars {~SIZE~0=v_~SIZE~0_483, main_~c~0=v_main_~c~0_2583, ~last~0=v_~last~0_488} OutVars{~SIZE~0=v_~SIZE~0_483, main_~c~0=v_main_~c~0_2583, ~last~0=v_~last~0_488} AuxVars[] AssignedVars[] [2021-05-03 00:22:43,394 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:22:43,395 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:43,396 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:43,414 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:43,420 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:43,446 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:22:43,468 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:43,470 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_489 v_main_~c~0_2585) (< (+ v_main_~c~0_2585 1) v_~SIZE~0_484)) InVars {~SIZE~0=v_~SIZE~0_484, main_~c~0=v_main_~c~0_2585, ~last~0=v_~last~0_489} OutVars{~SIZE~0=v_~SIZE~0_484, main_~c~0=v_main_~c~0_2585, ~last~0=v_~last~0_489} AuxVars[] AssignedVars[] [2021-05-03 00:22:43,472 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:22:43,472 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:43,474 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:43,484 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:43,487 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:43,518 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:22:43,541 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2587 v_~last~0_490) (< (+ v_main_~c~0_2587 1) v_~SIZE~0_485)) InVars {~SIZE~0=v_~SIZE~0_485, main_~c~0=v_main_~c~0_2587, ~last~0=v_~last~0_490} OutVars{~SIZE~0=v_~SIZE~0_485, main_~c~0=v_main_~c~0_2587, ~last~0=v_~last~0_490} AuxVars[] AssignedVars[] [2021-05-03 00:22:43,542 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:43,543 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:43,544 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:43,559 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:43,564 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:43,591 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:43,615 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:43,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:43,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:22:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:43,785 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:22:45,224 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:45,225 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1017904065] [2021-05-03 00:22:45,225 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1017904065] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:45,225 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:45,225 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:22:45,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898053677] [2021-05-03 00:22:45,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:22:45,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:45,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:22:45,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:22:45,226 INFO L87 Difference]: Start difference. First operand 251 states and 287 transitions. Second operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 28 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:47,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:47,348 INFO L93 Difference]: Finished difference Result 538 states and 600 transitions. [2021-05-03 00:22:47,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:22:47,349 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 28 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:22:47,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:47,350 INFO L225 Difference]: With dead ends: 538 [2021-05-03 00:22:47,350 INFO L226 Difference]: Without dead ends: 349 [2021-05-03 00:22:47,350 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 30 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1545.7ms TimeCoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:22:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-05-03 00:22:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 251. [2021-05-03 00:22:47,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 241 states have (on average 1.1452282157676348) internal successors, (276), 241 states have internal predecessors, (276), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:47,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 287 transitions. [2021-05-03 00:22:47,724 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 287 transitions. Word has length 70 [2021-05-03 00:22:47,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:47,724 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 287 transitions. [2021-05-03 00:22:47,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 28 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 287 transitions. [2021-05-03 00:22:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:22:47,724 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:47,724 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:47,724 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable616 [2021-05-03 00:22:47,724 INFO L428 AbstractCegarLoop]: === Iteration 144 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:47,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:47,725 INFO L82 PathProgramCache]: Analyzing trace with hash -455746338, now seen corresponding path program 107 times [2021-05-03 00:22:47,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:47,728 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2003550221] [2021-05-03 00:22:47,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:47,739 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2607 v_~SIZE~0_486) (<= v_~last~0_491 v_main_~c~0_2607)) InVars {~SIZE~0=v_~SIZE~0_486, main_~c~0=v_main_~c~0_2607, ~last~0=v_~last~0_491} OutVars{~SIZE~0=v_~SIZE~0_486, main_~c~0=v_main_~c~0_2607, ~last~0=v_~last~0_491} AuxVars[] AssignedVars[] [2021-05-03 00:22:47,741 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:47,759 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:47,772 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:47,784 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:47,787 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:47,806 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:47,831 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2609 v_~SIZE~0_487) (< v_main_~c~0_2609 v_~last~0_492)) InVars {~SIZE~0=v_~SIZE~0_487, main_~c~0=v_main_~c~0_2609, ~last~0=v_~last~0_492} OutVars{~SIZE~0=v_~SIZE~0_487, main_~c~0=v_main_~c~0_2609, ~last~0=v_~last~0_492} AuxVars[] AssignedVars[] [2021-05-03 00:22:47,832 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:22:47,833 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:47,834 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:47,849 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:47,855 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:47,882 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:22:47,903 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:47,905 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2611 1) v_~SIZE~0_488) (<= v_~last~0_493 v_main_~c~0_2611)) InVars {~SIZE~0=v_~SIZE~0_488, main_~c~0=v_main_~c~0_2611, ~last~0=v_~last~0_493} OutVars{~SIZE~0=v_~SIZE~0_488, main_~c~0=v_main_~c~0_2611, ~last~0=v_~last~0_493} AuxVars[] AssignedVars[] [2021-05-03 00:22:47,906 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:22:47,923 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:47,924 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:47,935 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:47,938 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:47,955 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:22:47,978 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2613 1) v_~SIZE~0_489) (< v_main_~c~0_2613 v_~last~0_494)) InVars {~SIZE~0=v_~SIZE~0_489, main_~c~0=v_main_~c~0_2613, ~last~0=v_~last~0_494} OutVars{~SIZE~0=v_~SIZE~0_489, main_~c~0=v_main_~c~0_2613, ~last~0=v_~last~0_494} AuxVars[] AssignedVars[] [2021-05-03 00:22:47,980 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:47,980 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:47,982 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:47,996 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:48,001 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:48,027 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:48,048 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:48,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:48,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:22:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:48,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:48,266 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:22:50,508 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:50,508 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2003550221] [2021-05-03 00:22:50,508 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2003550221] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:50,508 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:50,508 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:22:50,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069269860] [2021-05-03 00:22:50,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:22:50,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:50,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:22:50,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:22:50,509 INFO L87 Difference]: Start difference. First operand 251 states and 287 transitions. Second operand has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 29 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:53,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:53,283 INFO L93 Difference]: Finished difference Result 535 states and 597 transitions. [2021-05-03 00:22:53,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:22:53,285 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 29 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:22:53,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:53,286 INFO L225 Difference]: With dead ends: 535 [2021-05-03 00:22:53,286 INFO L226 Difference]: Without dead ends: 346 [2021-05-03 00:22:53,286 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 29 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 2337.9ms TimeCoverageRelationStatistics Valid=124, Invalid=998, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:22:53,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-05-03 00:22:53,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 251. [2021-05-03 00:22:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 241 states have (on average 1.1452282157676348) internal successors, (276), 241 states have internal predecessors, (276), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:53,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 287 transitions. [2021-05-03 00:22:53,723 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 287 transitions. Word has length 70 [2021-05-03 00:22:53,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:53,723 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 287 transitions. [2021-05-03 00:22:53,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 29 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:53,723 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 287 transitions. [2021-05-03 00:22:53,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:22:53,723 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:53,723 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 13, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:53,724 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable621 [2021-05-03 00:22:53,724 INFO L428 AbstractCegarLoop]: === Iteration 145 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:53,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:53,724 INFO L82 PathProgramCache]: Analyzing trace with hash -936826596, now seen corresponding path program 108 times [2021-05-03 00:22:53,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:53,724 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1939314875] [2021-05-03 00:22:53,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:53,738 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_495 v_main_~c~0_2633) (< v_main_~c~0_2633 v_~SIZE~0_490)) InVars {~SIZE~0=v_~SIZE~0_490, main_~c~0=v_main_~c~0_2633, ~last~0=v_~last~0_495} OutVars{~SIZE~0=v_~SIZE~0_490, main_~c~0=v_main_~c~0_2633, ~last~0=v_~last~0_495} AuxVars[] AssignedVars[] [2021-05-03 00:22:53,741 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:53,773 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:53,775 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:53,804 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:53,810 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:53,850 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:53,907 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2635 v_~SIZE~0_491) (< v_main_~c~0_2635 v_~last~0_496)) InVars {~SIZE~0=v_~SIZE~0_491, main_~c~0=v_main_~c~0_2635, ~last~0=v_~last~0_496} OutVars{~SIZE~0=v_~SIZE~0_491, main_~c~0=v_main_~c~0_2635, ~last~0=v_~last~0_496} AuxVars[] AssignedVars[] [2021-05-03 00:22:53,910 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:22:53,936 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:53,939 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:53,966 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:53,976 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:54,007 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:22:54,049 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:54,052 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_497 v_main_~c~0_2637) (< (+ v_main_~c~0_2637 1) v_~SIZE~0_492)) InVars {~SIZE~0=v_~SIZE~0_492, main_~c~0=v_main_~c~0_2637, ~last~0=v_~last~0_497} OutVars{~SIZE~0=v_~SIZE~0_492, main_~c~0=v_main_~c~0_2637, ~last~0=v_~last~0_497} AuxVars[] AssignedVars[] [2021-05-03 00:22:54,055 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:22:54,057 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:54,059 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:54,079 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:54,085 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:54,140 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:22:54,184 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2639 v_~last~0_498) (< (+ v_main_~c~0_2639 1) v_~SIZE~0_493)) InVars {~SIZE~0=v_~SIZE~0_493, main_~c~0=v_main_~c~0_2639, ~last~0=v_~last~0_498} OutVars{~SIZE~0=v_~SIZE~0_493, main_~c~0=v_main_~c~0_2639, ~last~0=v_~last~0_498} AuxVars[] AssignedVars[] [2021-05-03 00:22:54,186 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:54,212 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:54,215 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:54,241 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:22:54,250 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:22:54,280 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:22:54,322 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:54,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:54,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:22:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:54,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:54,638 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:22:54,751 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2021-05-03 00:22:56,498 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:56,498 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1939314875] [2021-05-03 00:22:56,498 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1939314875] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:56,498 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:56,499 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:22:56,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035474836] [2021-05-03 00:22:56,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:22:56,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:56,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:22:56,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:22:56,499 INFO L87 Difference]: Start difference. First operand 251 states and 287 transitions. Second operand has 32 states, 32 states have (on average 2.0) internal successors, (64), 30 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:59,423 INFO L93 Difference]: Finished difference Result 532 states and 594 transitions. [2021-05-03 00:22:59,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:22:59,426 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 30 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:22:59,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:59,427 INFO L225 Difference]: With dead ends: 532 [2021-05-03 00:22:59,427 INFO L226 Difference]: Without dead ends: 343 [2021-05-03 00:22:59,427 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 28 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 2060.1ms TimeCoverageRelationStatistics Valid=131, Invalid=1059, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:22:59,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-05-03 00:22:59,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 251. [2021-05-03 00:22:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 241 states have (on average 1.1452282157676348) internal successors, (276), 241 states have internal predecessors, (276), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:22:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 287 transitions. [2021-05-03 00:22:59,872 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 287 transitions. Word has length 70 [2021-05-03 00:22:59,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:59,872 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 287 transitions. [2021-05-03 00:22:59,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 30 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:22:59,872 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 287 transitions. [2021-05-03 00:22:59,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:22:59,873 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:59,873 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:59,873 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable626 [2021-05-03 00:22:59,873 INFO L428 AbstractCegarLoop]: === Iteration 146 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:59,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:59,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1289914978, now seen corresponding path program 109 times [2021-05-03 00:22:59,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:59,874 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1727472594] [2021-05-03 00:22:59,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:59,886 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_499 v_main_~c~0_2659) (< v_main_~c~0_2659 v_~SIZE~0_494)) InVars {~SIZE~0=v_~SIZE~0_494, main_~c~0=v_main_~c~0_2659, ~last~0=v_~last~0_499} OutVars{~SIZE~0=v_~SIZE~0_494, main_~c~0=v_main_~c~0_2659, ~last~0=v_~last~0_499} AuxVars[] AssignedVars[] [2021-05-03 00:22:59,888 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:22:59,890 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:59,892 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:59,912 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:59,918 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:59,981 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:00,037 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2661 v_~SIZE~0_495) (< v_main_~c~0_2661 v_~last~0_500)) InVars {~SIZE~0=v_~SIZE~0_495, main_~c~0=v_main_~c~0_2661, ~last~0=v_~last~0_500} OutVars{~SIZE~0=v_~SIZE~0_495, main_~c~0=v_main_~c~0_2661, ~last~0=v_~last~0_500} AuxVars[] AssignedVars[] [2021-05-03 00:23:00,039 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:23:00,066 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:00,068 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:00,098 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:00,111 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:00,142 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:23:00,193 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:00,196 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_501 v_main_~c~0_2663) (< (+ v_main_~c~0_2663 1) v_~SIZE~0_496)) InVars {~SIZE~0=v_~SIZE~0_496, main_~c~0=v_main_~c~0_2663, ~last~0=v_~last~0_501} OutVars{~SIZE~0=v_~SIZE~0_496, main_~c~0=v_main_~c~0_2663, ~last~0=v_~last~0_501} AuxVars[] AssignedVars[] [2021-05-03 00:23:00,199 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:23:00,200 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:00,203 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:00,226 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:00,234 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:00,297 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:23:00,346 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2665 1) v_~SIZE~0_497) (< v_main_~c~0_2665 v_~last~0_502)) InVars {~SIZE~0=v_~SIZE~0_497, main_~c~0=v_main_~c~0_2665, ~last~0=v_~last~0_502} OutVars{~SIZE~0=v_~SIZE~0_497, main_~c~0=v_main_~c~0_2665, ~last~0=v_~last~0_502} AuxVars[] AssignedVars[] [2021-05-03 00:23:00,349 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:00,350 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:00,353 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:00,380 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:00,390 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:00,443 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:00,493 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:00,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:00,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:23:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:00,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:23:00,819 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:23:00,927 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2021-05-03 00:23:02,476 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:02,476 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1727472594] [2021-05-03 00:23:02,476 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1727472594] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:02,476 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:02,476 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:23:02,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852339975] [2021-05-03 00:23:02,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:23:02,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:02,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:23:02,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:23:02,477 INFO L87 Difference]: Start difference. First operand 251 states and 287 transitions. Second operand has 33 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 31 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:04,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:04,608 INFO L93 Difference]: Finished difference Result 529 states and 591 transitions. [2021-05-03 00:23:04,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:23:04,610 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 31 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:23:04,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:04,610 INFO L225 Difference]: With dead ends: 529 [2021-05-03 00:23:04,610 INFO L226 Difference]: Without dead ends: 340 [2021-05-03 00:23:04,611 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 27 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1843.6ms TimeCoverageRelationStatistics Valid=138, Invalid=1122, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:23:04,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-05-03 00:23:04,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 251. [2021-05-03 00:23:04,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 241 states have (on average 1.1452282157676348) internal successors, (276), 241 states have internal predecessors, (276), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:23:04,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 287 transitions. [2021-05-03 00:23:04,991 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 287 transitions. Word has length 70 [2021-05-03 00:23:04,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:04,991 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 287 transitions. [2021-05-03 00:23:04,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 31 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:04,991 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 287 transitions. [2021-05-03 00:23:04,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:23:04,991 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:04,991 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:04,991 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable631 [2021-05-03 00:23:04,991 INFO L428 AbstractCegarLoop]: === Iteration 147 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:04,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:04,992 INFO L82 PathProgramCache]: Analyzing trace with hash 955664476, now seen corresponding path program 110 times [2021-05-03 00:23:04,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:04,992 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1355404722] [2021-05-03 00:23:04,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:05,000 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2685 v_~SIZE~0_498) (<= v_~last~0_503 v_main_~c~0_2685)) InVars {~SIZE~0=v_~SIZE~0_498, main_~c~0=v_main_~c~0_2685, ~last~0=v_~last~0_503} OutVars{~SIZE~0=v_~SIZE~0_498, main_~c~0=v_main_~c~0_2685, ~last~0=v_~last~0_503} AuxVars[] AssignedVars[] [2021-05-03 00:23:05,003 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:05,004 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:05,006 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:05,020 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:05,023 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:05,055 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:05,079 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2687 v_~SIZE~0_499) (< v_main_~c~0_2687 v_~last~0_504)) InVars {~SIZE~0=v_~SIZE~0_499, main_~c~0=v_main_~c~0_2687, ~last~0=v_~last~0_504} OutVars{~SIZE~0=v_~SIZE~0_499, main_~c~0=v_main_~c~0_2687, ~last~0=v_~last~0_504} AuxVars[] AssignedVars[] [2021-05-03 00:23:05,080 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:23:05,081 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:05,083 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:05,097 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:05,102 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:05,130 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:23:05,155 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:05,158 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2689 1) v_~SIZE~0_500) (<= v_~last~0_505 v_main_~c~0_2689)) InVars {~SIZE~0=v_~SIZE~0_500, main_~c~0=v_main_~c~0_2689, ~last~0=v_~last~0_505} OutVars{~SIZE~0=v_~SIZE~0_500, main_~c~0=v_main_~c~0_2689, ~last~0=v_~last~0_505} AuxVars[] AssignedVars[] [2021-05-03 00:23:05,159 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:23:05,178 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:05,180 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:05,190 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:05,193 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:05,210 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:23:05,234 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2691 1) v_~SIZE~0_501) (< v_main_~c~0_2691 v_~last~0_506)) InVars {~SIZE~0=v_~SIZE~0_501, main_~c~0=v_main_~c~0_2691, ~last~0=v_~last~0_506} OutVars{~SIZE~0=v_~SIZE~0_501, main_~c~0=v_main_~c~0_2691, ~last~0=v_~last~0_506} AuxVars[] AssignedVars[] [2021-05-03 00:23:05,235 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:05,249 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:05,251 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:05,265 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:05,270 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:05,289 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:05,313 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:05,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:05,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:23:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:05,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:23:05,493 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:23:07,329 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:07,330 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1355404722] [2021-05-03 00:23:07,330 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1355404722] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:07,330 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:07,330 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-03 00:23:07,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439493316] [2021-05-03 00:23:07,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-03 00:23:07,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:07,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-03 00:23:07,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1055, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:23:07,331 INFO L87 Difference]: Start difference. First operand 251 states and 287 transitions. Second operand has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 32 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:09,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:09,708 INFO L93 Difference]: Finished difference Result 526 states and 588 transitions. [2021-05-03 00:23:09,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:23:09,710 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 32 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:23:09,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:09,711 INFO L225 Difference]: With dead ends: 526 [2021-05-03 00:23:09,711 INFO L226 Difference]: Without dead ends: 337 [2021-05-03 00:23:09,711 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 26 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 1946.0ms TimeCoverageRelationStatistics Valid=145, Invalid=1187, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:23:09,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-05-03 00:23:10,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 251. [2021-05-03 00:23:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 241 states have (on average 1.1452282157676348) internal successors, (276), 241 states have internal predecessors, (276), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:23:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 287 transitions. [2021-05-03 00:23:10,114 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 287 transitions. Word has length 70 [2021-05-03 00:23:10,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:10,114 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 287 transitions. [2021-05-03 00:23:10,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 32 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:10,115 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 287 transitions. [2021-05-03 00:23:10,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:23:10,115 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:10,115 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:10,115 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable636 [2021-05-03 00:23:10,115 INFO L428 AbstractCegarLoop]: === Iteration 148 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:10,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:10,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1379311198, now seen corresponding path program 111 times [2021-05-03 00:23:10,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:10,116 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [729005785] [2021-05-03 00:23:10,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:10,123 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2711 v_~SIZE~0_502) (<= v_~last~0_507 v_main_~c~0_2711)) InVars {~SIZE~0=v_~SIZE~0_502, main_~c~0=v_main_~c~0_2711, ~last~0=v_~last~0_507} OutVars{~SIZE~0=v_~SIZE~0_502, main_~c~0=v_main_~c~0_2711, ~last~0=v_~last~0_507} AuxVars[] AssignedVars[] [2021-05-03 00:23:10,125 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:10,126 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:10,131 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:10,143 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:10,146 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:10,178 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:10,203 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2713 v_~SIZE~0_503) (< v_main_~c~0_2713 v_~last~0_508)) InVars {~SIZE~0=v_~SIZE~0_503, main_~c~0=v_main_~c~0_2713, ~last~0=v_~last~0_508} OutVars{~SIZE~0=v_~SIZE~0_503, main_~c~0=v_main_~c~0_2713, ~last~0=v_~last~0_508} AuxVars[] AssignedVars[] [2021-05-03 00:23:10,205 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:23:10,206 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:10,207 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:10,224 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:10,230 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:10,258 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:23:10,282 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:10,284 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2715 1) v_~SIZE~0_504) (<= v_~last~0_509 v_main_~c~0_2715)) InVars {~SIZE~0=v_~SIZE~0_504, main_~c~0=v_main_~c~0_2715, ~last~0=v_~last~0_509} OutVars{~SIZE~0=v_~SIZE~0_504, main_~c~0=v_main_~c~0_2715, ~last~0=v_~last~0_509} AuxVars[] AssignedVars[] [2021-05-03 00:23:10,285 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:23:10,286 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:10,287 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:10,300 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:10,303 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:10,336 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:23:10,361 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2717 1) v_~SIZE~0_505) (< v_main_~c~0_2717 v_~last~0_510)) InVars {~SIZE~0=v_~SIZE~0_505, main_~c~0=v_main_~c~0_2717, ~last~0=v_~last~0_510} OutVars{~SIZE~0=v_~SIZE~0_505, main_~c~0=v_main_~c~0_2717, ~last~0=v_~last~0_510} AuxVars[] AssignedVars[] [2021-05-03 00:23:10,362 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:10,363 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:10,364 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:10,379 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:10,384 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:10,414 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:10,436 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:10,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:10,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:23:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:10,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:23:10,617 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:23:12,330 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:12,331 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [729005785] [2021-05-03 00:23:12,331 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [729005785] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:12,331 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:12,331 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-03 00:23:12,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243479618] [2021-05-03 00:23:12,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-03 00:23:12,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:12,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-03 00:23:12,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1118, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:23:12,332 INFO L87 Difference]: Start difference. First operand 251 states and 287 transitions. Second operand has 35 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 33 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:14,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:14,927 INFO L93 Difference]: Finished difference Result 523 states and 585 transitions. [2021-05-03 00:23:14,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:23:14,929 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 33 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:23:14,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:14,930 INFO L225 Difference]: With dead ends: 523 [2021-05-03 00:23:14,930 INFO L226 Difference]: Without dead ends: 334 [2021-05-03 00:23:14,930 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 9 SyntacticMatches, 22 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1850.6ms TimeCoverageRelationStatistics Valid=152, Invalid=1254, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:23:14,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-05-03 00:23:15,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 251. [2021-05-03 00:23:15,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 241 states have (on average 1.1452282157676348) internal successors, (276), 241 states have internal predecessors, (276), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:23:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 287 transitions. [2021-05-03 00:23:15,430 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 287 transitions. Word has length 70 [2021-05-03 00:23:15,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:15,430 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 287 transitions. [2021-05-03 00:23:15,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 33 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:15,430 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 287 transitions. [2021-05-03 00:23:15,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:23:15,431 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:15,431 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:15,431 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable641 [2021-05-03 00:23:15,431 INFO L428 AbstractCegarLoop]: === Iteration 149 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:15,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:15,431 INFO L82 PathProgramCache]: Analyzing trace with hash 349951900, now seen corresponding path program 112 times [2021-05-03 00:23:15,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:15,431 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1553553778] [2021-05-03 00:23:15,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:15,442 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_511 v_main_~c~0_2737) (< v_main_~c~0_2737 v_~SIZE~0_506)) InVars {~SIZE~0=v_~SIZE~0_506, main_~c~0=v_main_~c~0_2737, ~last~0=v_~last~0_511} OutVars{~SIZE~0=v_~SIZE~0_506, main_~c~0=v_main_~c~0_2737, ~last~0=v_~last~0_511} AuxVars[] AssignedVars[] [2021-05-03 00:23:15,444 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:15,476 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:15,479 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:15,498 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:15,505 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:15,544 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:15,592 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2739 v_~last~0_512) (< v_main_~c~0_2739 v_~SIZE~0_507)) InVars {~SIZE~0=v_~SIZE~0_507, main_~c~0=v_main_~c~0_2739, ~last~0=v_~last~0_512} OutVars{~SIZE~0=v_~SIZE~0_507, main_~c~0=v_main_~c~0_2739, ~last~0=v_~last~0_512} AuxVars[] AssignedVars[] [2021-05-03 00:23:15,594 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:23:15,618 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:15,623 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:15,648 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:15,657 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:15,683 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:23:15,723 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:15,726 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_513 v_main_~c~0_2741) (< (+ v_main_~c~0_2741 1) v_~SIZE~0_508)) InVars {~SIZE~0=v_~SIZE~0_508, main_~c~0=v_main_~c~0_2741, ~last~0=v_~last~0_513} OutVars{~SIZE~0=v_~SIZE~0_508, main_~c~0=v_main_~c~0_2741, ~last~0=v_~last~0_513} AuxVars[] AssignedVars[] [2021-05-03 00:23:15,729 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:23:15,731 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:15,733 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:15,754 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:15,759 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:15,816 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:23:15,862 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2743 1) v_~SIZE~0_509) (< v_main_~c~0_2743 v_~last~0_514)) InVars {~SIZE~0=v_~SIZE~0_509, main_~c~0=v_main_~c~0_2743, ~last~0=v_~last~0_514} OutVars{~SIZE~0=v_~SIZE~0_509, main_~c~0=v_main_~c~0_2743, ~last~0=v_~last~0_514} AuxVars[] AssignedVars[] [2021-05-03 00:23:15,864 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:15,866 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:15,868 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:15,893 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:15,902 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:15,949 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:15,987 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:16,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:16,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:23:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:23:16,236 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:23:18,278 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:18,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1553553778] [2021-05-03 00:23:18,280 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1553553778] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:18,280 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:18,280 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-03 00:23:18,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730565971] [2021-05-03 00:23:18,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-03 00:23:18,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:18,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-03 00:23:18,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1183, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:23:18,281 INFO L87 Difference]: Start difference. First operand 251 states and 287 transitions. Second operand has 36 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 34 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:21,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:21,954 INFO L93 Difference]: Finished difference Result 520 states and 582 transitions. [2021-05-03 00:23:21,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:23:21,957 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 34 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:23:21,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:21,958 INFO L225 Difference]: With dead ends: 520 [2021-05-03 00:23:21,958 INFO L226 Difference]: Without dead ends: 331 [2021-05-03 00:23:21,958 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 24 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 2216.2ms TimeCoverageRelationStatistics Valid=159, Invalid=1323, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:23:21,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-05-03 00:23:22,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 251. [2021-05-03 00:23:22,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 241 states have (on average 1.1452282157676348) internal successors, (276), 241 states have internal predecessors, (276), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:23:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 287 transitions. [2021-05-03 00:23:22,458 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 287 transitions. Word has length 70 [2021-05-03 00:23:22,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:22,458 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 287 transitions. [2021-05-03 00:23:22,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 34 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:22,458 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 287 transitions. [2021-05-03 00:23:22,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:23:22,458 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:22,458 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:22,458 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable646 [2021-05-03 00:23:22,458 INFO L428 AbstractCegarLoop]: === Iteration 150 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:22,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:22,459 INFO L82 PathProgramCache]: Analyzing trace with hash -494053602, now seen corresponding path program 113 times [2021-05-03 00:23:22,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:22,459 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [548171512] [2021-05-03 00:23:22,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:22,471 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_515 v_main_~c~0_2763) (< v_main_~c~0_2763 v_~SIZE~0_510)) InVars {~SIZE~0=v_~SIZE~0_510, main_~c~0=v_main_~c~0_2763, ~last~0=v_~last~0_515} OutVars{~SIZE~0=v_~SIZE~0_510, main_~c~0=v_main_~c~0_2763, ~last~0=v_~last~0_515} AuxVars[] AssignedVars[] [2021-05-03 00:23:22,474 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:22,476 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:22,479 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:22,493 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:22,499 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:22,561 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:22,613 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2765 v_~last~0_516) (< v_main_~c~0_2765 v_~SIZE~0_511)) InVars {~SIZE~0=v_~SIZE~0_511, main_~c~0=v_main_~c~0_2765, ~last~0=v_~last~0_516} OutVars{~SIZE~0=v_~SIZE~0_511, main_~c~0=v_main_~c~0_2765, ~last~0=v_~last~0_516} AuxVars[] AssignedVars[] [2021-05-03 00:23:22,615 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:23:22,616 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:22,618 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:22,644 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:22,655 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:22,698 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:23:22,760 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:22,763 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2767 1) v_~SIZE~0_512) (<= v_~last~0_517 v_main_~c~0_2767)) InVars {~SIZE~0=v_~SIZE~0_512, main_~c~0=v_main_~c~0_2767, ~last~0=v_~last~0_517} OutVars{~SIZE~0=v_~SIZE~0_512, main_~c~0=v_main_~c~0_2767, ~last~0=v_~last~0_517} AuxVars[] AssignedVars[] [2021-05-03 00:23:22,765 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:23:22,798 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:22,800 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:22,819 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:22,825 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:22,861 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:23:22,906 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2769 1) v_~SIZE~0_513) (< v_main_~c~0_2769 v_~last~0_518)) InVars {~SIZE~0=v_~SIZE~0_513, main_~c~0=v_main_~c~0_2769, ~last~0=v_~last~0_518} OutVars{~SIZE~0=v_~SIZE~0_513, main_~c~0=v_main_~c~0_2769, ~last~0=v_~last~0_518} AuxVars[] AssignedVars[] [2021-05-03 00:23:22,908 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:22,935 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:22,939 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:22,967 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:22,972 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:23,005 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:23,031 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:23,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:23,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:23:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:23,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:23:23,375 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:23:25,915 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:25,915 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [548171512] [2021-05-03 00:23:25,915 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [548171512] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:25,915 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:25,915 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-03 00:23:25,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180692949] [2021-05-03 00:23:25,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-03 00:23:25,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:25,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-03 00:23:25,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1250, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:23:25,916 INFO L87 Difference]: Start difference. First operand 251 states and 287 transitions. Second operand has 37 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 35 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:29,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:29,067 INFO L93 Difference]: Finished difference Result 517 states and 579 transitions. [2021-05-03 00:23:29,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-03 00:23:29,070 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 35 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:23:29,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:29,070 INFO L225 Difference]: With dead ends: 517 [2021-05-03 00:23:29,070 INFO L226 Difference]: Without dead ends: 328 [2021-05-03 00:23:29,071 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 23 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 2773.3ms TimeCoverageRelationStatistics Valid=166, Invalid=1394, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:23:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-05-03 00:23:29,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 251. [2021-05-03 00:23:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 241 states have (on average 1.1452282157676348) internal successors, (276), 241 states have internal predecessors, (276), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:23:29,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 287 transitions. [2021-05-03 00:23:29,558 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 287 transitions. Word has length 70 [2021-05-03 00:23:29,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:29,559 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 287 transitions. [2021-05-03 00:23:29,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 35 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:29,559 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 287 transitions. [2021-05-03 00:23:29,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:23:29,559 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:29,559 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:29,559 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable651 [2021-05-03 00:23:29,559 INFO L428 AbstractCegarLoop]: === Iteration 151 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:29,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:29,560 INFO L82 PathProgramCache]: Analyzing trace with hash -219293988, now seen corresponding path program 114 times [2021-05-03 00:23:29,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:29,560 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1988342631] [2021-05-03 00:23:29,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:29,573 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2789 v_~SIZE~0_514) (<= v_~last~0_519 v_main_~c~0_2789)) InVars {~SIZE~0=v_~SIZE~0_514, main_~c~0=v_main_~c~0_2789, ~last~0=v_~last~0_519} OutVars{~SIZE~0=v_~SIZE~0_514, main_~c~0=v_main_~c~0_2789, ~last~0=v_~last~0_519} AuxVars[] AssignedVars[] [2021-05-03 00:23:29,576 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:29,611 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:29,614 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:29,641 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:29,647 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:29,688 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:29,746 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2791 v_~SIZE~0_515) (< v_main_~c~0_2791 v_~last~0_520)) InVars {~SIZE~0=v_~SIZE~0_515, main_~c~0=v_main_~c~0_2791, ~last~0=v_~last~0_520} OutVars{~SIZE~0=v_~SIZE~0_515, main_~c~0=v_main_~c~0_2791, ~last~0=v_~last~0_520} AuxVars[] AssignedVars[] [2021-05-03 00:23:29,749 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:23:29,750 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:29,754 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:29,771 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:29,781 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:29,840 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:23:29,892 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:29,897 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2793 1) v_~SIZE~0_516) (<= v_~last~0_521 v_main_~c~0_2793)) InVars {~SIZE~0=v_~SIZE~0_516, main_~c~0=v_main_~c~0_2793, ~last~0=v_~last~0_521} OutVars{~SIZE~0=v_~SIZE~0_516, main_~c~0=v_main_~c~0_2793, ~last~0=v_~last~0_521} AuxVars[] AssignedVars[] [2021-05-03 00:23:29,899 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:23:29,901 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:29,903 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:29,926 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:29,932 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:29,999 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:23:30,059 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2795 1) v_~SIZE~0_517) (< v_main_~c~0_2795 v_~last~0_522)) InVars {~SIZE~0=v_~SIZE~0_517, main_~c~0=v_main_~c~0_2795, ~last~0=v_~last~0_522} OutVars{~SIZE~0=v_~SIZE~0_517, main_~c~0=v_main_~c~0_2795, ~last~0=v_~last~0_522} AuxVars[] AssignedVars[] [2021-05-03 00:23:30,061 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:30,063 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:30,066 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:30,088 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:30,098 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:30,151 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:30,198 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:30,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:30,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:23:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:30,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:23:30,469 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:23:33,514 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:33,514 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1988342631] [2021-05-03 00:23:33,514 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1988342631] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:33,515 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:33,515 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-03 00:23:33,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467300891] [2021-05-03 00:23:33,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-03 00:23:33,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:33,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-03 00:23:33,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1319, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:23:33,515 INFO L87 Difference]: Start difference. First operand 251 states and 287 transitions. Second operand has 38 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 36 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:36,423 INFO L93 Difference]: Finished difference Result 514 states and 576 transitions. [2021-05-03 00:23:36,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-03 00:23:36,426 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 36 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:23:36,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:36,426 INFO L225 Difference]: With dead ends: 514 [2021-05-03 00:23:36,427 INFO L226 Difference]: Without dead ends: 325 [2021-05-03 00:23:36,427 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 22 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 3187.6ms TimeCoverageRelationStatistics Valid=173, Invalid=1467, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:23:36,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-05-03 00:23:36,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 251. [2021-05-03 00:23:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 241 states have (on average 1.1452282157676348) internal successors, (276), 241 states have internal predecessors, (276), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:23:36,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 287 transitions. [2021-05-03 00:23:36,943 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 287 transitions. Word has length 70 [2021-05-03 00:23:36,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:36,943 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 287 transitions. [2021-05-03 00:23:36,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 36 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:36,943 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 287 transitions. [2021-05-03 00:23:36,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:23:36,943 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:36,943 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:36,944 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable656 [2021-05-03 00:23:36,944 INFO L428 AbstractCegarLoop]: === Iteration 152 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:36,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:36,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1166909406, now seen corresponding path program 115 times [2021-05-03 00:23:36,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:36,944 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1099616704] [2021-05-03 00:23:36,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:36,956 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2815 v_~SIZE~0_518) (<= v_~last~0_523 v_main_~c~0_2815)) InVars {~SIZE~0=v_~SIZE~0_518, main_~c~0=v_main_~c~0_2815, ~last~0=v_~last~0_523} OutVars{~SIZE~0=v_~SIZE~0_518, main_~c~0=v_main_~c~0_2815, ~last~0=v_~last~0_523} AuxVars[] AssignedVars[] [2021-05-03 00:23:36,959 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:36,960 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:36,963 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:36,987 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:36,992 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:37,058 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:37,116 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2817 v_~SIZE~0_519) (< v_main_~c~0_2817 v_~last~0_524)) InVars {~SIZE~0=v_~SIZE~0_519, main_~c~0=v_main_~c~0_2817, ~last~0=v_~last~0_524} OutVars{~SIZE~0=v_~SIZE~0_519, main_~c~0=v_main_~c~0_2817, ~last~0=v_~last~0_524} AuxVars[] AssignedVars[] [2021-05-03 00:23:37,118 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:23:37,120 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:37,123 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:37,157 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:37,167 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:37,226 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:23:37,275 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:37,280 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_525 v_main_~c~0_2819) (< (+ v_main_~c~0_2819 1) v_~SIZE~0_520)) InVars {~SIZE~0=v_~SIZE~0_520, main_~c~0=v_main_~c~0_2819, ~last~0=v_~last~0_525} OutVars{~SIZE~0=v_~SIZE~0_520, main_~c~0=v_main_~c~0_2819, ~last~0=v_~last~0_525} AuxVars[] AssignedVars[] [2021-05-03 00:23:37,282 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:23:37,284 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:37,288 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:37,323 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:37,328 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:37,396 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:23:37,457 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2821 v_~last~0_526) (< (+ v_main_~c~0_2821 1) v_~SIZE~0_521)) InVars {~SIZE~0=v_~SIZE~0_521, main_~c~0=v_main_~c~0_2821, ~last~0=v_~last~0_526} OutVars{~SIZE~0=v_~SIZE~0_521, main_~c~0=v_main_~c~0_2821, ~last~0=v_~last~0_526} AuxVars[] AssignedVars[] [2021-05-03 00:23:37,467 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:37,501 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:37,504 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:37,533 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:37,547 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:37,584 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:37,640 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:37,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:37,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:23:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:23:37,985 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:23:38,112 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2021-05-03 00:23:41,632 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:41,632 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1099616704] [2021-05-03 00:23:41,632 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1099616704] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:41,632 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:41,633 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-03 00:23:41,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494409740] [2021-05-03 00:23:41,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-03 00:23:41,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:41,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-03 00:23:41,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1390, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:23:41,633 INFO L87 Difference]: Start difference. First operand 251 states and 287 transitions. Second operand has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 37 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:46,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:46,128 INFO L93 Difference]: Finished difference Result 511 states and 573 transitions. [2021-05-03 00:23:46,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-03 00:23:46,131 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 37 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:23:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:46,132 INFO L225 Difference]: With dead ends: 511 [2021-05-03 00:23:46,132 INFO L226 Difference]: Without dead ends: 322 [2021-05-03 00:23:46,132 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 21 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 3867.5ms TimeCoverageRelationStatistics Valid=180, Invalid=1542, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:23:46,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-05-03 00:23:46,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 251. [2021-05-03 00:23:46,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 241 states have (on average 1.1452282157676348) internal successors, (276), 241 states have internal predecessors, (276), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:23:46,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 287 transitions. [2021-05-03 00:23:46,626 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 287 transitions. Word has length 70 [2021-05-03 00:23:46,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:46,626 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 287 transitions. [2021-05-03 00:23:46,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 37 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:46,626 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 287 transitions. [2021-05-03 00:23:46,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:23:46,626 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:46,626 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:46,626 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable661 [2021-05-03 00:23:46,627 INFO L428 AbstractCegarLoop]: === Iteration 153 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:46,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:46,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1228949020, now seen corresponding path program 116 times [2021-05-03 00:23:46,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:46,627 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1882695537] [2021-05-03 00:23:46,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:46,649 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2841 v_~SIZE~0_522) (<= v_~last~0_527 v_main_~c~0_2841)) InVars {~SIZE~0=v_~SIZE~0_522, main_~c~0=v_main_~c~0_2841, ~last~0=v_~last~0_527} OutVars{~SIZE~0=v_~SIZE~0_522, main_~c~0=v_main_~c~0_2841, ~last~0=v_~last~0_527} AuxVars[] AssignedVars[] [2021-05-03 00:23:46,652 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:46,689 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:46,692 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:46,719 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:46,726 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:46,765 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:46,827 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2843 v_~last~0_528) (< v_main_~c~0_2843 v_~SIZE~0_523)) InVars {~SIZE~0=v_~SIZE~0_523, main_~c~0=v_main_~c~0_2843, ~last~0=v_~last~0_528} OutVars{~SIZE~0=v_~SIZE~0_523, main_~c~0=v_main_~c~0_2843, ~last~0=v_~last~0_528} AuxVars[] AssignedVars[] [2021-05-03 00:23:46,831 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:23:46,833 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:46,837 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:46,871 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:46,884 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:46,952 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:23:47,011 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:47,017 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_529 v_main_~c~0_2845) (< (+ v_main_~c~0_2845 1) v_~SIZE~0_524)) InVars {~SIZE~0=v_~SIZE~0_524, main_~c~0=v_main_~c~0_2845, ~last~0=v_~last~0_529} OutVars{~SIZE~0=v_~SIZE~0_524, main_~c~0=v_main_~c~0_2845, ~last~0=v_~last~0_529} AuxVars[] AssignedVars[] [2021-05-03 00:23:47,021 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:23:47,023 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:47,027 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:47,065 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:47,074 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:47,171 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:23:47,266 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2847 v_~last~0_530) (< (+ v_main_~c~0_2847 1) v_~SIZE~0_525)) InVars {~SIZE~0=v_~SIZE~0_525, main_~c~0=v_main_~c~0_2847, ~last~0=v_~last~0_530} OutVars{~SIZE~0=v_~SIZE~0_525, main_~c~0=v_main_~c~0_2847, ~last~0=v_~last~0_530} AuxVars[] AssignedVars[] [2021-05-03 00:23:47,269 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:47,310 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:47,314 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:47,362 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:47,379 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:47,430 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:47,502 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:47,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:47,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:23:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:23:47,944 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:23:48,053 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2021-05-03 00:23:50,507 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:50,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1882695537] [2021-05-03 00:23:50,507 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1882695537] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:50,507 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:50,507 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-03 00:23:50,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988574698] [2021-05-03 00:23:50,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-03 00:23:50,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:50,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-03 00:23:50,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1463, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:23:50,508 INFO L87 Difference]: Start difference. First operand 251 states and 287 transitions. Second operand has 40 states, 40 states have (on average 1.6) internal successors, (64), 38 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:54,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:54,381 INFO L93 Difference]: Finished difference Result 508 states and 570 transitions. [2021-05-03 00:23:54,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-03 00:23:54,384 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.6) internal successors, (64), 38 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:23:54,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:54,385 INFO L225 Difference]: With dead ends: 508 [2021-05-03 00:23:54,385 INFO L226 Difference]: Without dead ends: 319 [2021-05-03 00:23:54,385 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 20 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 2904.7ms TimeCoverageRelationStatistics Valid=187, Invalid=1619, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:23:54,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-05-03 00:23:55,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 251. [2021-05-03 00:23:55,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 241 states have (on average 1.1452282157676348) internal successors, (276), 241 states have internal predecessors, (276), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:23:55,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 287 transitions. [2021-05-03 00:23:55,013 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 287 transitions. Word has length 70 [2021-05-03 00:23:55,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:55,014 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 287 transitions. [2021-05-03 00:23:55,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 1.6) internal successors, (64), 38 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:23:55,014 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 287 transitions. [2021-05-03 00:23:55,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:23:55,014 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:55,014 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:55,014 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable666 [2021-05-03 00:23:55,014 INFO L428 AbstractCegarLoop]: === Iteration 154 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:55,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:55,015 INFO L82 PathProgramCache]: Analyzing trace with hash -576489314, now seen corresponding path program 117 times [2021-05-03 00:23:55,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:55,015 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1675508860] [2021-05-03 00:23:55,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:55,033 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_531 v_main_~c~0_2867) (< v_main_~c~0_2867 v_~SIZE~0_526)) InVars {~SIZE~0=v_~SIZE~0_526, main_~c~0=v_main_~c~0_2867, ~last~0=v_~last~0_531} OutVars{~SIZE~0=v_~SIZE~0_526, main_~c~0=v_main_~c~0_2867, ~last~0=v_~last~0_531} AuxVars[] AssignedVars[] [2021-05-03 00:23:55,036 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:55,098 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:55,102 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:55,144 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:55,151 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:55,210 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:55,305 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2869 v_~SIZE~0_527) (< v_main_~c~0_2869 v_~last~0_532)) InVars {~SIZE~0=v_~SIZE~0_527, main_~c~0=v_main_~c~0_2869, ~last~0=v_~last~0_532} OutVars{~SIZE~0=v_~SIZE~0_527, main_~c~0=v_main_~c~0_2869, ~last~0=v_~last~0_532} AuxVars[] AssignedVars[] [2021-05-03 00:23:55,309 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:23:55,311 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:55,316 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:55,355 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:55,376 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:55,477 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:23:55,550 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:55,557 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_533 v_main_~c~0_2871) (< (+ v_main_~c~0_2871 1) v_~SIZE~0_528)) InVars {~SIZE~0=v_~SIZE~0_528, main_~c~0=v_main_~c~0_2871, ~last~0=v_~last~0_533} OutVars{~SIZE~0=v_~SIZE~0_528, main_~c~0=v_main_~c~0_2871, ~last~0=v_~last~0_533} AuxVars[] AssignedVars[] [2021-05-03 00:23:55,561 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:23:55,565 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:55,571 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:55,602 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:55,613 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:55,695 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:23:55,752 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2873 1) v_~SIZE~0_529) (< v_main_~c~0_2873 v_~last~0_534)) InVars {~SIZE~0=v_~SIZE~0_529, main_~c~0=v_main_~c~0_2873, ~last~0=v_~last~0_534} OutVars{~SIZE~0=v_~SIZE~0_529, main_~c~0=v_main_~c~0_2873, ~last~0=v_~last~0_534} AuxVars[] AssignedVars[] [2021-05-03 00:23:55,755 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:23:55,785 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:55,788 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:55,824 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:23:55,836 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:23:55,871 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:23:55,928 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:56,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:56,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:23:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:23:56,277 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:23:56,413 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2021-05-03 00:23:58,674 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:58,674 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1675508860] [2021-05-03 00:23:58,674 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1675508860] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:58,674 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:58,674 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-05-03 00:23:58,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321999170] [2021-05-03 00:23:58,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-05-03 00:23:58,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:58,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-05-03 00:23:58,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1538, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:23:58,675 INFO L87 Difference]: Start difference. First operand 251 states and 287 transitions. Second operand has 41 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 39 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:01,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:24:01,307 INFO L93 Difference]: Finished difference Result 505 states and 567 transitions. [2021-05-03 00:24:01,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-03 00:24:01,309 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 39 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:24:01,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:24:01,309 INFO L225 Difference]: With dead ends: 505 [2021-05-03 00:24:01,309 INFO L226 Difference]: Without dead ends: 316 [2021-05-03 00:24:01,310 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 8 SyntacticMatches, 17 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 2573.5ms TimeCoverageRelationStatistics Valid=194, Invalid=1698, Unknown=0, NotChecked=0, Total=1892 [2021-05-03 00:24:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-05-03 00:24:01,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 251. [2021-05-03 00:24:01,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 241 states have (on average 1.1452282157676348) internal successors, (276), 241 states have internal predecessors, (276), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:24:01,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 287 transitions. [2021-05-03 00:24:01,716 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 287 transitions. Word has length 70 [2021-05-03 00:24:01,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:24:01,716 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 287 transitions. [2021-05-03 00:24:01,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 41 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 39 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:01,717 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 287 transitions. [2021-05-03 00:24:01,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:24:01,717 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:24:01,717 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 13, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:24:01,717 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable671 [2021-05-03 00:24:01,717 INFO L428 AbstractCegarLoop]: === Iteration 155 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:24:01,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:24:01,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1394137764, now seen corresponding path program 118 times [2021-05-03 00:24:01,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:24:01,718 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [28222182] [2021-05-03 00:24:01,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:24:01,726 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_535 v_main_~c~0_2893) (< v_main_~c~0_2893 v_~SIZE~0_530)) InVars {~SIZE~0=v_~SIZE~0_530, main_~c~0=v_main_~c~0_2893, ~last~0=v_~last~0_535} OutVars{~SIZE~0=v_~SIZE~0_530, main_~c~0=v_main_~c~0_2893, ~last~0=v_~last~0_535} AuxVars[] AssignedVars[] [2021-05-03 00:24:01,727 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:01,728 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:01,730 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:01,742 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:01,745 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:01,779 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:01,806 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2895 v_~last~0_536) (< v_main_~c~0_2895 v_~SIZE~0_531)) InVars {~SIZE~0=v_~SIZE~0_531, main_~c~0=v_main_~c~0_2895, ~last~0=v_~last~0_536} OutVars{~SIZE~0=v_~SIZE~0_531, main_~c~0=v_main_~c~0_2895, ~last~0=v_~last~0_536} AuxVars[] AssignedVars[] [2021-05-03 00:24:01,807 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:24:01,822 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:01,823 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:01,839 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:01,845 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:01,862 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:24:01,886 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:01,888 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2897 1) v_~SIZE~0_532) (<= v_~last~0_537 v_main_~c~0_2897)) InVars {~SIZE~0=v_~SIZE~0_532, main_~c~0=v_main_~c~0_2897, ~last~0=v_~last~0_537} OutVars{~SIZE~0=v_~SIZE~0_532, main_~c~0=v_main_~c~0_2897, ~last~0=v_~last~0_537} AuxVars[] AssignedVars[] [2021-05-03 00:24:01,890 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:24:01,909 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:01,910 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:01,923 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:01,926 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:01,946 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:24:01,972 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2899 v_~last~0_538) (< (+ v_main_~c~0_2899 1) v_~SIZE~0_533)) InVars {~SIZE~0=v_~SIZE~0_533, main_~c~0=v_main_~c~0_2899, ~last~0=v_~last~0_538} OutVars{~SIZE~0=v_~SIZE~0_533, main_~c~0=v_main_~c~0_2899, ~last~0=v_~last~0_538} AuxVars[] AssignedVars[] [2021-05-03 00:24:01,974 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:01,991 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:01,993 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:02,015 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:02,022 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:02,039 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:02,064 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:02,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:24:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:02,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:24:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:24:02,235 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:24:04,089 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:24:04,090 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [28222182] [2021-05-03 00:24:04,090 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [28222182] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:24:04,090 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:24:04,090 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-03 00:24:04,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939619667] [2021-05-03 00:24:04,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-03 00:24:04,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:24:04,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-03 00:24:04,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1615, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:24:04,091 INFO L87 Difference]: Start difference. First operand 251 states and 287 transitions. Second operand has 42 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 40 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:07,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:24:07,600 INFO L93 Difference]: Finished difference Result 502 states and 564 transitions. [2021-05-03 00:24:07,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-03 00:24:07,603 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 40 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:24:07,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:24:07,603 INFO L225 Difference]: With dead ends: 502 [2021-05-03 00:24:07,603 INFO L226 Difference]: Without dead ends: 313 [2021-05-03 00:24:07,604 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 18 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 2009.1ms TimeCoverageRelationStatistics Valid=201, Invalid=1779, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:24:07,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-05-03 00:24:08,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 251. [2021-05-03 00:24:08,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 241 states have (on average 1.1452282157676348) internal successors, (276), 241 states have internal predecessors, (276), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:24:08,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 287 transitions. [2021-05-03 00:24:08,089 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 287 transitions. Word has length 70 [2021-05-03 00:24:08,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:24:08,089 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 287 transitions. [2021-05-03 00:24:08,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 40 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:08,089 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 287 transitions. [2021-05-03 00:24:08,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:24:08,089 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:24:08,089 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:24:08,089 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable676 [2021-05-03 00:24:08,089 INFO L428 AbstractCegarLoop]: === Iteration 156 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:24:08,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:24:08,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1312481630, now seen corresponding path program 119 times [2021-05-03 00:24:08,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:24:08,090 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1039560121] [2021-05-03 00:24:08,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:24:08,098 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_539 v_main_~c~0_2919) (< v_main_~c~0_2919 v_~SIZE~0_534)) InVars {~SIZE~0=v_~SIZE~0_534, main_~c~0=v_main_~c~0_2919, ~last~0=v_~last~0_539} OutVars{~SIZE~0=v_~SIZE~0_534, main_~c~0=v_main_~c~0_2919, ~last~0=v_~last~0_539} AuxVars[] AssignedVars[] [2021-05-03 00:24:08,100 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:08,100 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:08,102 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:08,115 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:08,118 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:08,152 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:08,179 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2921 v_~last~0_540) (< v_main_~c~0_2921 v_~SIZE~0_535)) InVars {~SIZE~0=v_~SIZE~0_535, main_~c~0=v_main_~c~0_2921, ~last~0=v_~last~0_540} OutVars{~SIZE~0=v_~SIZE~0_535, main_~c~0=v_main_~c~0_2921, ~last~0=v_~last~0_540} AuxVars[] AssignedVars[] [2021-05-03 00:24:08,181 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:24:08,196 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:08,198 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:08,213 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:08,219 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:08,236 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:24:08,262 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:08,264 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_541 v_main_~c~0_2923) (< (+ v_main_~c~0_2923 1) v_~SIZE~0_536)) InVars {~SIZE~0=v_~SIZE~0_536, main_~c~0=v_main_~c~0_2923, ~last~0=v_~last~0_541} OutVars{~SIZE~0=v_~SIZE~0_536, main_~c~0=v_main_~c~0_2923, ~last~0=v_~last~0_541} AuxVars[] AssignedVars[] [2021-05-03 00:24:08,266 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:24:08,285 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:08,286 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:08,299 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:08,302 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:08,321 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:24:08,346 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2925 v_~last~0_542) (< (+ v_main_~c~0_2925 1) v_~SIZE~0_537)) InVars {~SIZE~0=v_~SIZE~0_537, main_~c~0=v_main_~c~0_2925, ~last~0=v_~last~0_542} OutVars{~SIZE~0=v_~SIZE~0_537, main_~c~0=v_main_~c~0_2925, ~last~0=v_~last~0_542} AuxVars[] AssignedVars[] [2021-05-03 00:24:08,348 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:08,349 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:08,350 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:08,366 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:08,372 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:08,401 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:08,427 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:08,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:24:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:08,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:24:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:08,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:24:08,596 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:24:10,685 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:24:10,685 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1039560121] [2021-05-03 00:24:10,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1039560121] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:24:10,685 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:24:10,685 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2021-05-03 00:24:10,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852638726] [2021-05-03 00:24:10,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-05-03 00:24:10,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:24:10,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-05-03 00:24:10,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1694, Unknown=0, NotChecked=0, Total=1892 [2021-05-03 00:24:10,686 INFO L87 Difference]: Start difference. First operand 251 states and 287 transitions. Second operand has 43 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 41 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:14,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:24:14,667 INFO L93 Difference]: Finished difference Result 499 states and 561 transitions. [2021-05-03 00:24:14,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-03 00:24:14,669 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 41 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:24:14,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:24:14,670 INFO L225 Difference]: With dead ends: 499 [2021-05-03 00:24:14,670 INFO L226 Difference]: Without dead ends: 310 [2021-05-03 00:24:14,670 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 17 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2239.2ms TimeCoverageRelationStatistics Valid=208, Invalid=1862, Unknown=0, NotChecked=0, Total=2070 [2021-05-03 00:24:14,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-05-03 00:24:15,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 251. [2021-05-03 00:24:15,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 241 states have (on average 1.1452282157676348) internal successors, (276), 241 states have internal predecessors, (276), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:24:15,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 287 transitions. [2021-05-03 00:24:15,259 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 287 transitions. Word has length 70 [2021-05-03 00:24:15,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:24:15,260 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 287 transitions. [2021-05-03 00:24:15,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 43 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 41 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:15,260 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 287 transitions. [2021-05-03 00:24:15,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:24:15,260 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:24:15,260 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 15, 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-03 00:24:15,260 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable681 [2021-05-03 00:24:15,260 INFO L428 AbstractCegarLoop]: === Iteration 157 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:24:15,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:24:15,260 INFO L82 PathProgramCache]: Analyzing trace with hash 301364380, now seen corresponding path program 120 times [2021-05-03 00:24:15,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:24:15,261 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1405830468] [2021-05-03 00:24:15,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:24:15,271 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2945 v_~SIZE~0_538) (<= v_~last~0_543 v_main_~c~0_2945)) InVars {~SIZE~0=v_~SIZE~0_538, main_~c~0=v_main_~c~0_2945, ~last~0=v_~last~0_543} OutVars{~SIZE~0=v_~SIZE~0_538, main_~c~0=v_main_~c~0_2945, ~last~0=v_~last~0_543} AuxVars[] AssignedVars[] [2021-05-03 00:24:15,273 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:15,274 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:15,276 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:15,293 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:15,300 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:15,368 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:15,426 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2947 v_~last~0_544) (< v_main_~c~0_2947 v_~SIZE~0_539)) InVars {~SIZE~0=v_~SIZE~0_539, main_~c~0=v_main_~c~0_2947, ~last~0=v_~last~0_544} OutVars{~SIZE~0=v_~SIZE~0_539, main_~c~0=v_main_~c~0_2947, ~last~0=v_~last~0_544} AuxVars[] AssignedVars[] [2021-05-03 00:24:15,429 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:24:15,430 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:15,434 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:15,463 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:15,474 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:15,538 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:24:15,595 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:15,598 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2949 v_~last~0_545) (< (+ v_main_~c~0_2949 1) v_~SIZE~0_540)) InVars {~SIZE~0=v_~SIZE~0_540, main_~c~0=v_main_~c~0_2949, ~last~0=v_~last~0_545} OutVars{~SIZE~0=v_~SIZE~0_540, main_~c~0=v_main_~c~0_2949, ~last~0=v_~last~0_545} AuxVars[] AssignedVars[] [2021-05-03 00:24:15,600 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:15,602 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:15,605 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:15,636 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:15,642 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:15,677 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:15,706 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:15,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:24:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:15,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:24:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:24:15,900 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:24:18,074 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:24:18,074 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1405830468] [2021-05-03 00:24:18,075 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1405830468] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:24:18,075 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:24:18,075 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2021-05-03 00:24:18,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965991747] [2021-05-03 00:24:18,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-03 00:24:18,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:24:18,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-03 00:24:18,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1775, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:24:18,076 INFO L87 Difference]: Start difference. First operand 251 states and 287 transitions. Second operand has 44 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 42 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:22,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:24:22,288 INFO L93 Difference]: Finished difference Result 498 states and 561 transitions. [2021-05-03 00:24:22,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-03 00:24:22,291 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 42 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:24:22,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:24:22,292 INFO L225 Difference]: With dead ends: 498 [2021-05-03 00:24:22,292 INFO L226 Difference]: Without dead ends: 309 [2021-05-03 00:24:22,293 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 16 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 2295.3ms TimeCoverageRelationStatistics Valid=215, Invalid=1947, Unknown=0, NotChecked=0, Total=2162 [2021-05-03 00:24:22,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-05-03 00:24:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 252. [2021-05-03 00:24:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 242 states have (on average 1.1487603305785123) internal successors, (278), 242 states have internal predecessors, (278), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:24:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 289 transitions. [2021-05-03 00:24:22,873 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 289 transitions. Word has length 70 [2021-05-03 00:24:22,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:24:22,873 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 289 transitions. [2021-05-03 00:24:22,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 42 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 289 transitions. [2021-05-03 00:24:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-03 00:24:22,874 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:24:22,874 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:24:22,874 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable685 [2021-05-03 00:24:22,874 INFO L428 AbstractCegarLoop]: === Iteration 158 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:24:22,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:24:22,874 INFO L82 PathProgramCache]: Analyzing trace with hash 135824030, now seen corresponding path program 16 times [2021-05-03 00:24:22,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:24:22,874 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1226789481] [2021-05-03 00:24:22,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:24:22,883 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2969 v_~last~0_546) (< v_main_~c~0_2969 v_~SIZE~0_541)) InVars {~SIZE~0=v_~SIZE~0_541, main_~c~0=v_main_~c~0_2969, ~last~0=v_~last~0_546} OutVars{~SIZE~0=v_~SIZE~0_541, main_~c~0=v_main_~c~0_2969, ~last~0=v_~last~0_546} AuxVars[] AssignedVars[] [2021-05-03 00:24:22,886 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:24:22,887 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:22,891 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:22,925 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:22,939 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:23,008 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:24:23,077 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:24:23,081 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2971 1) v_~SIZE~0_542) (< v_main_~c~0_2971 v_~last~0_547)) InVars {~SIZE~0=v_~SIZE~0_542, main_~c~0=v_main_~c~0_2971, ~last~0=v_~last~0_547} OutVars{~SIZE~0=v_~SIZE~0_542, main_~c~0=v_main_~c~0_2971, ~last~0=v_~last~0_547} AuxVars[] AssignedVars[] [2021-05-03 00:24:23,083 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:23,115 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:23,119 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:23,154 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:23,168 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:23,208 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:23,266 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:24:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:23,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:24:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:23,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:24:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:23,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:24:23,762 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2021-05-03 00:24:26,209 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:24:26,209 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1226789481] [2021-05-03 00:24:26,209 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1226789481] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:24:26,209 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:24:26,210 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2021-05-03 00:24:26,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243429771] [2021-05-03 00:24:26,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-03 00:24:26,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:24:26,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-03 00:24:26,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1851, Unknown=0, NotChecked=0, Total=2070 [2021-05-03 00:24:26,210 INFO L87 Difference]: Start difference. First operand 252 states and 289 transitions. Second operand has 44 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 42 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:30,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:24:30,157 INFO L93 Difference]: Finished difference Result 513 states and 577 transitions. [2021-05-03 00:24:30,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-05-03 00:24:30,158 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 42 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 70 [2021-05-03 00:24:30,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:24:30,159 INFO L225 Difference]: With dead ends: 513 [2021-05-03 00:24:30,159 INFO L226 Difference]: Without dead ends: 324 [2021-05-03 00:24:30,160 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 6 SyntacticMatches, 15 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 3761.4ms TimeCoverageRelationStatistics Valid=363, Invalid=3797, Unknown=0, NotChecked=0, Total=4160 [2021-05-03 00:24:30,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-05-03 00:24:30,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 254. [2021-05-03 00:24:30,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 244 states have (on average 1.1475409836065573) internal successors, (280), 244 states have internal predecessors, (280), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:24:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 291 transitions. [2021-05-03 00:24:30,546 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 291 transitions. Word has length 70 [2021-05-03 00:24:30,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:24:30,546 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 291 transitions. [2021-05-03 00:24:30,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 42 states have internal predecessors, (64), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 291 transitions. [2021-05-03 00:24:30,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:24:30,547 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:24:30,547 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:24:30,547 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable688 [2021-05-03 00:24:30,547 INFO L428 AbstractCegarLoop]: === Iteration 159 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:24:30,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:24:30,547 INFO L82 PathProgramCache]: Analyzing trace with hash -565732323, now seen corresponding path program 17 times [2021-05-03 00:24:30,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:24:30,547 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [726199213] [2021-05-03 00:24:30,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:24:30,553 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_2990 v_~SIZE~0_543) (<= v_~last~0_548 v_main_~c~0_2990)) InVars {~SIZE~0=v_~SIZE~0_543, main_~c~0=v_main_~c~0_2990, ~last~0=v_~last~0_548} OutVars{~SIZE~0=v_~SIZE~0_543, main_~c~0=v_main_~c~0_2990, ~last~0=v_~last~0_548} AuxVars[] AssignedVars[] [2021-05-03 00:24:30,555 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:30,572 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:30,574 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:30,586 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:30,589 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:30,606 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:30,630 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:24:30,632 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_2992 1) v_~SIZE~0_544) (<= v_~last~0_549 v_main_~c~0_2992)) InVars {~SIZE~0=v_~SIZE~0_544, main_~c~0=v_main_~c~0_2992, ~last~0=v_~last~0_549} OutVars{~SIZE~0=v_~SIZE~0_544, main_~c~0=v_main_~c~0_2992, ~last~0=v_~last~0_549} AuxVars[] AssignedVars[] [2021-05-03 00:24:30,633 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:24:30,634 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:30,635 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:30,646 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:30,650 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:30,682 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:24:30,706 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:24:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:30,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:24:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:30,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:24:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:30,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:24:31,868 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:24:31,868 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [726199213] [2021-05-03 00:24:31,868 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [726199213] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:24:31,868 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:24:31,868 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:24:31,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666049252] [2021-05-03 00:24:31,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:24:31,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:24:31,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:24:31,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:24:31,869 INFO L87 Difference]: Start difference. First operand 254 states and 291 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 24 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:24:34,184 INFO L93 Difference]: Finished difference Result 558 states and 622 transitions. [2021-05-03 00:24:34,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:24:34,185 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 24 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:24:34,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:24:34,186 INFO L225 Difference]: With dead ends: 558 [2021-05-03 00:24:34,186 INFO L226 Difference]: Without dead ends: 369 [2021-05-03 00:24:34,186 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 13 SyntacticMatches, 32 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1100.7ms TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:24:34,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-05-03 00:24:34,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 269. [2021-05-03 00:24:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 259 states have (on average 1.138996138996139) internal successors, (295), 259 states have internal predecessors, (295), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:24:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 306 transitions. [2021-05-03 00:24:34,632 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 306 transitions. Word has length 73 [2021-05-03 00:24:34,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:24:34,632 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 306 transitions. [2021-05-03 00:24:34,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 24 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:34,633 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 306 transitions. [2021-05-03 00:24:34,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:24:34,633 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:24:34,633 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 16, 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-03 00:24:34,633 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable691 [2021-05-03 00:24:34,633 INFO L428 AbstractCegarLoop]: === Iteration 160 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:24:34,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:24:34,633 INFO L82 PathProgramCache]: Analyzing trace with hash -5032545, now seen corresponding path program 121 times [2021-05-03 00:24:34,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:24:34,633 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2001109425] [2021-05-03 00:24:34,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:24:34,642 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_550 v_main_~c~0_3012) (< v_main_~c~0_3012 v_~SIZE~0_545)) InVars {~SIZE~0=v_~SIZE~0_545, main_~c~0=v_main_~c~0_3012, ~last~0=v_~last~0_550} OutVars{~SIZE~0=v_~SIZE~0_545, main_~c~0=v_main_~c~0_3012, ~last~0=v_~last~0_550} AuxVars[] AssignedVars[] [2021-05-03 00:24:34,643 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:34,644 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:34,645 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:34,658 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:34,662 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:34,697 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:34,724 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3014 v_~last~0_551) (< v_main_~c~0_3014 v_~SIZE~0_546)) InVars {~SIZE~0=v_~SIZE~0_546, main_~c~0=v_main_~c~0_3014, ~last~0=v_~last~0_551} OutVars{~SIZE~0=v_~SIZE~0_546, main_~c~0=v_main_~c~0_3014, ~last~0=v_~last~0_551} AuxVars[] AssignedVars[] [2021-05-03 00:24:34,725 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:24:34,741 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:34,742 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:34,758 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:34,764 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:34,781 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:24:34,806 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:34,808 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3016 1) v_~SIZE~0_547) (<= v_~last~0_552 v_main_~c~0_3016)) InVars {~SIZE~0=v_~SIZE~0_547, main_~c~0=v_main_~c~0_3016, ~last~0=v_~last~0_552} OutVars{~SIZE~0=v_~SIZE~0_547, main_~c~0=v_main_~c~0_3016, ~last~0=v_~last~0_552} AuxVars[] AssignedVars[] [2021-05-03 00:24:34,810 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:24:34,811 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:34,813 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:34,828 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:34,831 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:34,865 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:24:34,891 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3018 1) v_~SIZE~0_548) (< v_main_~c~0_3018 v_~last~0_553)) InVars {~SIZE~0=v_~SIZE~0_548, main_~c~0=v_main_~c~0_3018, ~last~0=v_~last~0_553} OutVars{~SIZE~0=v_~SIZE~0_548, main_~c~0=v_main_~c~0_3018, ~last~0=v_~last~0_553} AuxVars[] AssignedVars[] [2021-05-03 00:24:34,893 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:34,908 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:34,910 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:34,925 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:34,931 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:34,949 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:34,974 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:35,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:24:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:35,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:24:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:24:35,157 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:24:36,972 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:24:36,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2001109425] [2021-05-03 00:24:36,972 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2001109425] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:24:36,972 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:24:36,972 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:24:36,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779568105] [2021-05-03 00:24:36,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:24:36,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:24:36,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:24:36,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:24:36,973 INFO L87 Difference]: Start difference. First operand 269 states and 306 transitions. Second operand has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 29 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:39,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:24:39,682 INFO L93 Difference]: Finished difference Result 583 states and 646 transitions. [2021-05-03 00:24:39,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:24:39,684 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 29 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:24:39,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:24:39,684 INFO L225 Difference]: With dead ends: 583 [2021-05-03 00:24:39,684 INFO L226 Difference]: Without dead ends: 376 [2021-05-03 00:24:39,685 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 6 SyntacticMatches, 32 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1933.4ms TimeCoverageRelationStatistics Valid=121, Invalid=1001, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:24:39,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-05-03 00:24:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 269. [2021-05-03 00:24:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 259 states have (on average 1.138996138996139) internal successors, (295), 259 states have internal predecessors, (295), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:24:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 306 transitions. [2021-05-03 00:24:40,151 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 306 transitions. Word has length 73 [2021-05-03 00:24:40,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:24:40,151 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 306 transitions. [2021-05-03 00:24:40,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 29 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 306 transitions. [2021-05-03 00:24:40,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:24:40,151 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:24:40,151 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:24:40,151 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable696 [2021-05-03 00:24:40,151 INFO L428 AbstractCegarLoop]: === Iteration 161 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:24:40,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:24:40,152 INFO L82 PathProgramCache]: Analyzing trace with hash 35642205, now seen corresponding path program 122 times [2021-05-03 00:24:40,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:24:40,152 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [121860946] [2021-05-03 00:24:40,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:24:40,161 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3039 v_~SIZE~0_549) (<= v_~last~0_554 v_main_~c~0_3039)) InVars {~SIZE~0=v_~SIZE~0_549, main_~c~0=v_main_~c~0_3039, ~last~0=v_~last~0_554} OutVars{~SIZE~0=v_~SIZE~0_549, main_~c~0=v_main_~c~0_3039, ~last~0=v_~last~0_554} AuxVars[] AssignedVars[] [2021-05-03 00:24:40,162 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:40,164 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:40,165 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:40,179 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:40,183 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:40,222 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:40,252 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3041 v_~last~0_555) (< v_main_~c~0_3041 v_~SIZE~0_550)) InVars {~SIZE~0=v_~SIZE~0_550, main_~c~0=v_main_~c~0_3041, ~last~0=v_~last~0_555} OutVars{~SIZE~0=v_~SIZE~0_550, main_~c~0=v_main_~c~0_3041, ~last~0=v_~last~0_555} AuxVars[] AssignedVars[] [2021-05-03 00:24:40,253 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:24:40,270 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:40,272 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:40,290 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:40,296 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:40,316 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:24:40,343 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:40,345 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_556 v_main_~c~0_3043) (< (+ v_main_~c~0_3043 1) v_~SIZE~0_551)) InVars {~SIZE~0=v_~SIZE~0_551, main_~c~0=v_main_~c~0_3043, ~last~0=v_~last~0_556} OutVars{~SIZE~0=v_~SIZE~0_551, main_~c~0=v_main_~c~0_3043, ~last~0=v_~last~0_556} AuxVars[] AssignedVars[] [2021-05-03 00:24:40,347 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:24:40,373 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:40,375 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:40,387 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:40,391 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:40,411 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:24:40,442 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3045 1) v_~SIZE~0_552) (< v_main_~c~0_3045 v_~last~0_557)) InVars {~SIZE~0=v_~SIZE~0_552, main_~c~0=v_main_~c~0_3045, ~last~0=v_~last~0_557} OutVars{~SIZE~0=v_~SIZE~0_552, main_~c~0=v_main_~c~0_3045, ~last~0=v_~last~0_557} AuxVars[] AssignedVars[] [2021-05-03 00:24:40,444 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:40,445 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:40,446 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:40,464 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:40,471 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:40,505 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:40,533 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:40,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:24:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:40,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:24:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:24:40,740 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:24:43,360 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:24:43,360 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [121860946] [2021-05-03 00:24:43,360 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [121860946] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:24:43,360 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:24:43,360 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:24:43,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618536276] [2021-05-03 00:24:43,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:24:43,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:24:43,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:24:43,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:24:43,361 INFO L87 Difference]: Start difference. First operand 269 states and 306 transitions. Second operand has 32 states, 32 states have (on average 2.09375) internal successors, (67), 30 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:47,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:24:47,747 INFO L93 Difference]: Finished difference Result 580 states and 643 transitions. [2021-05-03 00:24:47,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:24:47,749 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.09375) internal successors, (67), 30 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:24:47,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:24:47,750 INFO L225 Difference]: With dead ends: 580 [2021-05-03 00:24:47,750 INFO L226 Difference]: Without dead ends: 373 [2021-05-03 00:24:47,751 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 6 SyntacticMatches, 31 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 2714.4ms TimeCoverageRelationStatistics Valid=128, Invalid=1062, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:24:47,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-05-03 00:24:48,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 269. [2021-05-03 00:24:48,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 259 states have (on average 1.138996138996139) internal successors, (295), 259 states have internal predecessors, (295), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:24:48,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 306 transitions. [2021-05-03 00:24:48,222 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 306 transitions. Word has length 73 [2021-05-03 00:24:48,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:24:48,222 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 306 transitions. [2021-05-03 00:24:48,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 2.09375) internal successors, (67), 30 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:48,223 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 306 transitions. [2021-05-03 00:24:48,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:24:48,223 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:24:48,223 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 14, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:24:48,223 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable701 [2021-05-03 00:24:48,223 INFO L428 AbstractCegarLoop]: === Iteration 162 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:24:48,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:24:48,223 INFO L82 PathProgramCache]: Analyzing trace with hash 479542879, now seen corresponding path program 123 times [2021-05-03 00:24:48,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:24:48,223 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [237892059] [2021-05-03 00:24:48,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:24:48,241 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3066 v_~SIZE~0_553) (<= v_~last~0_558 v_main_~c~0_3066)) InVars {~SIZE~0=v_~SIZE~0_553, main_~c~0=v_main_~c~0_3066, ~last~0=v_~last~0_558} OutVars{~SIZE~0=v_~SIZE~0_553, main_~c~0=v_main_~c~0_3066, ~last~0=v_~last~0_558} AuxVars[] AssignedVars[] [2021-05-03 00:24:48,244 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:48,245 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:48,246 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:48,259 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:48,262 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:48,297 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:48,323 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3068 v_~SIZE~0_554) (< v_main_~c~0_3068 v_~last~0_559)) InVars {~SIZE~0=v_~SIZE~0_554, main_~c~0=v_main_~c~0_3068, ~last~0=v_~last~0_559} OutVars{~SIZE~0=v_~SIZE~0_554, main_~c~0=v_main_~c~0_3068, ~last~0=v_~last~0_559} AuxVars[] AssignedVars[] [2021-05-03 00:24:48,325 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:24:48,326 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:48,327 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:48,344 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:48,357 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:48,389 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:24:48,414 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:48,416 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3070 1) v_~SIZE~0_555) (<= v_~last~0_560 v_main_~c~0_3070)) InVars {~SIZE~0=v_~SIZE~0_555, main_~c~0=v_main_~c~0_3070, ~last~0=v_~last~0_560} OutVars{~SIZE~0=v_~SIZE~0_555, main_~c~0=v_main_~c~0_3070, ~last~0=v_~last~0_560} AuxVars[] AssignedVars[] [2021-05-03 00:24:48,418 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:24:48,420 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:48,421 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:48,435 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:48,438 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:48,473 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:24:48,500 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3072 v_~last~0_561) (< (+ v_main_~c~0_3072 1) v_~SIZE~0_556)) InVars {~SIZE~0=v_~SIZE~0_556, main_~c~0=v_main_~c~0_3072, ~last~0=v_~last~0_561} OutVars{~SIZE~0=v_~SIZE~0_556, main_~c~0=v_main_~c~0_3072, ~last~0=v_~last~0_561} AuxVars[] AssignedVars[] [2021-05-03 00:24:48,502 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:48,518 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:48,519 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:48,536 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:48,542 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:48,560 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:48,590 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:48,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:24:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:48,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:24:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:24:48,764 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:24:50,688 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:24:50,689 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [237892059] [2021-05-03 00:24:50,689 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [237892059] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:24:50,689 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:24:50,689 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:24:50,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602764894] [2021-05-03 00:24:50,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:24:50,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:24:50,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:24:50,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:24:50,690 INFO L87 Difference]: Start difference. First operand 269 states and 306 transitions. Second operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 31 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:24:54,628 INFO L93 Difference]: Finished difference Result 577 states and 640 transitions. [2021-05-03 00:24:54,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:24:54,630 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 31 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:24:54,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:24:54,631 INFO L225 Difference]: With dead ends: 577 [2021-05-03 00:24:54,631 INFO L226 Difference]: Without dead ends: 370 [2021-05-03 00:24:54,631 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 6 SyntacticMatches, 30 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 2070.8ms TimeCoverageRelationStatistics Valid=135, Invalid=1125, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:24:54,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-05-03 00:24:55,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 269. [2021-05-03 00:24:55,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 259 states have (on average 1.138996138996139) internal successors, (295), 259 states have internal predecessors, (295), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:24:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 306 transitions. [2021-05-03 00:24:55,290 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 306 transitions. Word has length 73 [2021-05-03 00:24:55,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:24:55,290 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 306 transitions. [2021-05-03 00:24:55,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 31 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:24:55,290 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 306 transitions. [2021-05-03 00:24:55,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:24:55,290 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:24:55,290 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 13, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:24:55,291 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable706 [2021-05-03 00:24:55,291 INFO L428 AbstractCegarLoop]: === Iteration 163 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:24:55,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:24:55,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1537379, now seen corresponding path program 124 times [2021-05-03 00:24:55,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:24:55,291 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [452759661] [2021-05-03 00:24:55,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:24:55,300 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_562 v_main_~c~0_3093) (< v_main_~c~0_3093 v_~SIZE~0_557)) InVars {~SIZE~0=v_~SIZE~0_557, main_~c~0=v_main_~c~0_3093, ~last~0=v_~last~0_562} OutVars{~SIZE~0=v_~SIZE~0_557, main_~c~0=v_main_~c~0_3093, ~last~0=v_~last~0_562} AuxVars[] AssignedVars[] [2021-05-03 00:24:55,302 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:55,321 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:55,323 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:55,336 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:55,339 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:55,358 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:55,385 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3095 v_~last~0_563) (< v_main_~c~0_3095 v_~SIZE~0_558)) InVars {~SIZE~0=v_~SIZE~0_558, main_~c~0=v_main_~c~0_3095, ~last~0=v_~last~0_563} OutVars{~SIZE~0=v_~SIZE~0_558, main_~c~0=v_main_~c~0_3095, ~last~0=v_~last~0_563} AuxVars[] AssignedVars[] [2021-05-03 00:24:55,386 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:24:55,387 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:55,388 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:55,404 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:24:55,410 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:24:55,440 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:24:55,468 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:55,470 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_564 v_main_~c~0_3097) (< (+ v_main_~c~0_3097 1) v_~SIZE~0_559)) InVars {~SIZE~0=v_~SIZE~0_559, main_~c~0=v_main_~c~0_3097, ~last~0=v_~last~0_564} OutVars{~SIZE~0=v_~SIZE~0_559, main_~c~0=v_main_~c~0_3097, ~last~0=v_~last~0_564} AuxVars[] AssignedVars[] [2021-05-03 00:24:55,471 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:24:55,472 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:55,474 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:55,485 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:55,488 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:55,524 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:24:55,553 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3099 v_~last~0_565) (< (+ v_main_~c~0_3099 1) v_~SIZE~0_560)) InVars {~SIZE~0=v_~SIZE~0_560, main_~c~0=v_main_~c~0_3099, ~last~0=v_~last~0_565} OutVars{~SIZE~0=v_~SIZE~0_560, main_~c~0=v_main_~c~0_3099, ~last~0=v_~last~0_565} AuxVars[] AssignedVars[] [2021-05-03 00:24:55,555 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:24:55,570 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:55,572 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:55,587 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:24:55,593 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:24:55,610 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:24:55,637 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:24:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:55,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:24:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:55,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:24:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:55,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:24:55,803 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:24:57,701 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:24:57,702 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [452759661] [2021-05-03 00:24:57,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [452759661] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:24:57,702 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:24:57,702 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-03 00:24:57,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926185682] [2021-05-03 00:24:57,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-03 00:24:57,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:24:57,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-03 00:24:57,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1058, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:24:57,703 INFO L87 Difference]: Start difference. First operand 269 states and 306 transitions. Second operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 32 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:02,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:25:02,588 INFO L93 Difference]: Finished difference Result 574 states and 637 transitions. [2021-05-03 00:25:02,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:25:02,591 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 32 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:25:02,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:25:02,592 INFO L225 Difference]: With dead ends: 574 [2021-05-03 00:25:02,592 INFO L226 Difference]: Without dead ends: 367 [2021-05-03 00:25:02,593 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 6 SyntacticMatches, 29 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 2036.3ms TimeCoverageRelationStatistics Valid=142, Invalid=1190, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:25:02,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-05-03 00:25:03,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 269. [2021-05-03 00:25:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 259 states have (on average 1.138996138996139) internal successors, (295), 259 states have internal predecessors, (295), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:25:03,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 306 transitions. [2021-05-03 00:25:03,161 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 306 transitions. Word has length 73 [2021-05-03 00:25:03,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:25:03,161 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 306 transitions. [2021-05-03 00:25:03,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 32 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:03,161 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 306 transitions. [2021-05-03 00:25:03,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:25:03,161 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:25:03,161 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:25:03,161 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable711 [2021-05-03 00:25:03,162 INFO L428 AbstractCegarLoop]: === Iteration 164 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:25:03,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:25:03,162 INFO L82 PathProgramCache]: Analyzing trace with hash -354625761, now seen corresponding path program 125 times [2021-05-03 00:25:03,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:25:03,162 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1185301727] [2021-05-03 00:25:03,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:25:03,170 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3120 v_~SIZE~0_561) (<= v_~last~0_566 v_main_~c~0_3120)) InVars {~SIZE~0=v_~SIZE~0_561, main_~c~0=v_main_~c~0_3120, ~last~0=v_~last~0_566} OutVars{~SIZE~0=v_~SIZE~0_561, main_~c~0=v_main_~c~0_3120, ~last~0=v_~last~0_566} AuxVars[] AssignedVars[] [2021-05-03 00:25:03,172 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:03,173 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:03,174 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:03,203 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:03,207 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:03,263 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:03,316 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3122 v_~last~0_567) (< v_main_~c~0_3122 v_~SIZE~0_562)) InVars {~SIZE~0=v_~SIZE~0_562, main_~c~0=v_main_~c~0_3122, ~last~0=v_~last~0_567} OutVars{~SIZE~0=v_~SIZE~0_562, main_~c~0=v_main_~c~0_3122, ~last~0=v_~last~0_567} AuxVars[] AssignedVars[] [2021-05-03 00:25:03,318 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:25:03,319 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:03,320 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:03,349 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:03,355 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:03,409 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:25:03,453 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:03,457 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_568 v_main_~c~0_3124) (< (+ v_main_~c~0_3124 1) v_~SIZE~0_563)) InVars {~SIZE~0=v_~SIZE~0_563, main_~c~0=v_main_~c~0_3124, ~last~0=v_~last~0_568} OutVars{~SIZE~0=v_~SIZE~0_563, main_~c~0=v_main_~c~0_3124, ~last~0=v_~last~0_568} AuxVars[] AssignedVars[] [2021-05-03 00:25:03,459 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:25:03,499 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:03,502 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:03,531 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:03,536 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:03,581 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:25:03,629 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3126 v_~last~0_569) (< (+ v_main_~c~0_3126 1) v_~SIZE~0_564)) InVars {~SIZE~0=v_~SIZE~0_564, main_~c~0=v_main_~c~0_3126, ~last~0=v_~last~0_569} OutVars{~SIZE~0=v_~SIZE~0_564, main_~c~0=v_main_~c~0_3126, ~last~0=v_~last~0_569} AuxVars[] AssignedVars[] [2021-05-03 00:25:03,632 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:03,634 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:03,637 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:03,673 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:03,688 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:03,768 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:03,838 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:04,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:25:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:04,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:25:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:25:04,332 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:25:04,516 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2021-05-03 00:25:06,458 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:25:06,458 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1185301727] [2021-05-03 00:25:06,458 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1185301727] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:25:06,458 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:25:06,458 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-03 00:25:06,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037821324] [2021-05-03 00:25:06,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-03 00:25:06,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:25:06,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-03 00:25:06,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1121, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:25:06,459 INFO L87 Difference]: Start difference. First operand 269 states and 306 transitions. Second operand has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 33 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:25:10,579 INFO L93 Difference]: Finished difference Result 571 states and 634 transitions. [2021-05-03 00:25:10,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:25:10,581 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 33 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:25:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:25:10,582 INFO L225 Difference]: With dead ends: 571 [2021-05-03 00:25:10,582 INFO L226 Difference]: Without dead ends: 364 [2021-05-03 00:25:10,583 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 7 SyntacticMatches, 27 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 2395.1ms TimeCoverageRelationStatistics Valid=149, Invalid=1257, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:25:10,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-05-03 00:25:11,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 269. [2021-05-03 00:25:11,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 259 states have (on average 1.138996138996139) internal successors, (295), 259 states have internal predecessors, (295), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:25:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 306 transitions. [2021-05-03 00:25:11,079 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 306 transitions. Word has length 73 [2021-05-03 00:25:11,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:25:11,079 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 306 transitions. [2021-05-03 00:25:11,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 33 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:11,079 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 306 transitions. [2021-05-03 00:25:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:25:11,079 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:25:11,079 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:25:11,079 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable716 [2021-05-03 00:25:11,079 INFO L428 AbstractCegarLoop]: === Iteration 165 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:25:11,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:25:11,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1890953693, now seen corresponding path program 126 times [2021-05-03 00:25:11,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:25:11,080 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [870821487] [2021-05-03 00:25:11,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:25:11,089 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3147 v_~SIZE~0_565) (<= v_~last~0_570 v_main_~c~0_3147)) InVars {~SIZE~0=v_~SIZE~0_565, main_~c~0=v_main_~c~0_3147, ~last~0=v_~last~0_570} OutVars{~SIZE~0=v_~SIZE~0_565, main_~c~0=v_main_~c~0_3147, ~last~0=v_~last~0_570} AuxVars[] AssignedVars[] [2021-05-03 00:25:11,091 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:11,113 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:11,116 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:11,130 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:11,133 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:11,157 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:11,187 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3149 v_~SIZE~0_566) (< v_main_~c~0_3149 v_~last~0_571)) InVars {~SIZE~0=v_~SIZE~0_566, main_~c~0=v_main_~c~0_3149, ~last~0=v_~last~0_571} OutVars{~SIZE~0=v_~SIZE~0_566, main_~c~0=v_main_~c~0_3149, ~last~0=v_~last~0_571} AuxVars[] AssignedVars[] [2021-05-03 00:25:11,189 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:25:11,206 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:11,208 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:11,225 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:11,232 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:11,250 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:25:11,278 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:11,281 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3151 1) v_~SIZE~0_567) (<= v_~last~0_572 v_main_~c~0_3151)) InVars {~SIZE~0=v_~SIZE~0_567, main_~c~0=v_main_~c~0_3151, ~last~0=v_~last~0_572} OutVars{~SIZE~0=v_~SIZE~0_567, main_~c~0=v_main_~c~0_3151, ~last~0=v_~last~0_572} AuxVars[] AssignedVars[] [2021-05-03 00:25:11,283 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:25:11,284 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:11,285 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:11,305 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:11,311 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:11,364 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:25:11,405 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3153 1) v_~SIZE~0_568) (< v_main_~c~0_3153 v_~last~0_573)) InVars {~SIZE~0=v_~SIZE~0_568, main_~c~0=v_main_~c~0_3153, ~last~0=v_~last~0_573} OutVars{~SIZE~0=v_~SIZE~0_568, main_~c~0=v_main_~c~0_3153, ~last~0=v_~last~0_573} AuxVars[] AssignedVars[] [2021-05-03 00:25:11,407 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:11,430 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:11,432 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:11,453 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:11,458 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:11,476 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:11,501 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:11,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:25:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:11,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:25:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:11,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:25:11,836 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:25:11,974 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2021-05-03 00:25:14,532 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:25:14,532 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [870821487] [2021-05-03 00:25:14,533 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [870821487] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:25:14,533 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:25:14,533 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-03 00:25:14,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219610521] [2021-05-03 00:25:14,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-03 00:25:14,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:25:14,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-03 00:25:14,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1186, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:25:14,534 INFO L87 Difference]: Start difference. First operand 269 states and 306 transitions. Second operand has 36 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 34 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:18,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:25:18,344 INFO L93 Difference]: Finished difference Result 568 states and 631 transitions. [2021-05-03 00:25:18,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:25:18,346 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 34 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:25:18,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:25:18,347 INFO L225 Difference]: With dead ends: 568 [2021-05-03 00:25:18,347 INFO L226 Difference]: Without dead ends: 361 [2021-05-03 00:25:18,349 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 6 SyntacticMatches, 27 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 2846.7ms TimeCoverageRelationStatistics Valid=156, Invalid=1326, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:25:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-05-03 00:25:18,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 269. [2021-05-03 00:25:18,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 259 states have (on average 1.138996138996139) internal successors, (295), 259 states have internal predecessors, (295), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:25:18,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 306 transitions. [2021-05-03 00:25:18,895 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 306 transitions. Word has length 73 [2021-05-03 00:25:18,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:25:18,895 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 306 transitions. [2021-05-03 00:25:18,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 34 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 306 transitions. [2021-05-03 00:25:18,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:25:18,895 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:25:18,895 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:25:18,895 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable721 [2021-05-03 00:25:18,896 INFO L428 AbstractCegarLoop]: === Iteration 166 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:25:18,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:25:18,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1980366881, now seen corresponding path program 127 times [2021-05-03 00:25:18,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:25:18,896 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [973419740] [2021-05-03 00:25:18,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:25:18,904 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_574 v_main_~c~0_3174) (< v_main_~c~0_3174 v_~SIZE~0_569)) InVars {~SIZE~0=v_~SIZE~0_569, main_~c~0=v_main_~c~0_3174, ~last~0=v_~last~0_574} OutVars{~SIZE~0=v_~SIZE~0_569, main_~c~0=v_main_~c~0_3174, ~last~0=v_~last~0_574} AuxVars[] AssignedVars[] [2021-05-03 00:25:18,906 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:18,907 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:18,908 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:18,921 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:18,925 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:18,963 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:19,001 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3176 v_~last~0_575) (< v_main_~c~0_3176 v_~SIZE~0_570)) InVars {~SIZE~0=v_~SIZE~0_570, main_~c~0=v_main_~c~0_3176, ~last~0=v_~last~0_575} OutVars{~SIZE~0=v_~SIZE~0_570, main_~c~0=v_main_~c~0_3176, ~last~0=v_~last~0_575} AuxVars[] AssignedVars[] [2021-05-03 00:25:19,003 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:25:19,004 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:19,006 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:19,022 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:19,029 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:19,060 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:25:19,124 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:19,129 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_576 v_main_~c~0_3178) (< (+ v_main_~c~0_3178 1) v_~SIZE~0_571)) InVars {~SIZE~0=v_~SIZE~0_571, main_~c~0=v_main_~c~0_3178, ~last~0=v_~last~0_576} OutVars{~SIZE~0=v_~SIZE~0_571, main_~c~0=v_main_~c~0_3178, ~last~0=v_~last~0_576} AuxVars[] AssignedVars[] [2021-05-03 00:25:19,132 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:25:19,135 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:19,138 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:19,167 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:19,175 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:19,258 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:25:19,336 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3180 v_~last~0_577) (< (+ v_main_~c~0_3180 1) v_~SIZE~0_572)) InVars {~SIZE~0=v_~SIZE~0_572, main_~c~0=v_main_~c~0_3180, ~last~0=v_~last~0_577} OutVars{~SIZE~0=v_~SIZE~0_572, main_~c~0=v_main_~c~0_3180, ~last~0=v_~last~0_577} AuxVars[] AssignedVars[] [2021-05-03 00:25:19,338 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:19,378 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:19,381 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:19,423 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:19,438 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:19,484 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:19,560 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:19,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:25:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:19,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:25:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:19,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:25:19,984 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:25:20,143 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2021-05-03 00:25:22,144 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:25:22,144 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [973419740] [2021-05-03 00:25:22,144 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [973419740] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:25:22,144 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:25:22,144 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-03 00:25:22,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649256114] [2021-05-03 00:25:22,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-03 00:25:22,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:25:22,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-03 00:25:22,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1253, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:25:22,145 INFO L87 Difference]: Start difference. First operand 269 states and 306 transitions. Second operand has 37 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 35 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:25,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:25:25,331 INFO L93 Difference]: Finished difference Result 565 states and 628 transitions. [2021-05-03 00:25:25,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-03 00:25:25,335 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 35 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:25:25,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:25:25,336 INFO L225 Difference]: With dead ends: 565 [2021-05-03 00:25:25,336 INFO L226 Difference]: Without dead ends: 358 [2021-05-03 00:25:25,336 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 6 SyntacticMatches, 26 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 2388.1ms TimeCoverageRelationStatistics Valid=163, Invalid=1397, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:25:25,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-05-03 00:25:25,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 269. [2021-05-03 00:25:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 259 states have (on average 1.138996138996139) internal successors, (295), 259 states have internal predecessors, (295), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:25:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 306 transitions. [2021-05-03 00:25:25,975 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 306 transitions. Word has length 73 [2021-05-03 00:25:25,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:25:25,975 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 306 transitions. [2021-05-03 00:25:25,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 35 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 306 transitions. [2021-05-03 00:25:25,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:25:25,975 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:25:25,975 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:25:25,975 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable726 [2021-05-03 00:25:25,975 INFO L428 AbstractCegarLoop]: === Iteration 167 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:25:25,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:25:25,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1285241117, now seen corresponding path program 128 times [2021-05-03 00:25:25,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:25:25,976 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1914066030] [2021-05-03 00:25:25,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:25:25,987 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_578 v_main_~c~0_3201) (< v_main_~c~0_3201 v_~SIZE~0_573)) InVars {~SIZE~0=v_~SIZE~0_573, main_~c~0=v_main_~c~0_3201, ~last~0=v_~last~0_578} OutVars{~SIZE~0=v_~SIZE~0_573, main_~c~0=v_main_~c~0_3201, ~last~0=v_~last~0_578} AuxVars[] AssignedVars[] [2021-05-03 00:25:25,989 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:25,990 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:25,992 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:26,010 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:26,015 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:26,053 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:26,081 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3203 v_~SIZE~0_574) (< v_main_~c~0_3203 v_~last~0_579)) InVars {~SIZE~0=v_~SIZE~0_574, main_~c~0=v_main_~c~0_3203, ~last~0=v_~last~0_579} OutVars{~SIZE~0=v_~SIZE~0_574, main_~c~0=v_main_~c~0_3203, ~last~0=v_~last~0_579} AuxVars[] AssignedVars[] [2021-05-03 00:25:26,083 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:25:26,098 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:26,100 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:26,123 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:26,133 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:26,158 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:25:26,202 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:26,205 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_580 v_main_~c~0_3205) (< (+ v_main_~c~0_3205 1) v_~SIZE~0_575)) InVars {~SIZE~0=v_~SIZE~0_575, main_~c~0=v_main_~c~0_3205, ~last~0=v_~last~0_580} OutVars{~SIZE~0=v_~SIZE~0_575, main_~c~0=v_main_~c~0_3205, ~last~0=v_~last~0_580} AuxVars[] AssignedVars[] [2021-05-03 00:25:26,207 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:25:26,236 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:26,238 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:26,259 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:26,264 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:26,295 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:25:26,338 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3207 1) v_~SIZE~0_576) (< v_main_~c~0_3207 v_~last~0_581)) InVars {~SIZE~0=v_~SIZE~0_576, main_~c~0=v_main_~c~0_3207, ~last~0=v_~last~0_581} OutVars{~SIZE~0=v_~SIZE~0_576, main_~c~0=v_main_~c~0_3207, ~last~0=v_~last~0_581} AuxVars[] AssignedVars[] [2021-05-03 00:25:26,340 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:26,341 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:26,343 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:26,362 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:26,368 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:26,405 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:26,440 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:26,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:25:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:26,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:25:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:26,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:25:26,665 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:25:29,194 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:25:29,194 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1914066030] [2021-05-03 00:25:29,195 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1914066030] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:25:29,195 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:25:29,195 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-03 00:25:29,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330826022] [2021-05-03 00:25:29,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-03 00:25:29,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:25:29,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-03 00:25:29,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1322, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:25:29,196 INFO L87 Difference]: Start difference. First operand 269 states and 306 transitions. Second operand has 38 states, 38 states have (on average 1.763157894736842) internal successors, (67), 36 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:32,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:25:32,890 INFO L93 Difference]: Finished difference Result 562 states and 625 transitions. [2021-05-03 00:25:32,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-03 00:25:32,892 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.763157894736842) internal successors, (67), 36 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:25:32,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:25:32,893 INFO L225 Difference]: With dead ends: 562 [2021-05-03 00:25:32,893 INFO L226 Difference]: Without dead ends: 355 [2021-05-03 00:25:32,894 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 6 SyntacticMatches, 25 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 2658.6ms TimeCoverageRelationStatistics Valid=170, Invalid=1470, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:25:32,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2021-05-03 00:25:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 269. [2021-05-03 00:25:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 259 states have (on average 1.138996138996139) internal successors, (295), 259 states have internal predecessors, (295), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:25:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 306 transitions. [2021-05-03 00:25:33,529 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 306 transitions. Word has length 73 [2021-05-03 00:25:33,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:25:33,529 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 306 transitions. [2021-05-03 00:25:33,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 1.763157894736842) internal successors, (67), 36 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:33,529 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 306 transitions. [2021-05-03 00:25:33,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:25:33,529 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:25:33,530 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:25:33,530 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable731 [2021-05-03 00:25:33,530 INFO L428 AbstractCegarLoop]: === Iteration 168 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:25:33,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:25:33,530 INFO L82 PathProgramCache]: Analyzing trace with hash 441235615, now seen corresponding path program 129 times [2021-05-03 00:25:33,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:25:33,530 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1389965492] [2021-05-03 00:25:33,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:25:33,547 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3228 v_~SIZE~0_577) (<= v_~last~0_582 v_main_~c~0_3228)) InVars {~SIZE~0=v_~SIZE~0_577, main_~c~0=v_main_~c~0_3228, ~last~0=v_~last~0_582} OutVars{~SIZE~0=v_~SIZE~0_577, main_~c~0=v_main_~c~0_3228, ~last~0=v_~last~0_582} AuxVars[] AssignedVars[] [2021-05-03 00:25:33,550 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:33,552 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:33,556 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:33,595 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:33,609 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:33,717 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:33,821 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3230 v_~SIZE~0_578) (< v_main_~c~0_3230 v_~last~0_583)) InVars {~SIZE~0=v_~SIZE~0_578, main_~c~0=v_main_~c~0_3230, ~last~0=v_~last~0_583} OutVars{~SIZE~0=v_~SIZE~0_578, main_~c~0=v_main_~c~0_3230, ~last~0=v_~last~0_583} AuxVars[] AssignedVars[] [2021-05-03 00:25:33,824 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:25:33,827 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:33,832 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:33,893 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:33,917 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:34,014 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:25:34,106 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:34,112 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_584 v_main_~c~0_3232) (< (+ v_main_~c~0_3232 1) v_~SIZE~0_579)) InVars {~SIZE~0=v_~SIZE~0_579, main_~c~0=v_main_~c~0_3232, ~last~0=v_~last~0_584} OutVars{~SIZE~0=v_~SIZE~0_579, main_~c~0=v_main_~c~0_3232, ~last~0=v_~last~0_584} AuxVars[] AssignedVars[] [2021-05-03 00:25:34,116 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:25:34,118 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:34,123 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:34,159 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:34,170 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:34,275 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:25:34,363 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3234 v_~last~0_585) (< (+ v_main_~c~0_3234 1) v_~SIZE~0_580)) InVars {~SIZE~0=v_~SIZE~0_580, main_~c~0=v_main_~c~0_3234, ~last~0=v_~last~0_585} OutVars{~SIZE~0=v_~SIZE~0_580, main_~c~0=v_main_~c~0_3234, ~last~0=v_~last~0_585} AuxVars[] AssignedVars[] [2021-05-03 00:25:34,365 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:34,408 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:34,412 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:34,450 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:34,465 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:34,511 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:34,599 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:35,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:25:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:35,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:25:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:25:35,061 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:25:35,217 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2021-05-03 00:25:39,795 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:25:39,796 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1389965492] [2021-05-03 00:25:39,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1389965492] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:25:39,796 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:25:39,796 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-03 00:25:39,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456379171] [2021-05-03 00:25:39,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-03 00:25:39,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:25:39,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-03 00:25:39,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1393, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:25:39,797 INFO L87 Difference]: Start difference. First operand 269 states and 306 transitions. Second operand has 39 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 37 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:44,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:25:44,877 INFO L93 Difference]: Finished difference Result 559 states and 622 transitions. [2021-05-03 00:25:44,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-03 00:25:44,880 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 37 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:25:44,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:25:44,881 INFO L225 Difference]: With dead ends: 559 [2021-05-03 00:25:44,881 INFO L226 Difference]: Without dead ends: 352 [2021-05-03 00:25:44,882 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 6 SyntacticMatches, 24 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 5019.5ms TimeCoverageRelationStatistics Valid=177, Invalid=1545, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:25:44,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-05-03 00:25:45,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 269. [2021-05-03 00:25:45,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 259 states have (on average 1.138996138996139) internal successors, (295), 259 states have internal predecessors, (295), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:25:45,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 306 transitions. [2021-05-03 00:25:45,684 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 306 transitions. Word has length 73 [2021-05-03 00:25:45,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:25:45,684 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 306 transitions. [2021-05-03 00:25:45,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 37 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:45,684 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 306 transitions. [2021-05-03 00:25:45,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:25:45,684 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:25:45,684 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:25:45,684 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable736 [2021-05-03 00:25:45,684 INFO L428 AbstractCegarLoop]: === Iteration 169 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:25:45,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:25:45,685 INFO L82 PathProgramCache]: Analyzing trace with hash 715995229, now seen corresponding path program 130 times [2021-05-03 00:25:45,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:25:45,685 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1543647428] [2021-05-03 00:25:45,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:25:45,700 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_586 v_main_~c~0_3255) (< v_main_~c~0_3255 v_~SIZE~0_581)) InVars {~SIZE~0=v_~SIZE~0_581, main_~c~0=v_main_~c~0_3255, ~last~0=v_~last~0_586} OutVars{~SIZE~0=v_~SIZE~0_581, main_~c~0=v_main_~c~0_3255, ~last~0=v_~last~0_586} AuxVars[] AssignedVars[] [2021-05-03 00:25:45,703 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:45,705 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:45,709 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:45,737 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:45,746 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:45,831 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:45,909 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3257 v_~SIZE~0_582) (< v_main_~c~0_3257 v_~last~0_587)) InVars {~SIZE~0=v_~SIZE~0_582, main_~c~0=v_main_~c~0_3257, ~last~0=v_~last~0_587} OutVars{~SIZE~0=v_~SIZE~0_582, main_~c~0=v_main_~c~0_3257, ~last~0=v_~last~0_587} AuxVars[] AssignedVars[] [2021-05-03 00:25:45,911 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:25:45,949 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:45,952 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:45,991 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:46,011 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:46,054 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:25:46,127 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:46,133 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3259 1) v_~SIZE~0_583) (<= v_~last~0_588 v_main_~c~0_3259)) InVars {~SIZE~0=v_~SIZE~0_583, main_~c~0=v_main_~c~0_3259, ~last~0=v_~last~0_588} OutVars{~SIZE~0=v_~SIZE~0_583, main_~c~0=v_main_~c~0_3259, ~last~0=v_~last~0_588} AuxVars[] AssignedVars[] [2021-05-03 00:25:46,137 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:25:46,140 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:46,144 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:46,181 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:46,192 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:46,294 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:25:46,394 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3261 1) v_~SIZE~0_584) (< v_main_~c~0_3261 v_~last~0_589)) InVars {~SIZE~0=v_~SIZE~0_584, main_~c~0=v_main_~c~0_3261, ~last~0=v_~last~0_589} OutVars{~SIZE~0=v_~SIZE~0_584, main_~c~0=v_main_~c~0_3261, ~last~0=v_~last~0_589} AuxVars[] AssignedVars[] [2021-05-03 00:25:46,397 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:46,400 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:46,404 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:46,461 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:46,480 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:46,579 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:46,671 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:47,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:25:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:47,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:25:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:25:47,142 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:25:47,302 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2021-05-03 00:25:50,091 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:25:50,091 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1543647428] [2021-05-03 00:25:50,091 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1543647428] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:25:50,091 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:25:50,091 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-03 00:25:50,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125775969] [2021-05-03 00:25:50,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-03 00:25:50,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:25:50,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-03 00:25:50,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1466, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:25:50,093 INFO L87 Difference]: Start difference. First operand 269 states and 306 transitions. Second operand has 40 states, 40 states have (on average 1.675) internal successors, (67), 38 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:54,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:25:54,177 INFO L93 Difference]: Finished difference Result 556 states and 619 transitions. [2021-05-03 00:25:54,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-03 00:25:54,180 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.675) internal successors, (67), 38 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:25:54,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:25:54,181 INFO L225 Difference]: With dead ends: 556 [2021-05-03 00:25:54,181 INFO L226 Difference]: Without dead ends: 349 [2021-05-03 00:25:54,182 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 9 SyntacticMatches, 20 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 3260.7ms TimeCoverageRelationStatistics Valid=184, Invalid=1622, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:25:54,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-05-03 00:25:54,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 269. [2021-05-03 00:25:54,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 259 states have (on average 1.138996138996139) internal successors, (295), 259 states have internal predecessors, (295), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:25:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 306 transitions. [2021-05-03 00:25:54,978 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 306 transitions. Word has length 73 [2021-05-03 00:25:54,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:25:54,978 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 306 transitions. [2021-05-03 00:25:54,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 1.675) internal successors, (67), 38 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:25:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 306 transitions. [2021-05-03 00:25:54,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:25:54,978 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:25:54,978 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:25:54,979 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable741 [2021-05-03 00:25:54,979 INFO L428 AbstractCegarLoop]: === Iteration 170 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:25:54,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:25:54,979 INFO L82 PathProgramCache]: Analyzing trace with hash 2102198623, now seen corresponding path program 131 times [2021-05-03 00:25:54,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:25:54,979 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1259303389] [2021-05-03 00:25:54,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:25:54,994 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3282 v_~SIZE~0_585) (<= v_~last~0_590 v_main_~c~0_3282)) InVars {~SIZE~0=v_~SIZE~0_585, main_~c~0=v_main_~c~0_3282, ~last~0=v_~last~0_590} OutVars{~SIZE~0=v_~SIZE~0_585, main_~c~0=v_main_~c~0_3282, ~last~0=v_~last~0_590} AuxVars[] AssignedVars[] [2021-05-03 00:25:54,997 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:55,041 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:55,044 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:55,076 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:55,084 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:55,137 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:55,225 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3284 v_~SIZE~0_586) (< v_main_~c~0_3284 v_~last~0_591)) InVars {~SIZE~0=v_~SIZE~0_586, main_~c~0=v_main_~c~0_3284, ~last~0=v_~last~0_591} OutVars{~SIZE~0=v_~SIZE~0_586, main_~c~0=v_main_~c~0_3284, ~last~0=v_~last~0_591} AuxVars[] AssignedVars[] [2021-05-03 00:25:55,227 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:25:55,230 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:55,234 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:55,278 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:55,290 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:55,368 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:25:55,434 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:55,439 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3286 1) v_~SIZE~0_587) (<= v_~last~0_592 v_main_~c~0_3286)) InVars {~SIZE~0=v_~SIZE~0_587, main_~c~0=v_main_~c~0_3286, ~last~0=v_~last~0_592} OutVars{~SIZE~0=v_~SIZE~0_587, main_~c~0=v_main_~c~0_3286, ~last~0=v_~last~0_592} AuxVars[] AssignedVars[] [2021-05-03 00:25:55,442 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:25:55,483 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:55,487 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:55,516 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:55,524 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:55,573 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:25:55,648 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3288 v_~last~0_593) (< (+ v_main_~c~0_3288 1) v_~SIZE~0_588)) InVars {~SIZE~0=v_~SIZE~0_588, main_~c~0=v_main_~c~0_3288, ~last~0=v_~last~0_593} OutVars{~SIZE~0=v_~SIZE~0_588, main_~c~0=v_main_~c~0_3288, ~last~0=v_~last~0_593} AuxVars[] AssignedVars[] [2021-05-03 00:25:55,651 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:25:55,653 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:55,656 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:55,695 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:25:55,711 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:25:55,780 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:25:55,853 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:56,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:25:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:56,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:25:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:56,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:25:56,266 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:25:56,437 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2021-05-03 00:26:01,639 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:26:01,639 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1259303389] [2021-05-03 00:26:01,639 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1259303389] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:26:01,639 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:26:01,639 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-05-03 00:26:01,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062008478] [2021-05-03 00:26:01,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-05-03 00:26:01,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:26:01,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-05-03 00:26:01,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1541, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:26:01,640 INFO L87 Difference]: Start difference. First operand 269 states and 306 transitions. Second operand has 41 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 39 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:05,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:26:05,366 INFO L93 Difference]: Finished difference Result 553 states and 616 transitions. [2021-05-03 00:26:05,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-03 00:26:05,370 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 39 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:26:05,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:26:05,371 INFO L225 Difference]: With dead ends: 553 [2021-05-03 00:26:05,371 INFO L226 Difference]: Without dead ends: 346 [2021-05-03 00:26:05,371 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 6 SyntacticMatches, 22 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 5545.3ms TimeCoverageRelationStatistics Valid=191, Invalid=1701, Unknown=0, NotChecked=0, Total=1892 [2021-05-03 00:26:05,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-05-03 00:26:05,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 269. [2021-05-03 00:26:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 259 states have (on average 1.138996138996139) internal successors, (295), 259 states have internal predecessors, (295), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:26:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 306 transitions. [2021-05-03 00:26:05,890 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 306 transitions. Word has length 73 [2021-05-03 00:26:05,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:26:05,890 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 306 transitions. [2021-05-03 00:26:05,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 41 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 39 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:05,890 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 306 transitions. [2021-05-03 00:26:05,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:26:05,890 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:26:05,890 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:26:05,890 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable746 [2021-05-03 00:26:05,890 INFO L428 AbstractCegarLoop]: === Iteration 171 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:26:05,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:26:05,891 INFO L82 PathProgramCache]: Analyzing trace with hash -2130729059, now seen corresponding path program 132 times [2021-05-03 00:26:05,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:26:05,891 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [836241593] [2021-05-03 00:26:05,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:26:05,899 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_594 v_main_~c~0_3309) (< v_main_~c~0_3309 v_~SIZE~0_589)) InVars {~SIZE~0=v_~SIZE~0_589, main_~c~0=v_main_~c~0_3309, ~last~0=v_~last~0_594} OutVars{~SIZE~0=v_~SIZE~0_589, main_~c~0=v_main_~c~0_3309, ~last~0=v_~last~0_594} AuxVars[] AssignedVars[] [2021-05-03 00:26:05,901 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:05,902 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:05,904 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:05,920 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:05,924 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:05,963 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:05,995 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3311 v_~last~0_595) (< v_main_~c~0_3311 v_~SIZE~0_590)) InVars {~SIZE~0=v_~SIZE~0_590, main_~c~0=v_main_~c~0_3311, ~last~0=v_~last~0_595} OutVars{~SIZE~0=v_~SIZE~0_590, main_~c~0=v_main_~c~0_3311, ~last~0=v_~last~0_595} AuxVars[] AssignedVars[] [2021-05-03 00:26:05,996 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:26:06,013 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:06,015 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:06,034 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:06,041 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:06,062 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:26:06,095 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:26:06,098 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_596 v_main_~c~0_3313) (< (+ v_main_~c~0_3313 1) v_~SIZE~0_591)) InVars {~SIZE~0=v_~SIZE~0_591, main_~c~0=v_main_~c~0_3313, ~last~0=v_~last~0_596} OutVars{~SIZE~0=v_~SIZE~0_591, main_~c~0=v_main_~c~0_3313, ~last~0=v_~last~0_596} AuxVars[] AssignedVars[] [2021-05-03 00:26:06,099 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:26:06,100 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:06,102 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:06,123 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:26:06,128 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:26:06,180 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:26:06,224 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3315 1) v_~SIZE~0_592) (< v_main_~c~0_3315 v_~last~0_597)) InVars {~SIZE~0=v_~SIZE~0_592, main_~c~0=v_main_~c~0_3315, ~last~0=v_~last~0_597} OutVars{~SIZE~0=v_~SIZE~0_592, main_~c~0=v_main_~c~0_3315, ~last~0=v_~last~0_597} AuxVars[] AssignedVars[] [2021-05-03 00:26:06,226 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:06,243 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:06,245 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:06,264 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:26:06,270 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:26:06,291 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:06,320 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:26:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:06,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:26:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:06,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:26:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:26:06,526 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:26:08,850 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:26:08,850 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [836241593] [2021-05-03 00:26:08,850 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [836241593] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:26:08,850 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:26:08,850 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-03 00:26:08,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375047614] [2021-05-03 00:26:08,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-03 00:26:08,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:26:08,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-03 00:26:08,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1618, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:26:08,851 INFO L87 Difference]: Start difference. First operand 269 states and 306 transitions. Second operand has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 40 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:26:11,896 INFO L93 Difference]: Finished difference Result 550 states and 613 transitions. [2021-05-03 00:26:11,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-03 00:26:11,897 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 40 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:26:11,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:26:11,898 INFO L225 Difference]: With dead ends: 550 [2021-05-03 00:26:11,898 INFO L226 Difference]: Without dead ends: 343 [2021-05-03 00:26:11,898 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 7 SyntacticMatches, 20 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 2446.9ms TimeCoverageRelationStatistics Valid=198, Invalid=1782, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:26:11,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-05-03 00:26:12,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 269. [2021-05-03 00:26:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 259 states have (on average 1.138996138996139) internal successors, (295), 259 states have internal predecessors, (295), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:26:12,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 306 transitions. [2021-05-03 00:26:12,379 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 306 transitions. Word has length 73 [2021-05-03 00:26:12,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:26:12,379 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 306 transitions. [2021-05-03 00:26:12,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 40 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:12,380 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 306 transitions. [2021-05-03 00:26:12,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:26:12,380 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:26:12,380 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 13, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:26:12,380 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable751 [2021-05-03 00:26:12,380 INFO L428 AbstractCegarLoop]: === Iteration 172 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:26:12,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:26:12,381 INFO L82 PathProgramCache]: Analyzing trace with hash 358799903, now seen corresponding path program 133 times [2021-05-03 00:26:12,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:26:12,381 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2024322050] [2021-05-03 00:26:12,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:26:12,390 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_598 v_main_~c~0_3336) (< v_main_~c~0_3336 v_~SIZE~0_593)) InVars {~SIZE~0=v_~SIZE~0_593, main_~c~0=v_main_~c~0_3336, ~last~0=v_~last~0_598} OutVars{~SIZE~0=v_~SIZE~0_593, main_~c~0=v_main_~c~0_3336, ~last~0=v_~last~0_598} AuxVars[] AssignedVars[] [2021-05-03 00:26:12,391 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:12,392 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:12,394 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:12,408 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:12,411 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:12,449 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:12,477 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3338 v_~last~0_599) (< v_main_~c~0_3338 v_~SIZE~0_594)) InVars {~SIZE~0=v_~SIZE~0_594, main_~c~0=v_main_~c~0_3338, ~last~0=v_~last~0_599} OutVars{~SIZE~0=v_~SIZE~0_594, main_~c~0=v_main_~c~0_3338, ~last~0=v_~last~0_599} AuxVars[] AssignedVars[] [2021-05-03 00:26:12,478 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:26:12,494 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:12,496 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:12,513 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:12,519 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:12,538 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:26:12,564 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:26:12,566 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_600 v_main_~c~0_3340) (< (+ v_main_~c~0_3340 1) v_~SIZE~0_595)) InVars {~SIZE~0=v_~SIZE~0_595, main_~c~0=v_main_~c~0_3340, ~last~0=v_~last~0_600} OutVars{~SIZE~0=v_~SIZE~0_595, main_~c~0=v_main_~c~0_3340, ~last~0=v_~last~0_600} AuxVars[] AssignedVars[] [2021-05-03 00:26:12,568 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:26:12,569 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:12,570 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:12,585 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:26:12,588 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:26:12,623 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:26:12,652 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3342 1) v_~SIZE~0_596) (< v_main_~c~0_3342 v_~last~0_601)) InVars {~SIZE~0=v_~SIZE~0_596, main_~c~0=v_main_~c~0_3342, ~last~0=v_~last~0_601} OutVars{~SIZE~0=v_~SIZE~0_596, main_~c~0=v_main_~c~0_3342, ~last~0=v_~last~0_601} AuxVars[] AssignedVars[] [2021-05-03 00:26:12,653 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:12,668 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:12,670 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:12,686 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:26:12,692 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:26:12,711 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:12,744 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:26:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:12,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:26:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:12,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:26:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:12,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:26:12,960 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:26:15,200 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:26:15,200 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2024322050] [2021-05-03 00:26:15,200 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2024322050] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:26:15,200 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:26:15,201 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2021-05-03 00:26:15,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962558367] [2021-05-03 00:26:15,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-05-03 00:26:15,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:26:15,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-05-03 00:26:15,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1697, Unknown=0, NotChecked=0, Total=1892 [2021-05-03 00:26:15,201 INFO L87 Difference]: Start difference. First operand 269 states and 306 transitions. Second operand has 43 states, 43 states have (on average 1.558139534883721) internal successors, (67), 41 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:18,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:26:18,536 INFO L93 Difference]: Finished difference Result 547 states and 610 transitions. [2021-05-03 00:26:18,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-03 00:26:18,538 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.558139534883721) internal successors, (67), 41 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:26:18,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:26:18,538 INFO L225 Difference]: With dead ends: 547 [2021-05-03 00:26:18,538 INFO L226 Difference]: Without dead ends: 340 [2021-05-03 00:26:18,539 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 6 SyntacticMatches, 20 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 2383.9ms TimeCoverageRelationStatistics Valid=205, Invalid=1865, Unknown=0, NotChecked=0, Total=2070 [2021-05-03 00:26:18,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-05-03 00:26:19,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 269. [2021-05-03 00:26:19,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 259 states have (on average 1.138996138996139) internal successors, (295), 259 states have internal predecessors, (295), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:26:19,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 306 transitions. [2021-05-03 00:26:19,115 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 306 transitions. Word has length 73 [2021-05-03 00:26:19,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:26:19,115 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 306 transitions. [2021-05-03 00:26:19,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 43 states, 43 states have (on average 1.558139534883721) internal successors, (67), 41 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:19,115 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 306 transitions. [2021-05-03 00:26:19,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:26:19,116 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:26:19,116 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 14, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:26:19,116 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable756 [2021-05-03 00:26:19,116 INFO L428 AbstractCegarLoop]: === Iteration 173 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:26:19,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:26:19,116 INFO L82 PathProgramCache]: Analyzing trace with hash -458848547, now seen corresponding path program 134 times [2021-05-03 00:26:19,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:26:19,116 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1271371908] [2021-05-03 00:26:19,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:26:19,124 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_602 v_main_~c~0_3363) (< v_main_~c~0_3363 v_~SIZE~0_597)) InVars {~SIZE~0=v_~SIZE~0_597, main_~c~0=v_main_~c~0_3363, ~last~0=v_~last~0_602} OutVars{~SIZE~0=v_~SIZE~0_597, main_~c~0=v_main_~c~0_3363, ~last~0=v_~last~0_602} AuxVars[] AssignedVars[] [2021-05-03 00:26:19,126 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:19,146 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:19,148 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:19,162 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:19,165 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:19,187 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:19,218 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3365 v_~SIZE~0_598) (< v_main_~c~0_3365 v_~last~0_603)) InVars {~SIZE~0=v_~SIZE~0_598, main_~c~0=v_main_~c~0_3365, ~last~0=v_~last~0_603} OutVars{~SIZE~0=v_~SIZE~0_598, main_~c~0=v_main_~c~0_3365, ~last~0=v_~last~0_603} AuxVars[] AssignedVars[] [2021-05-03 00:26:19,219 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:26:19,220 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:19,222 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:19,239 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:19,245 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:19,278 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:26:19,309 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:26:19,311 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3367 1) v_~SIZE~0_599) (<= v_~last~0_604 v_main_~c~0_3367)) InVars {~SIZE~0=v_~SIZE~0_599, main_~c~0=v_main_~c~0_3367, ~last~0=v_~last~0_604} OutVars{~SIZE~0=v_~SIZE~0_599, main_~c~0=v_main_~c~0_3367, ~last~0=v_~last~0_604} AuxVars[] AssignedVars[] [2021-05-03 00:26:19,313 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:26:19,335 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:19,337 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:19,352 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:26:19,357 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:26:19,382 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:26:19,414 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3369 v_~last~0_605) (< (+ v_main_~c~0_3369 1) v_~SIZE~0_600)) InVars {~SIZE~0=v_~SIZE~0_600, main_~c~0=v_main_~c~0_3369, ~last~0=v_~last~0_605} OutVars{~SIZE~0=v_~SIZE~0_600, main_~c~0=v_main_~c~0_3369, ~last~0=v_~last~0_605} AuxVars[] AssignedVars[] [2021-05-03 00:26:19,416 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:19,416 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:19,418 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:19,435 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:26:19,442 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:26:19,476 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:19,506 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:26:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:19,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:26:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:19,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:26:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:26:19,701 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:26:23,199 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:26:23,199 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1271371908] [2021-05-03 00:26:23,199 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1271371908] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:26:23,199 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:26:23,199 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2021-05-03 00:26:23,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173474704] [2021-05-03 00:26:23,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-03 00:26:23,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:26:23,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-03 00:26:23,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1778, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:26:23,200 INFO L87 Difference]: Start difference. First operand 269 states and 306 transitions. Second operand has 44 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 42 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:29,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:26:29,901 INFO L93 Difference]: Finished difference Result 544 states and 607 transitions. [2021-05-03 00:26:29,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-03 00:26:29,904 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 42 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:26:29,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:26:29,905 INFO L225 Difference]: With dead ends: 544 [2021-05-03 00:26:29,905 INFO L226 Difference]: Without dead ends: 337 [2021-05-03 00:26:29,906 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 7 SyntacticMatches, 18 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 3658.4ms TimeCoverageRelationStatistics Valid=212, Invalid=1950, Unknown=0, NotChecked=0, Total=2162 [2021-05-03 00:26:29,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-05-03 00:26:30,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 269. [2021-05-03 00:26:30,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 259 states have (on average 1.138996138996139) internal successors, (295), 259 states have internal predecessors, (295), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:26:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 306 transitions. [2021-05-03 00:26:30,836 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 306 transitions. Word has length 73 [2021-05-03 00:26:30,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:26:30,836 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 306 transitions. [2021-05-03 00:26:30,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 42 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:30,837 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 306 transitions. [2021-05-03 00:26:30,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:26:30,837 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:26:30,837 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:26:30,837 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable761 [2021-05-03 00:26:30,837 INFO L428 AbstractCegarLoop]: === Iteration 174 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:26:30,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:26:30,837 INFO L82 PathProgramCache]: Analyzing trace with hash -2047196449, now seen corresponding path program 135 times [2021-05-03 00:26:30,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:26:30,837 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1987756315] [2021-05-03 00:26:30,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:26:30,850 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3390 v_~SIZE~0_601) (<= v_~last~0_606 v_main_~c~0_3390)) InVars {~SIZE~0=v_~SIZE~0_601, main_~c~0=v_main_~c~0_3390, ~last~0=v_~last~0_606} OutVars{~SIZE~0=v_~SIZE~0_601, main_~c~0=v_main_~c~0_3390, ~last~0=v_~last~0_606} AuxVars[] AssignedVars[] [2021-05-03 00:26:30,852 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:30,854 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:30,857 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:30,880 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:30,887 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:30,949 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:31,004 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3392 v_~SIZE~0_602) (< v_main_~c~0_3392 v_~last~0_607)) InVars {~SIZE~0=v_~SIZE~0_602, main_~c~0=v_main_~c~0_3392, ~last~0=v_~last~0_607} OutVars{~SIZE~0=v_~SIZE~0_602, main_~c~0=v_main_~c~0_3392, ~last~0=v_~last~0_607} AuxVars[] AssignedVars[] [2021-05-03 00:26:31,006 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:26:31,038 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:31,041 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:31,074 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:31,086 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:31,122 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:26:31,185 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:26:31,189 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_608 v_main_~c~0_3394) (< (+ v_main_~c~0_3394 1) v_~SIZE~0_603)) InVars {~SIZE~0=v_~SIZE~0_603, main_~c~0=v_main_~c~0_3394, ~last~0=v_~last~0_608} OutVars{~SIZE~0=v_~SIZE~0_603, main_~c~0=v_main_~c~0_3394, ~last~0=v_~last~0_608} AuxVars[] AssignedVars[] [2021-05-03 00:26:31,191 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:26:31,228 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:31,231 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:31,252 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:26:31,259 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:26:31,294 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:26:31,352 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3396 v_~last~0_609) (< (+ v_main_~c~0_3396 1) v_~SIZE~0_604)) InVars {~SIZE~0=v_~SIZE~0_604, main_~c~0=v_main_~c~0_3396, ~last~0=v_~last~0_609} OutVars{~SIZE~0=v_~SIZE~0_604, main_~c~0=v_main_~c~0_3396, ~last~0=v_~last~0_609} AuxVars[] AssignedVars[] [2021-05-03 00:26:31,354 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:31,355 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:31,358 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:31,394 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:26:31,407 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:26:31,471 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:31,531 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:26:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:31,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:26:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:31,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:26:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:31,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:26:31,868 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:26:32,000 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2021-05-03 00:26:33,479 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2021-05-03 00:26:36,045 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:26:36,045 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1987756315] [2021-05-03 00:26:36,045 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1987756315] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:26:36,045 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:26:36,045 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2021-05-03 00:26:36,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667551739] [2021-05-03 00:26:36,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-03 00:26:36,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:26:36,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-03 00:26:36,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1861, Unknown=0, NotChecked=0, Total=2070 [2021-05-03 00:26:36,046 INFO L87 Difference]: Start difference. First operand 269 states and 306 transitions. Second operand has 45 states, 45 states have (on average 1.488888888888889) internal successors, (67), 43 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:40,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:26:40,713 INFO L93 Difference]: Finished difference Result 541 states and 604 transitions. [2021-05-03 00:26:40,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-03 00:26:40,715 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.488888888888889) internal successors, (67), 43 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:26:40,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:26:40,715 INFO L225 Difference]: With dead ends: 541 [2021-05-03 00:26:40,715 INFO L226 Difference]: Without dead ends: 334 [2021-05-03 00:26:40,717 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 6 SyntacticMatches, 18 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 4320.0ms TimeCoverageRelationStatistics Valid=219, Invalid=2037, Unknown=0, NotChecked=0, Total=2256 [2021-05-03 00:26:40,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-05-03 00:26:41,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 269. [2021-05-03 00:26:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 259 states have (on average 1.138996138996139) internal successors, (295), 259 states have internal predecessors, (295), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:26:41,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 306 transitions. [2021-05-03 00:26:41,215 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 306 transitions. Word has length 73 [2021-05-03 00:26:41,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:26:41,215 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 306 transitions. [2021-05-03 00:26:41,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 45 states, 45 states have (on average 1.488888888888889) internal successors, (67), 43 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:41,215 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 306 transitions. [2021-05-03 00:26:41,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:26:41,216 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:26:41,216 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 16, 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-03 00:26:41,216 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable766 [2021-05-03 00:26:41,216 INFO L428 AbstractCegarLoop]: === Iteration 175 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:26:41,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:26:41,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1236653597, now seen corresponding path program 136 times [2021-05-03 00:26:41,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:26:41,216 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1559645283] [2021-05-03 00:26:41,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:26:41,223 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_610 v_main_~c~0_3417) (< v_main_~c~0_3417 v_~SIZE~0_605)) InVars {~SIZE~0=v_~SIZE~0_605, main_~c~0=v_main_~c~0_3417, ~last~0=v_~last~0_610} OutVars{~SIZE~0=v_~SIZE~0_605, main_~c~0=v_main_~c~0_3417, ~last~0=v_~last~0_610} AuxVars[] AssignedVars[] [2021-05-03 00:26:41,225 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:41,248 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:41,250 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:41,264 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:41,269 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:41,294 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:41,326 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3419 v_~last~0_611) (< v_main_~c~0_3419 v_~SIZE~0_606)) InVars {~SIZE~0=v_~SIZE~0_606, main_~c~0=v_main_~c~0_3419, ~last~0=v_~last~0_611} OutVars{~SIZE~0=v_~SIZE~0_606, main_~c~0=v_main_~c~0_3419, ~last~0=v_~last~0_611} AuxVars[] AssignedVars[] [2021-05-03 00:26:41,327 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:26:41,328 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:41,330 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:41,347 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:41,354 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:41,387 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:26:41,416 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:26:41,418 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3421 v_~last~0_612) (< (+ v_main_~c~0_3421 1) v_~SIZE~0_607)) InVars {~SIZE~0=v_~SIZE~0_607, main_~c~0=v_main_~c~0_3421, ~last~0=v_~last~0_612} OutVars{~SIZE~0=v_~SIZE~0_607, main_~c~0=v_main_~c~0_3421, ~last~0=v_~last~0_612} AuxVars[] AssignedVars[] [2021-05-03 00:26:41,419 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:41,420 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:41,424 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:41,442 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:26:41,449 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:26:41,482 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:41,514 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:26:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:41,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:26:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:41,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:26:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:26:41,721 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:26:46,745 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:26:46,745 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1559645283] [2021-05-03 00:26:46,746 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1559645283] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:26:46,746 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:26:46,746 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-05-03 00:26:46,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173893155] [2021-05-03 00:26:46,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-05-03 00:26:46,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:26:46,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-05-03 00:26:46,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1946, Unknown=0, NotChecked=0, Total=2162 [2021-05-03 00:26:46,747 INFO L87 Difference]: Start difference. First operand 269 states and 306 transitions. Second operand has 46 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 44 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:52,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:26:52,623 INFO L93 Difference]: Finished difference Result 540 states and 604 transitions. [2021-05-03 00:26:52,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-03 00:26:52,625 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 44 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:26:52,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:26:52,626 INFO L225 Difference]: With dead ends: 540 [2021-05-03 00:26:52,626 INFO L226 Difference]: Without dead ends: 333 [2021-05-03 00:26:52,626 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 6 SyntacticMatches, 17 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 5121.8ms TimeCoverageRelationStatistics Valid=226, Invalid=2126, Unknown=0, NotChecked=0, Total=2352 [2021-05-03 00:26:52,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-05-03 00:26:53,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 270. [2021-05-03 00:26:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 260 states have (on average 1.1423076923076922) internal successors, (297), 260 states have internal predecessors, (297), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:26:53,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 308 transitions. [2021-05-03 00:26:53,138 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 308 transitions. Word has length 73 [2021-05-03 00:26:53,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:26:53,138 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 308 transitions. [2021-05-03 00:26:53,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 44 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:26:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 308 transitions. [2021-05-03 00:26:53,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:26:53,138 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:26:53,138 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:26:53,138 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable770 [2021-05-03 00:26:53,138 INFO L428 AbstractCegarLoop]: === Iteration 176 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:26:53,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:26:53,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1071113247, now seen corresponding path program 17 times [2021-05-03 00:26:53,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:26:53,139 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1036333871] [2021-05-03 00:26:53,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:26:53,144 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3442 v_~SIZE~0_608) (< v_main_~c~0_3442 v_~last~0_613)) InVars {~SIZE~0=v_~SIZE~0_608, main_~c~0=v_main_~c~0_3442, ~last~0=v_~last~0_613} OutVars{~SIZE~0=v_~SIZE~0_608, main_~c~0=v_main_~c~0_3442, ~last~0=v_~last~0_613} AuxVars[] AssignedVars[] [2021-05-03 00:26:53,146 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:26:53,163 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:53,165 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:53,184 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:26:53,190 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:26:53,211 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:26:53,244 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:26:53,245 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3444 1) v_~SIZE~0_609) (< v_main_~c~0_3444 v_~last~0_614)) InVars {~SIZE~0=v_~SIZE~0_609, main_~c~0=v_main_~c~0_3444, ~last~0=v_~last~0_614} OutVars{~SIZE~0=v_~SIZE~0_609, main_~c~0=v_main_~c~0_3444, ~last~0=v_~last~0_614} AuxVars[] AssignedVars[] [2021-05-03 00:26:53,247 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:26:53,248 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:53,249 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:26:53,271 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:26:53,278 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:26:53,316 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:26:53,349 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:26:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:53,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:26:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:53,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:26:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:26:53,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:26:58,157 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:26:58,158 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1036333871] [2021-05-03 00:26:58,158 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1036333871] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:26:58,158 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:26:58,158 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-05-03 00:26:58,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592511665] [2021-05-03 00:26:58,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-05-03 00:26:58,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:26:58,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-05-03 00:26:58,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2026, Unknown=0, NotChecked=0, Total=2256 [2021-05-03 00:26:58,159 INFO L87 Difference]: Start difference. First operand 270 states and 308 transitions. Second operand has 46 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 44 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:06,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:27:06,387 INFO L93 Difference]: Finished difference Result 556 states and 621 transitions. [2021-05-03 00:27:06,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-05-03 00:27:06,390 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 44 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2021-05-03 00:27:06,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:27:06,390 INFO L225 Difference]: With dead ends: 556 [2021-05-03 00:27:06,390 INFO L226 Difference]: Without dead ends: 349 [2021-05-03 00:27:06,391 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 6 SyntacticMatches, 16 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1301 ImplicationChecksByTransitivity, 6211.5ms TimeCoverageRelationStatistics Valid=376, Invalid=4046, Unknown=0, NotChecked=0, Total=4422 [2021-05-03 00:27:06,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-05-03 00:27:07,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 272. [2021-05-03 00:27:07,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 262 states have (on average 1.1412213740458015) internal successors, (299), 262 states have internal predecessors, (299), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:27:07,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 310 transitions. [2021-05-03 00:27:07,054 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 310 transitions. Word has length 73 [2021-05-03 00:27:07,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:27:07,054 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 310 transitions. [2021-05-03 00:27:07,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 44 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:07,054 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 310 transitions. [2021-05-03 00:27:07,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:27:07,054 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:27:07,054 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:27:07,054 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable773 [2021-05-03 00:27:07,055 INFO L428 AbstractCegarLoop]: === Iteration 177 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:27:07,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:27:07,055 INFO L82 PathProgramCache]: Analyzing trace with hash 503209918, now seen corresponding path program 18 times [2021-05-03 00:27:07,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:27:07,055 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1498190045] [2021-05-03 00:27:07,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:27:07,066 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3464 v_~SIZE~0_610) (<= v_~last~0_615 v_main_~c~0_3464)) InVars {~SIZE~0=v_~SIZE~0_610, main_~c~0=v_main_~c~0_3464, ~last~0=v_~last~0_615} OutVars{~SIZE~0=v_~SIZE~0_610, main_~c~0=v_main_~c~0_3464, ~last~0=v_~last~0_615} AuxVars[] AssignedVars[] [2021-05-03 00:27:07,069 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:07,071 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:07,074 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:07,104 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:07,113 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:07,194 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:07,271 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:27:07,276 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_616 v_main_~c~0_3466) (< (+ v_main_~c~0_3466 1) v_~SIZE~0_611)) InVars {~SIZE~0=v_~SIZE~0_611, main_~c~0=v_main_~c~0_3466, ~last~0=v_~last~0_616} OutVars{~SIZE~0=v_~SIZE~0_611, main_~c~0=v_main_~c~0_3466, ~last~0=v_~last~0_616} AuxVars[] AssignedVars[] [2021-05-03 00:27:07,280 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:27:07,281 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:07,285 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:07,314 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:07,322 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:07,409 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:27:07,484 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:27:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:07,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:27:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:07,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:27:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:27:09,512 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:27:09,512 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1498190045] [2021-05-03 00:27:09,512 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1498190045] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:27:09,512 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:27:09,512 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:27:09,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323866368] [2021-05-03 00:27:09,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:27:09,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:27:09,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:27:09,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:27:09,513 INFO L87 Difference]: Start difference. First operand 272 states and 310 transitions. Second operand has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 25 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:27:12,336 INFO L93 Difference]: Finished difference Result 544 states and 606 transitions. [2021-05-03 00:27:12,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:27:12,340 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 25 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:27:12,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:27:12,340 INFO L225 Difference]: With dead ends: 544 [2021-05-03 00:27:12,340 INFO L226 Difference]: Without dead ends: 337 [2021-05-03 00:27:12,341 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 14 SyntacticMatches, 33 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1857.3ms TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:27:12,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-05-03 00:27:13,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 281. [2021-05-03 00:27:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 271 states have (on average 1.136531365313653) internal successors, (308), 271 states have internal predecessors, (308), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:27:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 319 transitions. [2021-05-03 00:27:13,141 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 319 transitions. Word has length 76 [2021-05-03 00:27:13,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:27:13,141 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 319 transitions. [2021-05-03 00:27:13,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 25 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:13,141 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 319 transitions. [2021-05-03 00:27:13,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:27:13,141 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:27:13,141 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 17, 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-03 00:27:13,141 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable776 [2021-05-03 00:27:13,142 INFO L428 AbstractCegarLoop]: === Iteration 178 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:27:13,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:27:13,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1182482172, now seen corresponding path program 137 times [2021-05-03 00:27:13,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:27:13,142 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1910097176] [2021-05-03 00:27:13,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:27:13,156 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3487 v_~SIZE~0_612) (<= v_~last~0_617 v_main_~c~0_3487)) InVars {~SIZE~0=v_~SIZE~0_612, main_~c~0=v_main_~c~0_3487, ~last~0=v_~last~0_617} OutVars{~SIZE~0=v_~SIZE~0_612, main_~c~0=v_main_~c~0_3487, ~last~0=v_~last~0_617} AuxVars[] AssignedVars[] [2021-05-03 00:27:13,159 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:13,198 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:13,202 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:13,227 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:13,234 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:13,275 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:13,349 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3489 v_~SIZE~0_613) (< v_main_~c~0_3489 v_~last~0_618)) InVars {~SIZE~0=v_~SIZE~0_613, main_~c~0=v_main_~c~0_3489, ~last~0=v_~last~0_618} OutVars{~SIZE~0=v_~SIZE~0_613, main_~c~0=v_main_~c~0_3489, ~last~0=v_~last~0_618} AuxVars[] AssignedVars[] [2021-05-03 00:27:13,351 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:27:13,384 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:13,387 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:13,426 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:13,441 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:13,483 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:27:13,547 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:27:13,551 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3491 1) v_~SIZE~0_614) (<= v_~last~0_619 v_main_~c~0_3491)) InVars {~SIZE~0=v_~SIZE~0_614, main_~c~0=v_main_~c~0_3491, ~last~0=v_~last~0_619} OutVars{~SIZE~0=v_~SIZE~0_614, main_~c~0=v_main_~c~0_3491, ~last~0=v_~last~0_619} AuxVars[] AssignedVars[] [2021-05-03 00:27:13,554 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:27:13,593 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:13,596 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:13,621 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:13,629 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:13,677 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:27:13,744 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3493 1) v_~SIZE~0_615) (< v_main_~c~0_3493 v_~last~0_620)) InVars {~SIZE~0=v_~SIZE~0_615, main_~c~0=v_main_~c~0_3493, ~last~0=v_~last~0_620} OutVars{~SIZE~0=v_~SIZE~0_615, main_~c~0=v_main_~c~0_3493, ~last~0=v_~last~0_620} AuxVars[] AssignedVars[] [2021-05-03 00:27:13,751 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:13,782 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:13,785 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:13,822 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:13,836 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:13,877 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:13,940 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:27:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:14,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:27:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:14,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:27:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:27:14,352 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:27:14,505 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2021-05-03 00:27:16,971 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:27:16,971 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1910097176] [2021-05-03 00:27:16,971 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1910097176] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:27:16,971 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:27:16,971 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:27:16,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5744914] [2021-05-03 00:27:16,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:27:16,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:27:16,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:27:16,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:27:16,972 INFO L87 Difference]: Start difference. First operand 281 states and 319 transitions. Second operand has 32 states, 32 states have (on average 2.1875) internal successors, (70), 30 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:27:20,582 INFO L93 Difference]: Finished difference Result 610 states and 674 transitions. [2021-05-03 00:27:20,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:27:20,584 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 30 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:27:20,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:27:20,585 INFO L225 Difference]: With dead ends: 610 [2021-05-03 00:27:20,585 INFO L226 Difference]: Without dead ends: 394 [2021-05-03 00:27:20,585 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 7 SyntacticMatches, 33 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 2833.7ms TimeCoverageRelationStatistics Valid=125, Invalid=1065, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:27:20,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-05-03 00:27:21,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 281. [2021-05-03 00:27:21,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 271 states have (on average 1.136531365313653) internal successors, (308), 271 states have internal predecessors, (308), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:27:21,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 319 transitions. [2021-05-03 00:27:21,241 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 319 transitions. Word has length 76 [2021-05-03 00:27:21,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:27:21,241 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 319 transitions. [2021-05-03 00:27:21,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 30 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:21,241 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 319 transitions. [2021-05-03 00:27:21,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:27:21,241 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:27:21,242 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:27:21,242 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable781 [2021-05-03 00:27:21,242 INFO L428 AbstractCegarLoop]: === Iteration 179 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:27:21,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:27:21,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1743181950, now seen corresponding path program 138 times [2021-05-03 00:27:21,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:27:21,242 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1990038567] [2021-05-03 00:27:21,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:27:21,272 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_621 v_main_~c~0_3515) (< v_main_~c~0_3515 v_~SIZE~0_616)) InVars {~SIZE~0=v_~SIZE~0_616, main_~c~0=v_main_~c~0_3515, ~last~0=v_~last~0_621} OutVars{~SIZE~0=v_~SIZE~0_616, main_~c~0=v_main_~c~0_3515, ~last~0=v_~last~0_621} AuxVars[] AssignedVars[] [2021-05-03 00:27:21,275 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:21,324 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:21,328 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:21,361 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:21,370 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:21,425 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:21,507 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3517 v_~SIZE~0_617) (< v_main_~c~0_3517 v_~last~0_622)) InVars {~SIZE~0=v_~SIZE~0_617, main_~c~0=v_main_~c~0_3517, ~last~0=v_~last~0_622} OutVars{~SIZE~0=v_~SIZE~0_617, main_~c~0=v_main_~c~0_3517, ~last~0=v_~last~0_622} AuxVars[] AssignedVars[] [2021-05-03 00:27:21,509 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:27:21,511 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:21,515 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:21,558 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:21,574 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:21,655 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:27:21,735 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:27:21,740 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3519 1) v_~SIZE~0_618) (<= v_~last~0_623 v_main_~c~0_3519)) InVars {~SIZE~0=v_~SIZE~0_618, main_~c~0=v_main_~c~0_3519, ~last~0=v_~last~0_623} OutVars{~SIZE~0=v_~SIZE~0_618, main_~c~0=v_main_~c~0_3519, ~last~0=v_~last~0_623} AuxVars[] AssignedVars[] [2021-05-03 00:27:21,743 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:27:21,793 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:21,796 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:21,825 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:21,833 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:21,882 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:27:21,950 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3521 1) v_~SIZE~0_619) (< v_main_~c~0_3521 v_~last~0_624)) InVars {~SIZE~0=v_~SIZE~0_619, main_~c~0=v_main_~c~0_3521, ~last~0=v_~last~0_624} OutVars{~SIZE~0=v_~SIZE~0_619, main_~c~0=v_main_~c~0_3521, ~last~0=v_~last~0_624} AuxVars[] AssignedVars[] [2021-05-03 00:27:21,953 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:21,955 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:21,958 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:21,996 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:22,010 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:22,081 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:22,151 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:27:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:22,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:27:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:22,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:27:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:22,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:27:22,583 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:27:22,740 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2021-05-03 00:27:27,103 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:27:27,103 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1990038567] [2021-05-03 00:27:27,103 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1990038567] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:27:27,103 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:27:27,104 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:27:27,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834966917] [2021-05-03 00:27:27,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:27:27,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:27:27,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:27:27,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:27:27,104 INFO L87 Difference]: Start difference. First operand 281 states and 319 transitions. Second operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 31 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:31,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:27:31,387 INFO L93 Difference]: Finished difference Result 607 states and 671 transitions. [2021-05-03 00:27:31,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:27:31,389 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 31 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:27:31,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:27:31,390 INFO L225 Difference]: With dead ends: 607 [2021-05-03 00:27:31,390 INFO L226 Difference]: Without dead ends: 391 [2021-05-03 00:27:31,390 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 6 SyntacticMatches, 33 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 4707.6ms TimeCoverageRelationStatistics Valid=132, Invalid=1128, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:27:31,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-05-03 00:27:32,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 281. [2021-05-03 00:27:32,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 271 states have (on average 1.136531365313653) internal successors, (308), 271 states have internal predecessors, (308), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:27:32,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 319 transitions. [2021-05-03 00:27:32,064 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 319 transitions. Word has length 76 [2021-05-03 00:27:32,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:27:32,064 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 319 transitions. [2021-05-03 00:27:32,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 31 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:32,065 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 319 transitions. [2021-05-03 00:27:32,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:27:32,065 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:27:32,065 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:27:32,065 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable786 [2021-05-03 00:27:32,065 INFO L428 AbstractCegarLoop]: === Iteration 180 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:27:32,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:27:32,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1783856700, now seen corresponding path program 139 times [2021-05-03 00:27:32,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:27:32,065 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1322289764] [2021-05-03 00:27:32,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:27:32,080 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_625 v_main_~c~0_3543) (< v_main_~c~0_3543 v_~SIZE~0_620)) InVars {~SIZE~0=v_~SIZE~0_620, main_~c~0=v_main_~c~0_3543, ~last~0=v_~last~0_625} OutVars{~SIZE~0=v_~SIZE~0_620, main_~c~0=v_main_~c~0_3543, ~last~0=v_~last~0_625} AuxVars[] AssignedVars[] [2021-05-03 00:27:32,082 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:32,127 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:32,131 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:32,164 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:32,173 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:32,221 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:32,313 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3545 v_~SIZE~0_621) (< v_main_~c~0_3545 v_~last~0_626)) InVars {~SIZE~0=v_~SIZE~0_621, main_~c~0=v_main_~c~0_3545, ~last~0=v_~last~0_626} OutVars{~SIZE~0=v_~SIZE~0_621, main_~c~0=v_main_~c~0_3545, ~last~0=v_~last~0_626} AuxVars[] AssignedVars[] [2021-05-03 00:27:32,315 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:27:32,351 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:32,354 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:32,391 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:32,407 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:32,452 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:27:32,534 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:27:32,539 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3547 1) v_~SIZE~0_622) (<= v_~last~0_627 v_main_~c~0_3547)) InVars {~SIZE~0=v_~SIZE~0_622, main_~c~0=v_main_~c~0_3547, ~last~0=v_~last~0_627} OutVars{~SIZE~0=v_~SIZE~0_622, main_~c~0=v_main_~c~0_3547, ~last~0=v_~last~0_627} AuxVars[] AssignedVars[] [2021-05-03 00:27:32,542 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:27:32,593 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:32,597 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:32,630 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:32,639 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:32,693 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:27:32,780 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3549 v_~last~0_628) (< (+ v_main_~c~0_3549 1) v_~SIZE~0_623)) InVars {~SIZE~0=v_~SIZE~0_623, main_~c~0=v_main_~c~0_3549, ~last~0=v_~last~0_628} OutVars{~SIZE~0=v_~SIZE~0_623, main_~c~0=v_main_~c~0_3549, ~last~0=v_~last~0_628} AuxVars[] AssignedVars[] [2021-05-03 00:27:32,782 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:32,820 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:32,824 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:32,868 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:32,884 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:32,932 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:33,018 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:27:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:33,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:27:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:33,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:27:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:27:33,500 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:27:33,674 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2021-05-03 00:27:38,623 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:27:38,624 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1322289764] [2021-05-03 00:27:38,624 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1322289764] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:27:38,624 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:27:38,624 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-03 00:27:38,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469840997] [2021-05-03 00:27:38,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-03 00:27:38,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:27:38,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-03 00:27:38,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1061, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:27:38,625 INFO L87 Difference]: Start difference. First operand 281 states and 319 transitions. Second operand has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 32 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:43,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:27:43,067 INFO L93 Difference]: Finished difference Result 604 states and 668 transitions. [2021-05-03 00:27:43,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:27:43,069 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 32 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:27:43,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:27:43,069 INFO L225 Difference]: With dead ends: 604 [2021-05-03 00:27:43,069 INFO L226 Difference]: Without dead ends: 388 [2021-05-03 00:27:43,070 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 6 SyntacticMatches, 32 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 5351.7ms TimeCoverageRelationStatistics Valid=139, Invalid=1193, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:27:43,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-05-03 00:27:43,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 281. [2021-05-03 00:27:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 271 states have (on average 1.136531365313653) internal successors, (308), 271 states have internal predecessors, (308), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:27:43,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 319 transitions. [2021-05-03 00:27:43,665 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 319 transitions. Word has length 76 [2021-05-03 00:27:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:27:43,665 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 319 transitions. [2021-05-03 00:27:43,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 32 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 319 transitions. [2021-05-03 00:27:43,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:27:43,665 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:27:43,665 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:27:43,665 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable791 [2021-05-03 00:27:43,665 INFO L428 AbstractCegarLoop]: === Iteration 181 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:27:43,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:27:43,666 INFO L82 PathProgramCache]: Analyzing trace with hash -2067209922, now seen corresponding path program 140 times [2021-05-03 00:27:43,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:27:43,666 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [208260614] [2021-05-03 00:27:43,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:27:43,675 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3571 v_~SIZE~0_624) (<= v_~last~0_629 v_main_~c~0_3571)) InVars {~SIZE~0=v_~SIZE~0_624, main_~c~0=v_main_~c~0_3571, ~last~0=v_~last~0_629} OutVars{~SIZE~0=v_~SIZE~0_624, main_~c~0=v_main_~c~0_3571, ~last~0=v_~last~0_629} AuxVars[] AssignedVars[] [2021-05-03 00:27:43,677 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:43,678 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:43,680 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:43,696 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:43,700 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:43,745 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:43,782 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3573 v_~SIZE~0_625) (< v_main_~c~0_3573 v_~last~0_630)) InVars {~SIZE~0=v_~SIZE~0_625, main_~c~0=v_main_~c~0_3573, ~last~0=v_~last~0_630} OutVars{~SIZE~0=v_~SIZE~0_625, main_~c~0=v_main_~c~0_3573, ~last~0=v_~last~0_630} AuxVars[] AssignedVars[] [2021-05-03 00:27:43,784 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:27:43,804 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:43,806 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:43,826 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:43,834 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:43,858 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:27:43,893 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:27:43,895 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3575 1) v_~SIZE~0_626) (<= v_~last~0_631 v_main_~c~0_3575)) InVars {~SIZE~0=v_~SIZE~0_626, main_~c~0=v_main_~c~0_3575, ~last~0=v_~last~0_631} OutVars{~SIZE~0=v_~SIZE~0_626, main_~c~0=v_main_~c~0_3575, ~last~0=v_~last~0_631} AuxVars[] AssignedVars[] [2021-05-03 00:27:43,897 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:27:43,922 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:43,924 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:43,939 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:43,943 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:43,969 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:27:44,050 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3577 1) v_~SIZE~0_627) (< v_main_~c~0_3577 v_~last~0_632)) InVars {~SIZE~0=v_~SIZE~0_627, main_~c~0=v_main_~c~0_3577, ~last~0=v_~last~0_632} OutVars{~SIZE~0=v_~SIZE~0_627, main_~c~0=v_main_~c~0_3577, ~last~0=v_~last~0_632} AuxVars[] AssignedVars[] [2021-05-03 00:27:44,052 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:44,090 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:44,093 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:44,135 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:44,152 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:44,213 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:44,292 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:27:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:44,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:27:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:44,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:27:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:44,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:27:44,779 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:27:44,958 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2021-05-03 00:27:50,488 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:27:50,489 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [208260614] [2021-05-03 00:27:50,489 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [208260614] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:27:50,489 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:27:50,489 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-03 00:27:50,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434792055] [2021-05-03 00:27:50,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-03 00:27:50,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:27:50,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-03 00:27:50,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1124, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:27:50,490 INFO L87 Difference]: Start difference. First operand 281 states and 319 transitions. Second operand has 35 states, 35 states have (on average 2.0) internal successors, (70), 33 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:56,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:27:56,732 INFO L93 Difference]: Finished difference Result 601 states and 665 transitions. [2021-05-03 00:27:56,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:27:56,734 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.0) internal successors, (70), 33 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:27:56,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:27:56,735 INFO L225 Difference]: With dead ends: 601 [2021-05-03 00:27:56,735 INFO L226 Difference]: Without dead ends: 385 [2021-05-03 00:27:56,735 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 6 SyntacticMatches, 31 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 5944.8ms TimeCoverageRelationStatistics Valid=146, Invalid=1260, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:27:56,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-05-03 00:27:57,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 281. [2021-05-03 00:27:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 271 states have (on average 1.136531365313653) internal successors, (308), 271 states have internal predecessors, (308), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:27:57,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 319 transitions. [2021-05-03 00:27:57,318 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 319 transitions. Word has length 76 [2021-05-03 00:27:57,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:27:57,318 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 319 transitions. [2021-05-03 00:27:57,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 2.0) internal successors, (70), 33 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:27:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 319 transitions. [2021-05-03 00:27:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:27:57,318 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:27:57,318 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:27:57,319 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable796 [2021-05-03 00:27:57,319 INFO L428 AbstractCegarLoop]: === Iteration 182 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:27:57,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:27:57,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1746677116, now seen corresponding path program 141 times [2021-05-03 00:27:57,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:27:57,319 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [829290216] [2021-05-03 00:27:57,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:27:57,329 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3599 v_~SIZE~0_628) (<= v_~last~0_633 v_main_~c~0_3599)) InVars {~SIZE~0=v_~SIZE~0_628, main_~c~0=v_main_~c~0_3599, ~last~0=v_~last~0_633} OutVars{~SIZE~0=v_~SIZE~0_628, main_~c~0=v_main_~c~0_3599, ~last~0=v_~last~0_633} AuxVars[] AssignedVars[] [2021-05-03 00:27:57,331 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:57,333 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:57,335 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:57,355 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:57,360 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:57,407 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:57,447 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3601 v_~last~0_634) (< v_main_~c~0_3601 v_~SIZE~0_629)) InVars {~SIZE~0=v_~SIZE~0_629, main_~c~0=v_main_~c~0_3601, ~last~0=v_~last~0_634} OutVars{~SIZE~0=v_~SIZE~0_629, main_~c~0=v_main_~c~0_3601, ~last~0=v_~last~0_634} AuxVars[] AssignedVars[] [2021-05-03 00:27:57,449 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:27:57,470 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:57,472 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:57,493 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:27:57,502 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:27:57,526 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:27:57,566 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:27:57,569 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3603 1) v_~SIZE~0_630) (<= v_~last~0_635 v_main_~c~0_3603)) InVars {~SIZE~0=v_~SIZE~0_630, main_~c~0=v_main_~c~0_3603, ~last~0=v_~last~0_635} OutVars{~SIZE~0=v_~SIZE~0_630, main_~c~0=v_main_~c~0_3603, ~last~0=v_~last~0_635} AuxVars[] AssignedVars[] [2021-05-03 00:27:57,571 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:27:57,596 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:57,598 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:57,614 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:57,618 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:57,646 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:27:57,685 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3605 1) v_~SIZE~0_631) (< v_main_~c~0_3605 v_~last~0_636)) InVars {~SIZE~0=v_~SIZE~0_631, main_~c~0=v_main_~c~0_3605, ~last~0=v_~last~0_636} OutVars{~SIZE~0=v_~SIZE~0_631, main_~c~0=v_main_~c~0_3605, ~last~0=v_~last~0_636} AuxVars[] AssignedVars[] [2021-05-03 00:27:57,687 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:27:57,688 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:57,690 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:27:57,713 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:27:57,722 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:27:57,763 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:27:57,803 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:27:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:58,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:27:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:58,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:27:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:27:58,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:27:58,054 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:28:00,908 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:28:00,909 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [829290216] [2021-05-03 00:28:00,909 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [829290216] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:28:00,909 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:28:00,909 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-03 00:28:00,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622983049] [2021-05-03 00:28:00,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-03 00:28:00,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:28:00,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-03 00:28:00,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1189, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:28:00,910 INFO L87 Difference]: Start difference. First operand 281 states and 319 transitions. Second operand has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 34 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:04,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:28:04,649 INFO L93 Difference]: Finished difference Result 598 states and 662 transitions. [2021-05-03 00:28:04,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:28:04,652 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 34 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:28:04,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:28:04,653 INFO L225 Difference]: With dead ends: 598 [2021-05-03 00:28:04,653 INFO L226 Difference]: Without dead ends: 382 [2021-05-03 00:28:04,653 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 6 SyntacticMatches, 30 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 2989.9ms TimeCoverageRelationStatistics Valid=153, Invalid=1329, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:28:04,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-05-03 00:28:05,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 281. [2021-05-03 00:28:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 271 states have (on average 1.136531365313653) internal successors, (308), 271 states have internal predecessors, (308), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:28:05,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 319 transitions. [2021-05-03 00:28:05,260 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 319 transitions. Word has length 76 [2021-05-03 00:28:05,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:28:05,260 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 319 transitions. [2021-05-03 00:28:05,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 34 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:05,260 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 319 transitions. [2021-05-03 00:28:05,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:28:05,260 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:28:05,260 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:28:05,261 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable801 [2021-05-03 00:28:05,261 INFO L428 AbstractCegarLoop]: === Iteration 183 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:28:05,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:28:05,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1393588734, now seen corresponding path program 142 times [2021-05-03 00:28:05,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:28:05,261 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1360682387] [2021-05-03 00:28:05,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:28:05,271 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3627 v_~SIZE~0_632) (<= v_~last~0_637 v_main_~c~0_3627)) InVars {~SIZE~0=v_~SIZE~0_632, main_~c~0=v_main_~c~0_3627, ~last~0=v_~last~0_637} OutVars{~SIZE~0=v_~SIZE~0_632, main_~c~0=v_main_~c~0_3627, ~last~0=v_~last~0_637} AuxVars[] AssignedVars[] [2021-05-03 00:28:05,274 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:05,275 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:05,278 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:05,296 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:05,301 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:05,350 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:05,389 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3629 v_~SIZE~0_633) (< v_main_~c~0_3629 v_~last~0_638)) InVars {~SIZE~0=v_~SIZE~0_633, main_~c~0=v_main_~c~0_3629, ~last~0=v_~last~0_638} OutVars{~SIZE~0=v_~SIZE~0_633, main_~c~0=v_main_~c~0_3629, ~last~0=v_~last~0_638} AuxVars[] AssignedVars[] [2021-05-03 00:28:05,391 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:28:05,392 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:05,394 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:05,417 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:05,424 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:05,466 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:28:05,504 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:05,507 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3631 1) v_~SIZE~0_634) (<= v_~last~0_639 v_main_~c~0_3631)) InVars {~SIZE~0=v_~SIZE~0_634, main_~c~0=v_main_~c~0_3631, ~last~0=v_~last~0_639} OutVars{~SIZE~0=v_~SIZE~0_634, main_~c~0=v_main_~c~0_3631, ~last~0=v_~last~0_639} AuxVars[] AssignedVars[] [2021-05-03 00:28:05,510 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:28:05,540 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:05,542 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:05,562 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:05,566 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:05,595 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:28:05,634 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3633 1) v_~SIZE~0_635) (< v_main_~c~0_3633 v_~last~0_640)) InVars {~SIZE~0=v_~SIZE~0_635, main_~c~0=v_main_~c~0_3633, ~last~0=v_~last~0_640} OutVars{~SIZE~0=v_~SIZE~0_635, main_~c~0=v_main_~c~0_3633, ~last~0=v_~last~0_640} AuxVars[] AssignedVars[] [2021-05-03 00:28:05,636 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:05,658 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:05,660 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:05,682 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:05,690 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:05,713 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:05,748 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:05,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:28:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:05,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:28:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:28:05,988 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:28:09,194 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:28:09,194 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1360682387] [2021-05-03 00:28:09,194 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1360682387] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:28:09,194 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:28:09,195 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-03 00:28:09,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686019571] [2021-05-03 00:28:09,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-03 00:28:09,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:28:09,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-03 00:28:09,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1256, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:28:09,195 INFO L87 Difference]: Start difference. First operand 281 states and 319 transitions. Second operand has 37 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 35 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:28:12,880 INFO L93 Difference]: Finished difference Result 595 states and 659 transitions. [2021-05-03 00:28:12,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-03 00:28:12,882 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 35 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:28:12,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:28:12,883 INFO L225 Difference]: With dead ends: 595 [2021-05-03 00:28:12,883 INFO L226 Difference]: Without dead ends: 379 [2021-05-03 00:28:12,884 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 12 SyntacticMatches, 23 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 3330.9ms TimeCoverageRelationStatistics Valid=160, Invalid=1400, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:28:12,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-05-03 00:28:13,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 281. [2021-05-03 00:28:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 271 states have (on average 1.136531365313653) internal successors, (308), 271 states have internal predecessors, (308), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:28:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 319 transitions. [2021-05-03 00:28:13,580 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 319 transitions. Word has length 76 [2021-05-03 00:28:13,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:28:13,580 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 319 transitions. [2021-05-03 00:28:13,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 35 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:13,581 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 319 transitions. [2021-05-03 00:28:13,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:28:13,581 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:28:13,581 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:28:13,581 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable806 [2021-05-03 00:28:13,581 INFO L428 AbstractCegarLoop]: === Iteration 184 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:28:13,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:28:13,581 INFO L82 PathProgramCache]: Analyzing trace with hash -655799108, now seen corresponding path program 143 times [2021-05-03 00:28:13,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:28:13,581 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1492393071] [2021-05-03 00:28:13,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:28:13,590 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3655 v_~SIZE~0_636) (<= v_~last~0_641 v_main_~c~0_3655)) InVars {~SIZE~0=v_~SIZE~0_636, main_~c~0=v_main_~c~0_3655, ~last~0=v_~last~0_641} OutVars{~SIZE~0=v_~SIZE~0_636, main_~c~0=v_main_~c~0_3655, ~last~0=v_~last~0_641} AuxVars[] AssignedVars[] [2021-05-03 00:28:13,592 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:13,615 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:13,617 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:13,632 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:13,636 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:13,664 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:13,702 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3657 v_~SIZE~0_637) (< v_main_~c~0_3657 v_~last~0_642)) InVars {~SIZE~0=v_~SIZE~0_637, main_~c~0=v_main_~c~0_3657, ~last~0=v_~last~0_642} OutVars{~SIZE~0=v_~SIZE~0_637, main_~c~0=v_main_~c~0_3657, ~last~0=v_~last~0_642} AuxVars[] AssignedVars[] [2021-05-03 00:28:13,703 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:28:13,704 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:13,706 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:13,725 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:13,733 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:13,770 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:28:13,803 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:13,805 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3659 1) v_~SIZE~0_638) (<= v_~last~0_643 v_main_~c~0_3659)) InVars {~SIZE~0=v_~SIZE~0_638, main_~c~0=v_main_~c~0_3659, ~last~0=v_~last~0_643} OutVars{~SIZE~0=v_~SIZE~0_638, main_~c~0=v_main_~c~0_3659, ~last~0=v_~last~0_643} AuxVars[] AssignedVars[] [2021-05-03 00:28:13,807 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:28:13,837 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:13,839 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:13,854 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:13,859 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:13,881 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:28:13,915 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3661 v_~last~0_644) (< (+ v_main_~c~0_3661 1) v_~SIZE~0_639)) InVars {~SIZE~0=v_~SIZE~0_639, main_~c~0=v_main_~c~0_3661, ~last~0=v_~last~0_644} OutVars{~SIZE~0=v_~SIZE~0_639, main_~c~0=v_main_~c~0_3661, ~last~0=v_~last~0_644} AuxVars[] AssignedVars[] [2021-05-03 00:28:13,917 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:13,935 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:13,937 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:13,956 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:13,963 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:13,987 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:14,020 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:14,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:28:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:14,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:28:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:14,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:28:14,323 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:28:14,434 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2021-05-03 00:28:17,280 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:28:17,281 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1492393071] [2021-05-03 00:28:17,281 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1492393071] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:28:17,281 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:28:17,281 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-03 00:28:17,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283650554] [2021-05-03 00:28:17,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-03 00:28:17,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:28:17,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-03 00:28:17,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1325, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:28:17,282 INFO L87 Difference]: Start difference. First operand 281 states and 319 transitions. Second operand has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 36 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:21,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:28:21,398 INFO L93 Difference]: Finished difference Result 592 states and 656 transitions. [2021-05-03 00:28:21,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-03 00:28:21,400 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 36 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:28:21,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:28:21,401 INFO L225 Difference]: With dead ends: 592 [2021-05-03 00:28:21,401 INFO L226 Difference]: Without dead ends: 376 [2021-05-03 00:28:21,402 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 7 SyntacticMatches, 27 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 3118.6ms TimeCoverageRelationStatistics Valid=167, Invalid=1473, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:28:21,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2021-05-03 00:28:22,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 281. [2021-05-03 00:28:22,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 271 states have (on average 1.136531365313653) internal successors, (308), 271 states have internal predecessors, (308), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:28:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 319 transitions. [2021-05-03 00:28:22,083 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 319 transitions. Word has length 76 [2021-05-03 00:28:22,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:28:22,083 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 319 transitions. [2021-05-03 00:28:22,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 36 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:22,083 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 319 transitions. [2021-05-03 00:28:22,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:28:22,084 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:28:22,084 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:28:22,084 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable811 [2021-05-03 00:28:22,084 INFO L428 AbstractCegarLoop]: === Iteration 185 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:28:22,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:28:22,084 INFO L82 PathProgramCache]: Analyzing trace with hash -232152386, now seen corresponding path program 144 times [2021-05-03 00:28:22,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:28:22,084 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [941334289] [2021-05-03 00:28:22,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:28:22,102 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_645 v_main_~c~0_3683) (< v_main_~c~0_3683 v_~SIZE~0_640)) InVars {~SIZE~0=v_~SIZE~0_640, main_~c~0=v_main_~c~0_3683, ~last~0=v_~last~0_645} OutVars{~SIZE~0=v_~SIZE~0_640, main_~c~0=v_main_~c~0_3683, ~last~0=v_~last~0_645} AuxVars[] AssignedVars[] [2021-05-03 00:28:22,105 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:22,106 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:22,108 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:22,132 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:22,136 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:22,180 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:22,220 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3685 v_~SIZE~0_641) (< v_main_~c~0_3685 v_~last~0_646)) InVars {~SIZE~0=v_~SIZE~0_641, main_~c~0=v_main_~c~0_3685, ~last~0=v_~last~0_646} OutVars{~SIZE~0=v_~SIZE~0_641, main_~c~0=v_main_~c~0_3685, ~last~0=v_~last~0_646} AuxVars[] AssignedVars[] [2021-05-03 00:28:22,222 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:28:22,242 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:22,244 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:22,269 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:22,278 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:22,304 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:28:22,345 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:22,348 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_647 v_main_~c~0_3687) (< (+ v_main_~c~0_3687 1) v_~SIZE~0_642)) InVars {~SIZE~0=v_~SIZE~0_642, main_~c~0=v_main_~c~0_3687, ~last~0=v_~last~0_647} OutVars{~SIZE~0=v_~SIZE~0_642, main_~c~0=v_main_~c~0_3687, ~last~0=v_~last~0_647} AuxVars[] AssignedVars[] [2021-05-03 00:28:22,350 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:28:22,351 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:22,353 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:22,371 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:22,376 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:22,425 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:28:22,473 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3689 v_~last~0_648) (< (+ v_main_~c~0_3689 1) v_~SIZE~0_643)) InVars {~SIZE~0=v_~SIZE~0_643, main_~c~0=v_main_~c~0_3689, ~last~0=v_~last~0_648} OutVars{~SIZE~0=v_~SIZE~0_643, main_~c~0=v_main_~c~0_3689, ~last~0=v_~last~0_648} AuxVars[] AssignedVars[] [2021-05-03 00:28:22,475 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:22,475 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:22,477 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:22,502 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:22,510 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:22,565 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:22,622 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:22,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:28:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:22,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:28:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:22,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:28:22,859 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:28:25,592 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:28:25,592 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [941334289] [2021-05-03 00:28:25,592 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [941334289] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:28:25,592 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:28:25,592 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-03 00:28:25,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598461229] [2021-05-03 00:28:25,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-03 00:28:25,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:28:25,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-03 00:28:25,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1396, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:28:25,593 INFO L87 Difference]: Start difference. First operand 281 states and 319 transitions. Second operand has 39 states, 39 states have (on average 1.794871794871795) internal successors, (70), 37 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:30,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:28:30,137 INFO L93 Difference]: Finished difference Result 589 states and 653 transitions. [2021-05-03 00:28:30,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-03 00:28:30,139 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.794871794871795) internal successors, (70), 37 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:28:30,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:28:30,140 INFO L225 Difference]: With dead ends: 589 [2021-05-03 00:28:30,140 INFO L226 Difference]: Without dead ends: 373 [2021-05-03 00:28:30,141 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 8 SyntacticMatches, 25 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 2877.8ms TimeCoverageRelationStatistics Valid=174, Invalid=1548, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:28:30,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-05-03 00:28:30,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 281. [2021-05-03 00:28:30,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 271 states have (on average 1.136531365313653) internal successors, (308), 271 states have internal predecessors, (308), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:28:30,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 319 transitions. [2021-05-03 00:28:30,823 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 319 transitions. Word has length 76 [2021-05-03 00:28:30,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:28:30,823 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 319 transitions. [2021-05-03 00:28:30,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 1.794871794871795) internal successors, (70), 37 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:30,823 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 319 transitions. [2021-05-03 00:28:30,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:28:30,823 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:28:30,823 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:28:30,823 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable816 [2021-05-03 00:28:30,824 INFO L428 AbstractCegarLoop]: === Iteration 186 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:28:30,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:28:30,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1261511684, now seen corresponding path program 145 times [2021-05-03 00:28:30,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:28:30,824 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1197877770] [2021-05-03 00:28:30,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:28:30,834 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3711 v_~SIZE~0_644) (<= v_~last~0_649 v_main_~c~0_3711)) InVars {~SIZE~0=v_~SIZE~0_644, main_~c~0=v_main_~c~0_3711, ~last~0=v_~last~0_649} OutVars{~SIZE~0=v_~SIZE~0_644, main_~c~0=v_main_~c~0_3711, ~last~0=v_~last~0_649} AuxVars[] AssignedVars[] [2021-05-03 00:28:30,835 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:30,861 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:30,863 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:30,881 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:30,886 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:30,912 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:30,953 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3713 v_~last~0_650) (< v_main_~c~0_3713 v_~SIZE~0_645)) InVars {~SIZE~0=v_~SIZE~0_645, main_~c~0=v_main_~c~0_3713, ~last~0=v_~last~0_650} OutVars{~SIZE~0=v_~SIZE~0_645, main_~c~0=v_main_~c~0_3713, ~last~0=v_~last~0_650} AuxVars[] AssignedVars[] [2021-05-03 00:28:30,956 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:28:30,957 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:30,959 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:30,983 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:30,992 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:31,034 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:28:31,072 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:31,075 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3715 1) v_~SIZE~0_646) (<= v_~last~0_651 v_main_~c~0_3715)) InVars {~SIZE~0=v_~SIZE~0_646, main_~c~0=v_main_~c~0_3715, ~last~0=v_~last~0_651} OutVars{~SIZE~0=v_~SIZE~0_646, main_~c~0=v_main_~c~0_3715, ~last~0=v_~last~0_651} AuxVars[] AssignedVars[] [2021-05-03 00:28:31,077 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:28:31,102 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:31,104 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:31,121 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:31,125 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:31,152 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:28:31,190 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3717 v_~last~0_652) (< (+ v_main_~c~0_3717 1) v_~SIZE~0_647)) InVars {~SIZE~0=v_~SIZE~0_647, main_~c~0=v_main_~c~0_3717, ~last~0=v_~last~0_652} OutVars{~SIZE~0=v_~SIZE~0_647, main_~c~0=v_main_~c~0_3717, ~last~0=v_~last~0_652} AuxVars[] AssignedVars[] [2021-05-03 00:28:31,192 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:31,212 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:31,219 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:31,240 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:31,248 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:31,272 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:31,314 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:31,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:28:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:31,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:28:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:31,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:28:31,571 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:28:34,722 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:28:34,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1197877770] [2021-05-03 00:28:34,723 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1197877770] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:28:34,723 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:28:34,723 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-03 00:28:34,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200743447] [2021-05-03 00:28:34,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-03 00:28:34,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:28:34,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-03 00:28:34,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1469, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:28:34,724 INFO L87 Difference]: Start difference. First operand 281 states and 319 transitions. Second operand has 40 states, 40 states have (on average 1.75) internal successors, (70), 38 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:28:41,994 INFO L93 Difference]: Finished difference Result 586 states and 650 transitions. [2021-05-03 00:28:41,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-03 00:28:41,996 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.75) internal successors, (70), 38 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 76 [2021-05-03 00:28:41,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:28:41,997 INFO L225 Difference]: With dead ends: 586 [2021-05-03 00:28:41,997 INFO L226 Difference]: Without dead ends: 370 [2021-05-03 00:28:41,997 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 6 SyntacticMatches, 26 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 3362.4ms TimeCoverageRelationStatistics Valid=181, Invalid=1625, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:28:41,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-05-03 00:28:43,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 281. [2021-05-03 00:28:43,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 271 states have (on average 1.136531365313653) internal successors, (308), 271 states have internal predecessors, (308), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-05-03 00:28:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 319 transitions. [2021-05-03 00:28:43,005 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 319 transitions. Word has length 76 [2021-05-03 00:28:43,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:28:43,005 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 319 transitions. [2021-05-03 00:28:43,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 1.75) internal successors, (70), 38 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:28:43,005 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 319 transitions. [2021-05-03 00:28:43,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:28:43,005 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:28:43,005 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:28:43,005 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable821 [2021-05-03 00:28:43,006 INFO L428 AbstractCegarLoop]: === Iteration 187 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:28:43,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:28:43,006 INFO L82 PathProgramCache]: Analyzing trace with hash -2105517186, now seen corresponding path program 146 times [2021-05-03 00:28:43,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:28:43,006 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [973267803] [2021-05-03 00:28:43,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:28:43,027 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_~last~0_653 v_main_~c~0_3739) (< v_main_~c~0_3739 v_~SIZE~0_648)) InVars {~SIZE~0=v_~SIZE~0_648, main_~c~0=v_main_~c~0_3739, ~last~0=v_~last~0_653} OutVars{~SIZE~0=v_~SIZE~0_648, main_~c~0=v_main_~c~0_3739, ~last~0=v_~last~0_653} AuxVars[] AssignedVars[] [2021-05-03 00:28:43,031 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:43,033 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:43,037 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:43,067 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:43,077 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:43,171 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:43,261 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3741 v_~last~0_654) (< v_main_~c~0_3741 v_~SIZE~0_649)) InVars {~SIZE~0=v_~SIZE~0_649, main_~c~0=v_main_~c~0_3741, ~last~0=v_~last~0_654} OutVars{~SIZE~0=v_~SIZE~0_649, main_~c~0=v_main_~c~0_3741, ~last~0=v_~last~0_654} AuxVars[] AssignedVars[] [2021-05-03 00:28:43,263 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size [2021-05-03 00:28:43,266 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:43,269 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:43,307 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:28:43,323 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:28:43,399 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 84.6 percent of original size 66 [2021-05-03 00:28:43,484 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:43,489 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (+ v_main_~c~0_3743 1) v_~SIZE~0_650) (<= v_~last~0_655 v_main_~c~0_3743)) InVars {~SIZE~0=v_~SIZE~0_650, main_~c~0=v_main_~c~0_3743, ~last~0=v_~last~0_655} OutVars{~SIZE~0=v_~SIZE~0_650, main_~c~0=v_main_~c~0_3743, ~last~0=v_~last~0_655} AuxVars[] AssignedVars[] [2021-05-03 00:28:43,492 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size [2021-05-03 00:28:43,539 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:43,543 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:43,577 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:43,585 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:43,639 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 86.7 percent of original size 78 [2021-05-03 00:28:43,730 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~c~0_3745 v_~last~0_656) (< (+ v_main_~c~0_3745 1) v_~SIZE~0_651)) InVars {~SIZE~0=v_~SIZE~0_651, main_~c~0=v_main_~c~0_3745, ~last~0=v_~last~0_656} OutVars{~SIZE~0=v_~SIZE~0_651, main_~c~0=v_main_~c~0_3745, ~last~0=v_~last~0_656} AuxVars[] AssignedVars[] [2021-05-03 00:28:43,733 WARN L240 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size [2021-05-03 00:28:43,735 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:43,739 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:28:43,783 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-03 00:28:43,798 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-03 00:28:43,883 WARN L245 tifierPushTermWalker]: treesize reduction 12, result has 85.7 percent of original size 72 [2021-05-03 00:28:43,970 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:28:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:44,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:28:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:44,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:28:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:28:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:28:44,526 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:28:44,725 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2021-05-03 00:28:48,533 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:28:48,533 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [973267803] [2021-05-03 00:28:48,533 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [973267803] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:28:48,534 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:28:48,534 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-05-03 00:28:48,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015557481] [2021-05-03 00:28:48,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-05-03 00:28:48,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:28:48,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-05-03 00:28:48,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1544, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:28:48,535 INFO L87 Difference]: Start difference. First operand 281 states and 319 transitions. Second operand has 41 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 39 states have internal predecessors, (70), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)