/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-simple/nested_2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-03 00:29:45,790 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-03 00:29:45,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-03 00:29:45,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-03 00:29:45,829 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-03 00:29:45,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-03 00:29:45,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-03 00:29:45,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-03 00:29:45,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-03 00:29:45,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-03 00:29:45,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-03 00:29:45,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-03 00:29:45,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-03 00:29:45,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-03 00:29:45,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-03 00:29:45,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-03 00:29:45,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-03 00:29:45,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-03 00:29:45,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-03 00:29:45,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-03 00:29:45,866 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-03 00:29:45,867 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-03 00:29:45,868 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-03 00:29:45,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-03 00:29:45,875 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-03 00:29:45,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-03 00:29:45,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-03 00:29:45,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-03 00:29:45,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-03 00:29:45,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-03 00:29:45,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-03 00:29:45,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-03 00:29:45,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-03 00:29:45,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-03 00:29:45,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-03 00:29:45,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-03 00:29:45,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-03 00:29:45,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-03 00:29:45,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-03 00:29:45,885 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-03 00:29:45,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-03 00:29:45,890 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:29:45,905 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-03 00:29:45,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-03 00:29:45,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-03 00:29:45,908 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-03 00:29:45,908 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-03 00:29:45,908 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-03 00:29:45,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-03 00:29:45,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-03 00:29:45,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-03 00:29:45,909 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-03 00:29:45,910 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-03 00:29:45,910 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-03 00:29:45,910 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-03 00:29:45,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-03 00:29:45,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-03 00:29:45,911 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-03 00:29:45,911 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-03 00:29:45,911 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-03 00:29:45,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-03 00:29:45,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-03 00:29:45,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-03 00:29:45,911 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-03 00:29:45,911 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-03 00:29:45,911 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:29:46,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-03 00:29:46,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-03 00:29:46,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-03 00:29:46,248 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-03 00:29:46,248 INFO L275 PluginConnector]: CDTParser initialized [2021-05-03 00:29:46,249 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_2.c [2021-05-03 00:29:46,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b12826285/73d77a0ba34a4595a1a18127287362ed/FLAG42895fdf2 [2021-05-03 00:29:46,598 INFO L306 CDTParser]: Found 1 translation units. [2021-05-03 00:29:46,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_2.c [2021-05-03 00:29:46,604 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b12826285/73d77a0ba34a4595a1a18127287362ed/FLAG42895fdf2 [2021-05-03 00:29:47,033 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b12826285/73d77a0ba34a4595a1a18127287362ed [2021-05-03 00:29:47,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-03 00:29:47,037 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-03 00:29:47,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-03 00:29:47,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-03 00:29:47,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-03 00:29:47,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:29:47" (1/1) ... [2021-05-03 00:29:47,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139c393c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:29:47, skipping insertion in model container [2021-05-03 00:29:47,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:29:47" (1/1) ... [2021-05-03 00:29:47,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-03 00:29:47,060 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-03 00:29:47,148 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_2.c[730,743] [2021-05-03 00:29:47,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:29:47,158 INFO L203 MainTranslator]: Completed pre-run [2021-05-03 00:29:47,167 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_2.c[730,743] [2021-05-03 00:29:47,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:29:47,177 INFO L208 MainTranslator]: Completed translation [2021-05-03 00:29:47,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:29:47 WrapperNode [2021-05-03 00:29:47,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-03 00:29:47,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-03 00:29:47,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-03 00:29:47,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-03 00:29:47,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:29:47" (1/1) ... [2021-05-03 00:29:47,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:29:47" (1/1) ... [2021-05-03 00:29:47,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:29:47" (1/1) ... [2021-05-03 00:29:47,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:29:47" (1/1) ... [2021-05-03 00:29:47,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:29:47" (1/1) ... [2021-05-03 00:29:47,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:29:47" (1/1) ... [2021-05-03 00:29:47,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:29:47" (1/1) ... [2021-05-03 00:29:47,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-03 00:29:47,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-03 00:29:47,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-03 00:29:47,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-03 00:29:47,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:29:47" (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:29:47,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-03 00:29:47,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-03 00:29:47,350 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-03 00:29:47,350 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-03 00:29:47,350 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-03 00:29:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-03 00:29:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-03 00:29:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-03 00:29:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-03 00:29:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-03 00:29:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-03 00:29:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-03 00:29:47,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-03 00:29:47,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-03 00:29:47,511 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-03 00:29:47,511 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-03 00:29:47,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:29:47 BoogieIcfgContainer [2021-05-03 00:29:47,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-03 00:29:47,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-03 00:29:47,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-03 00:29:47,516 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-03 00:29:47,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 12:29:47" (1/3) ... [2021-05-03 00:29:47,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477e5ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:29:47, skipping insertion in model container [2021-05-03 00:29:47,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:29:47" (2/3) ... [2021-05-03 00:29:47,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477e5ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:29:47, skipping insertion in model container [2021-05-03 00:29:47,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:29:47" (3/3) ... [2021-05-03 00:29:47,518 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_2.c [2021-05-03 00:29:47,523 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-03 00:29:47,525 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-03 00:29:47,537 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-03 00:29:47,551 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-03 00:29:47,552 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-03 00:29:47,552 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-03 00:29:47,552 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-03 00:29:47,552 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-03 00:29:47,552 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-03 00:29:47,552 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-03 00:29:47,552 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-03 00:29:47,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-03 00:29:47,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-05-03 00:29:47,567 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:47,568 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:47,568 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:47,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:47,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1747983725, now seen corresponding path program 1 times [2021-05-03 00:29:47,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:47,578 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1525127530] [2021-05-03 00:29:47,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:47,618 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:29:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:47,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:47,742 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:29:47,743 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:47,744 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1525127530] [2021-05-03 00:29:47,745 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1525127530] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:47,745 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:47,745 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-03 00:29:47,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465697101] [2021-05-03 00:29:47,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-03 00:29:47,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:47,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-03 00:29:47,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-03 00:29:47,760 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:47,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:29:47,840 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2021-05-03 00:29:47,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-03 00:29:47,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-05-03 00:29:47,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:29:47,847 INFO L225 Difference]: With dead ends: 34 [2021-05-03 00:29:47,847 INFO L226 Difference]: Without dead ends: 17 [2021-05-03 00:29:47,850 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 56.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-03 00:29:47,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-05-03 00:29:47,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2021-05-03 00:29:47,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:47,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-05-03 00:29:47,876 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2021-05-03 00:29:47,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:29:47,877 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-05-03 00:29:47,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:47,877 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-05-03 00:29:47,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-03 00:29:47,877 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:47,878 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:47,878 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-03 00:29:47,878 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:47,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:47,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1955520686, now seen corresponding path program 1 times [2021-05-03 00:29:47,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:47,879 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [862750282] [2021-05-03 00:29:47,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:47,892 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:29:47,899 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:47,915 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-05-03 00:29:47,924 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:29:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:47,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:47,989 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:29:48,001 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:48,002 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [862750282] [2021-05-03 00:29:48,002 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [862750282] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:48,002 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:48,002 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-03 00:29:48,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699867924] [2021-05-03 00:29:48,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-03 00:29:48,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:48,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-03 00:29:48,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-03 00:29:48,004 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:48,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:29:48,094 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2021-05-03 00:29:48,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-03 00:29:48,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-05-03 00:29:48,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:29:48,095 INFO L225 Difference]: With dead ends: 26 [2021-05-03 00:29:48,095 INFO L226 Difference]: Without dead ends: 19 [2021-05-03 00:29:48,096 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 81.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-03 00:29:48,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-05-03 00:29:48,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2021-05-03 00:29:48,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:48,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-05-03 00:29:48,101 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2021-05-03 00:29:48,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:29:48,101 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-05-03 00:29:48,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:48,102 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2021-05-03 00:29:48,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-03 00:29:48,102 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:48,102 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:48,102 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-03 00:29:48,102 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:48,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:48,103 INFO L82 PathProgramCache]: Analyzing trace with hash -686991696, now seen corresponding path program 1 times [2021-05-03 00:29:48,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:48,103 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [533154575] [2021-05-03 00:29:48,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:48,117 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_13 6) InVars {main_~b~0=v_main_~b~0_13} OutVars{main_~b~0=v_main_~b~0_13} AuxVars[] AssignedVars[] [2021-05-03 00:29:48,122 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:29:48,124 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:48,136 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:48,153 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:29:48,167 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:29:48,169 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:48,178 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:29:48,185 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:29:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:48,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:48,236 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:29:48,256 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:48,256 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [533154575] [2021-05-03 00:29:48,256 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [533154575] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:48,257 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:48,257 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-03 00:29:48,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680171246] [2021-05-03 00:29:48,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-03 00:29:48,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:48,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-03 00:29:48,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-03 00:29:48,258 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:48,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:29:48,370 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-05-03 00:29:48,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-03 00:29:48,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-03 00:29:48,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:29:48,371 INFO L225 Difference]: With dead ends: 28 [2021-05-03 00:29:48,371 INFO L226 Difference]: Without dead ends: 21 [2021-05-03 00:29:48,372 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 84.8ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-03 00:29:48,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-05-03 00:29:48,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2021-05-03 00:29:48,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:48,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-05-03 00:29:48,384 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2021-05-03 00:29:48,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:29:48,384 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-05-03 00:29:48,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:48,385 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-05-03 00:29:48,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-03 00:29:48,385 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:48,385 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:48,386 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-03 00:29:48,386 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:48,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:48,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1401344370, now seen corresponding path program 2 times [2021-05-03 00:29:48,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:48,387 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1506368575] [2021-05-03 00:29:48,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:48,412 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_22 6) InVars {main_~b~0=v_main_~b~0_22} OutVars{main_~b~0=v_main_~b~0_22} AuxVars[] AssignedVars[] [2021-05-03 00:29:48,421 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:29:48,424 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:48,431 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:48,451 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:29:48,465 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:29:48,467 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:48,478 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:29:48,485 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:29:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:48,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:48,587 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:29:48,613 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:48,613 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1506368575] [2021-05-03 00:29:48,613 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1506368575] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:48,613 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:48,613 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-03 00:29:48,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559463197] [2021-05-03 00:29:48,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-03 00:29:48,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:48,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-03 00:29:48,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-05-03 00:29:48,615 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:48,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:29:48,731 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-05-03 00:29:48,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-03 00:29:48,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-05-03 00:29:48,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:29:48,732 INFO L225 Difference]: With dead ends: 30 [2021-05-03 00:29:48,732 INFO L226 Difference]: Without dead ends: 23 [2021-05-03 00:29:48,733 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 117.3ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-05-03 00:29:48,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-05-03 00:29:48,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2021-05-03 00:29:48,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:48,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2021-05-03 00:29:48,737 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2021-05-03 00:29:48,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:29:48,738 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-05-03 00:29:48,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:48,738 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2021-05-03 00:29:48,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-03 00:29:48,738 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:48,738 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:48,738 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-03 00:29:48,739 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:48,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:48,739 INFO L82 PathProgramCache]: Analyzing trace with hash -699496724, now seen corresponding path program 3 times [2021-05-03 00:29:48,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:48,739 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2074917899] [2021-05-03 00:29:48,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:48,756 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_35 6) InVars {main_~b~0=v_main_~b~0_35} OutVars{main_~b~0=v_main_~b~0_35} AuxVars[] AssignedVars[] [2021-05-03 00:29:48,758 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:29:48,767 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:48,772 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:48,779 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:29:48,790 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:29:48,791 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:48,799 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:29:48,804 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:29:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:48,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:48,840 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:29:48,872 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:48,872 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2074917899] [2021-05-03 00:29:48,873 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2074917899] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:48,873 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:48,873 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-03 00:29:48,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719335086] [2021-05-03 00:29:48,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-03 00:29:48,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:48,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-03 00:29:48,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-03 00:29:48,874 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:49,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:29:49,020 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-05-03 00:29:49,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-03 00:29:49,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-05-03 00:29:49,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:29:49,021 INFO L225 Difference]: With dead ends: 32 [2021-05-03 00:29:49,021 INFO L226 Difference]: Without dead ends: 25 [2021-05-03 00:29:49,022 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 130.4ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-05-03 00:29:49,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-05-03 00:29:49,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2021-05-03 00:29:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2021-05-03 00:29:49,026 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2021-05-03 00:29:49,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:29:49,027 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-05-03 00:29:49,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2021-05-03 00:29:49,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-03 00:29:49,027 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:49,027 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:49,027 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-03 00:29:49,027 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:49,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:49,028 INFO L82 PathProgramCache]: Analyzing trace with hash -533774390, now seen corresponding path program 4 times [2021-05-03 00:29:49,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:49,028 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [908359939] [2021-05-03 00:29:49,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:49,061 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_50 6) InVars {main_~b~0=v_main_~b~0_50} OutVars{main_~b~0=v_main_~b~0_50} AuxVars[] AssignedVars[] [2021-05-03 00:29:49,064 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:29:49,065 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:49,070 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:49,084 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:29:49,096 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:29:49,097 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:49,105 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:29:49,111 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:29:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:49,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:49,149 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:29:49,196 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:49,196 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [908359939] [2021-05-03 00:29:49,196 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [908359939] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:49,196 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:49,196 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-03 00:29:49,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68789949] [2021-05-03 00:29:49,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-03 00:29:49,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:49,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-03 00:29:49,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-05-03 00:29:49,197 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:49,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:29:49,384 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2021-05-03 00:29:49,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-03 00:29:49,384 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-05-03 00:29:49,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:29:49,385 INFO L225 Difference]: With dead ends: 34 [2021-05-03 00:29:49,385 INFO L226 Difference]: Without dead ends: 27 [2021-05-03 00:29:49,385 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 164.3ms TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:29:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-05-03 00:29:49,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2021-05-03 00:29:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:49,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-05-03 00:29:49,390 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2021-05-03 00:29:49,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:29:49,390 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-05-03 00:29:49,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:49,391 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-05-03 00:29:49,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-03 00:29:49,391 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:49,391 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:49,391 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-03 00:29:49,391 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:49,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:49,392 INFO L82 PathProgramCache]: Analyzing trace with hash -188401368, now seen corresponding path program 5 times [2021-05-03 00:29:49,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:49,392 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1316841958] [2021-05-03 00:29:49,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:49,408 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_67 6) InVars {main_~b~0=v_main_~b~0_67} OutVars{main_~b~0=v_main_~b~0_67} AuxVars[] AssignedVars[] [2021-05-03 00:29:49,410 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:29:49,413 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:49,419 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:49,431 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:29:49,444 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:29:49,445 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:49,454 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:29:49,459 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:29:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:49,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:49,501 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:29:49,558 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:49,559 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1316841958] [2021-05-03 00:29:49,559 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1316841958] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:49,559 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:49,559 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-03 00:29:49,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936681773] [2021-05-03 00:29:49,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-03 00:29:49,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:49,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-03 00:29:49,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-05-03 00:29:49,560 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:49,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:29:49,763 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2021-05-03 00:29:49,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-03 00:29:49,764 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-05-03 00:29:49,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:29:49,764 INFO L225 Difference]: With dead ends: 36 [2021-05-03 00:29:49,765 INFO L226 Difference]: Without dead ends: 29 [2021-05-03 00:29:49,765 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 199.4ms TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:29:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-05-03 00:29:49,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2021-05-03 00:29:49,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:49,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-05-03 00:29:49,770 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2021-05-03 00:29:49,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:29:49,771 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-05-03 00:29:49,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:49,771 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2021-05-03 00:29:49,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-03 00:29:49,771 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:49,771 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:49,771 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-03 00:29:49,772 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:49,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:49,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1002590982, now seen corresponding path program 6 times [2021-05-03 00:29:49,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:49,772 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2070407794] [2021-05-03 00:29:49,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:49,787 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_86 6) InVars {main_~b~0=v_main_~b~0_86} OutVars{main_~b~0=v_main_~b~0_86} AuxVars[] AssignedVars[] [2021-05-03 00:29:49,789 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:29:49,796 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:49,801 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:49,808 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:29:49,823 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_34 6) InVars {main_~a~0=v_main_~a~0_34} OutVars{main_~a~0=v_main_~a~0_34} AuxVars[] AssignedVars[] [2021-05-03 00:29:49,826 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:29:49,827 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:49,832 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:49,851 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:29:49,864 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:29:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:49,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:49,913 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:29:50,019 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:50,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2070407794] [2021-05-03 00:29:50,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2070407794] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:50,019 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:50,019 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-03 00:29:50,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891911495] [2021-05-03 00:29:50,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-03 00:29:50,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:50,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-03 00:29:50,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:29:50,021 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:29:50,268 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2021-05-03 00:29:50,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-03 00:29:50,269 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-05-03 00:29:50,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:29:50,269 INFO L225 Difference]: With dead ends: 36 [2021-05-03 00:29:50,269 INFO L226 Difference]: Without dead ends: 29 [2021-05-03 00:29:50,270 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 267.3ms TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:29:50,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-05-03 00:29:50,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-05-03 00:29:50,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:50,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2021-05-03 00:29:50,275 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2021-05-03 00:29:50,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:29:50,276 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-05-03 00:29:50,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:50,276 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2021-05-03 00:29:50,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-03 00:29:50,276 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:50,276 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:50,276 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-03 00:29:50,277 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:50,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:50,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1029502463, now seen corresponding path program 7 times [2021-05-03 00:29:50,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:50,277 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2061622953] [2021-05-03 00:29:50,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:50,302 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_108 6) InVars {main_~b~0=v_main_~b~0_108} OutVars{main_~b~0=v_main_~b~0_108} AuxVars[] AssignedVars[] [2021-05-03 00:29:50,304 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:29:50,311 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:50,316 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:50,323 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:29:50,334 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 6 v_main_~b~0_110) (< v_main_~a~0_38 5)) InVars {main_~b~0=v_main_~b~0_110, main_~a~0=v_main_~a~0_38} OutVars{main_~b~0=v_main_~b~0_110, main_~a~0=v_main_~a~0_38} AuxVars[] AssignedVars[] [2021-05-03 00:29:50,337 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:29:50,338 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:50,341 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:29:50,359 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:29:50,378 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:29:50,379 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:50,385 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-05-03 00:29:50,392 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_44 6) InVars {main_~a~0=v_main_~a~0_44} OutVars{main_~a~0=v_main_~a~0_44} AuxVars[] AssignedVars[] [2021-05-03 00:29:50,394 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:29:50,395 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:50,400 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:50,420 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:29:50,432 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:29:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:50,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:50,480 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:29:50,483 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:29:50,577 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:50,577 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2061622953] [2021-05-03 00:29:50,577 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2061622953] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:50,577 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:50,577 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-03 00:29:50,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962108067] [2021-05-03 00:29:50,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-03 00:29:50,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:50,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-03 00:29:50,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:29:50,579 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:29:50,878 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2021-05-03 00:29:50,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-03 00:29:50,878 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-05-03 00:29:50,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:29:50,879 INFO L225 Difference]: With dead ends: 38 [2021-05-03 00:29:50,879 INFO L226 Difference]: Without dead ends: 31 [2021-05-03 00:29:50,879 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 301.8ms TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:29:50,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-05-03 00:29:50,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2021-05-03 00:29:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:50,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2021-05-03 00:29:50,885 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2021-05-03 00:29:50,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:29:50,885 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2021-05-03 00:29:50,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2021-05-03 00:29:50,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-03 00:29:50,886 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:50,886 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:50,886 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-03 00:29:50,886 INFO L428 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:50,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:50,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1117899235, now seen corresponding path program 8 times [2021-05-03 00:29:50,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:50,887 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1712525437] [2021-05-03 00:29:50,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:50,929 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_137 6) InVars {main_~b~0=v_main_~b~0_137} OutVars{main_~b~0=v_main_~b~0_137} AuxVars[] AssignedVars[] [2021-05-03 00:29:50,931 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:29:50,932 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:50,937 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:50,948 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:29:50,959 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 6 v_main_~b~0_139) (< v_main_~a~0_50 5)) InVars {main_~b~0=v_main_~b~0_139, main_~a~0=v_main_~a~0_50} OutVars{main_~b~0=v_main_~b~0_139, main_~a~0=v_main_~a~0_50} AuxVars[] AssignedVars[] [2021-05-03 00:29:50,962 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:29:50,973 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:50,976 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:29:50,984 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:29:51,005 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_56 6) InVars {main_~a~0=v_main_~a~0_56} OutVars{main_~a~0=v_main_~a~0_56} AuxVars[] AssignedVars[] [2021-05-03 00:29:51,007 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:29:51,008 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:51,013 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:51,033 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:29:51,045 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:29:51,046 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:51,054 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:29:51,060 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:29:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:51,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:51,116 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:29:51,258 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:51,258 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1712525437] [2021-05-03 00:29:51,259 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1712525437] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:51,259 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:51,259 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-03 00:29:51,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270992437] [2021-05-03 00:29:51,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-03 00:29:51,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:51,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-03 00:29:51,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:29:51,260 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:51,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:29:51,561 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2021-05-03 00:29:51,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-03 00:29:51,561 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-05-03 00:29:51,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:29:51,562 INFO L225 Difference]: With dead ends: 40 [2021-05-03 00:29:51,562 INFO L226 Difference]: Without dead ends: 33 [2021-05-03 00:29:51,563 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 341.0ms TimeCoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:29:51,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-03 00:29:51,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2021-05-03 00:29:51,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:51,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2021-05-03 00:29:51,568 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2021-05-03 00:29:51,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:29:51,569 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2021-05-03 00:29:51,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:51,569 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2021-05-03 00:29:51,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-03 00:29:51,569 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:51,569 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:51,569 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-03 00:29:51,570 INFO L428 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:51,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:51,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1108338363, now seen corresponding path program 9 times [2021-05-03 00:29:51,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:51,570 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1555760487] [2021-05-03 00:29:51,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:51,613 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_172 6) InVars {main_~b~0=v_main_~b~0_172} OutVars{main_~b~0=v_main_~b~0_172} AuxVars[] AssignedVars[] [2021-05-03 00:29:51,615 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:29:51,622 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:51,626 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:51,632 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:29:51,644 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~a~0_64 5) (<= 6 v_main_~b~0_174)) InVars {main_~b~0=v_main_~b~0_174, main_~a~0=v_main_~a~0_64} OutVars{main_~b~0=v_main_~b~0_174, main_~a~0=v_main_~a~0_64} AuxVars[] AssignedVars[] [2021-05-03 00:29:51,646 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:29:51,647 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:51,649 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:29:51,667 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:29:51,685 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:29:51,686 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:51,694 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:29:51,701 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_72 6) InVars {main_~a~0=v_main_~a~0_72} OutVars{main_~a~0=v_main_~a~0_72} AuxVars[] AssignedVars[] [2021-05-03 00:29:51,703 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:29:51,704 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:51,709 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:51,728 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:29:51,740 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:29:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:51,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:51,787 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:29:51,789 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:29:51,923 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:51,923 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1555760487] [2021-05-03 00:29:51,924 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1555760487] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:51,924 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:51,924 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-03 00:29:51,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991203561] [2021-05-03 00:29:51,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-03 00:29:51,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:51,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-03 00:29:51,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:29:51,925 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:52,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:29:52,260 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2021-05-03 00:29:52,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-03 00:29:52,260 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-05-03 00:29:52,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:29:52,261 INFO L225 Difference]: With dead ends: 42 [2021-05-03 00:29:52,261 INFO L226 Difference]: Without dead ends: 35 [2021-05-03 00:29:52,262 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 358.7ms TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:29:52,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-05-03 00:29:52,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-05-03 00:29:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2021-05-03 00:29:52,267 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 31 [2021-05-03 00:29:52,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:29:52,267 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2021-05-03 00:29:52,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:52,268 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2021-05-03 00:29:52,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-03 00:29:52,268 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:52,268 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:52,268 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-03 00:29:52,268 INFO L428 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:52,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:52,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1628956633, now seen corresponding path program 10 times [2021-05-03 00:29:52,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:52,269 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1243736715] [2021-05-03 00:29:52,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:52,311 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_208 6) InVars {main_~b~0=v_main_~b~0_208} OutVars{main_~b~0=v_main_~b~0_208} AuxVars[] AssignedVars[] [2021-05-03 00:29:52,312 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:29:52,319 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:52,323 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:52,329 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:29:52,340 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 6 v_main_~b~0_210) (< v_main_~a~0_78 5)) InVars {main_~b~0=v_main_~b~0_210, main_~a~0=v_main_~a~0_78} OutVars{main_~b~0=v_main_~b~0_210, main_~a~0=v_main_~a~0_78} AuxVars[] AssignedVars[] [2021-05-03 00:29:52,342 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:29:52,342 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:52,344 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:29:52,361 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:29:52,380 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:29:52,381 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:52,388 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:29:52,395 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_86 6) InVars {main_~a~0=v_main_~a~0_86} OutVars{main_~a~0=v_main_~a~0_86} AuxVars[] AssignedVars[] [2021-05-03 00:29:52,397 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:29:52,398 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:52,402 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:52,421 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:29:52,441 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:29:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:52,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:52,487 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:29:52,489 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:29:52,604 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:52,604 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1243736715] [2021-05-03 00:29:52,604 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1243736715] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:52,604 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:52,604 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-03 00:29:52,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41340122] [2021-05-03 00:29:52,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-03 00:29:52,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:52,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-03 00:29:52,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:29:52,605 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:52,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:29:52,974 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2021-05-03 00:29:52,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-03 00:29:52,974 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-05-03 00:29:52,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:29:52,975 INFO L225 Difference]: With dead ends: 44 [2021-05-03 00:29:52,975 INFO L226 Difference]: Without dead ends: 37 [2021-05-03 00:29:52,975 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 359.2ms TimeCoverageRelationStatistics Valid=113, Invalid=757, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:29:52,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-05-03 00:29:52,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2021-05-03 00:29:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2021-05-03 00:29:52,981 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 33 [2021-05-03 00:29:52,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:29:52,981 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2021-05-03 00:29:52,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:52,982 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2021-05-03 00:29:52,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-03 00:29:52,982 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:52,982 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:52,982 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-03 00:29:52,982 INFO L428 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:52,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:52,983 INFO L82 PathProgramCache]: Analyzing trace with hash -568059529, now seen corresponding path program 11 times [2021-05-03 00:29:52,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:52,983 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1413532062] [2021-05-03 00:29:52,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:53,035 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_246 6) InVars {main_~b~0=v_main_~b~0_246} OutVars{main_~b~0=v_main_~b~0_246} AuxVars[] AssignedVars[] [2021-05-03 00:29:53,037 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:29:53,045 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:53,049 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:53,056 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:29:53,067 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 6 v_main_~b~0_248) (< v_main_~a~0_92 5)) InVars {main_~b~0=v_main_~b~0_248, main_~a~0=v_main_~a~0_92} OutVars{main_~b~0=v_main_~b~0_248, main_~a~0=v_main_~a~0_92} AuxVars[] AssignedVars[] [2021-05-03 00:29:53,069 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:29:53,082 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:53,084 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:29:53,093 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:29:53,115 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_98 6) InVars {main_~a~0=v_main_~a~0_98} OutVars{main_~a~0=v_main_~a~0_98} AuxVars[] AssignedVars[] [2021-05-03 00:29:53,117 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:29:53,118 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:53,123 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:53,143 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:29:53,156 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:29:53,157 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:53,165 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:29:53,171 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:29:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:53,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:53,228 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:29:53,395 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:53,395 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1413532062] [2021-05-03 00:29:53,395 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1413532062] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:53,395 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:53,395 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-03 00:29:53,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596111078] [2021-05-03 00:29:53,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-03 00:29:53,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:53,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-03 00:29:53,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:29:53,397 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:53,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:29:53,827 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2021-05-03 00:29:53,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-03 00:29:53,828 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-05-03 00:29:53,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:29:53,829 INFO L225 Difference]: With dead ends: 46 [2021-05-03 00:29:53,829 INFO L226 Difference]: Without dead ends: 39 [2021-05-03 00:29:53,829 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 448.9ms TimeCoverageRelationStatistics Valid=138, Invalid=918, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:29:53,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-05-03 00:29:53,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2021-05-03 00:29:53,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:53,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2021-05-03 00:29:53,835 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 35 [2021-05-03 00:29:53,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:29:53,835 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2021-05-03 00:29:53,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 17 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:53,835 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2021-05-03 00:29:53,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-03 00:29:53,836 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:53,836 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:53,836 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-03 00:29:53,836 INFO L428 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:53,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:53,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1223318421, now seen corresponding path program 12 times [2021-05-03 00:29:53,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:53,837 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1120916071] [2021-05-03 00:29:53,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:53,877 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_287 6) InVars {main_~b~0=v_main_~b~0_287} OutVars{main_~b~0=v_main_~b~0_287} AuxVars[] AssignedVars[] [2021-05-03 00:29:53,878 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:29:53,885 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:53,889 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:53,895 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:29:53,905 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 6 v_main_~b~0_289) (< v_main_~a~0_106 5)) InVars {main_~b~0=v_main_~b~0_289, main_~a~0=v_main_~a~0_106} OutVars{main_~b~0=v_main_~b~0_289, main_~a~0=v_main_~a~0_106} AuxVars[] AssignedVars[] [2021-05-03 00:29:53,906 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:29:53,917 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:53,920 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:29:53,928 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:29:53,948 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_112 6) InVars {main_~a~0=v_main_~a~0_112} OutVars{main_~a~0=v_main_~a~0_112} AuxVars[] AssignedVars[] [2021-05-03 00:29:53,949 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:29:53,960 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:53,964 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:53,973 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:29:53,985 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:29:53,985 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:53,993 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:29:53,998 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:29:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:54,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:54,058 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:29:54,249 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:54,249 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1120916071] [2021-05-03 00:29:54,249 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1120916071] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:54,249 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:54,249 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-03 00:29:54,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158741095] [2021-05-03 00:29:54,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-03 00:29:54,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:54,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-03 00:29:54,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:29:54,251 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 18 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:54,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:29:54,716 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2021-05-03 00:29:54,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-03 00:29:54,717 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 18 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-05-03 00:29:54,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:29:54,717 INFO L225 Difference]: With dead ends: 50 [2021-05-03 00:29:54,717 INFO L226 Difference]: Without dead ends: 43 [2021-05-03 00:29:54,718 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 474.7ms TimeCoverageRelationStatistics Valid=166, Invalid=1094, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:29:54,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-05-03 00:29:54,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2021-05-03 00:29:54,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2021-05-03 00:29:54,725 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 37 [2021-05-03 00:29:54,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:29:54,726 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2021-05-03 00:29:54,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 18 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:54,726 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2021-05-03 00:29:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-05-03 00:29:54,726 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:54,726 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:54,726 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-03 00:29:54,726 INFO L428 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:54,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:54,727 INFO L82 PathProgramCache]: Analyzing trace with hash 455642675, now seen corresponding path program 13 times [2021-05-03 00:29:54,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:54,727 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1370284602] [2021-05-03 00:29:54,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:54,768 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_330 6) InVars {main_~b~0=v_main_~b~0_330} OutVars{main_~b~0=v_main_~b~0_330} AuxVars[] AssignedVars[] [2021-05-03 00:29:54,769 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:29:54,776 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:54,780 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:54,786 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:29:54,796 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 6 v_main_~b~0_332) (< v_main_~a~0_120 5)) InVars {main_~b~0=v_main_~b~0_332, main_~a~0=v_main_~a~0_120} OutVars{main_~b~0=v_main_~b~0_332, main_~a~0=v_main_~a~0_120} AuxVars[] AssignedVars[] [2021-05-03 00:29:54,797 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:29:54,808 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:54,811 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:29:54,819 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:29:54,837 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_126 6) InVars {main_~a~0=v_main_~a~0_126} OutVars{main_~a~0=v_main_~a~0_126} AuxVars[] AssignedVars[] [2021-05-03 00:29:54,839 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:29:54,849 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:54,854 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:54,862 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:29:54,874 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:29:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:54,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:54,915 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:29:55,101 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:55,102 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1370284602] [2021-05-03 00:29:55,102 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1370284602] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:55,102 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:55,102 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-03 00:29:55,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262058204] [2021-05-03 00:29:55,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-03 00:29:55,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:55,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-03 00:29:55,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:29:55,103 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 20 states, 20 states have (on average 1.8) internal successors, (36), 19 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:55,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:29:55,645 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2021-05-03 00:29:55,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-03 00:29:55,645 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 19 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-05-03 00:29:55,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:29:55,646 INFO L225 Difference]: With dead ends: 47 [2021-05-03 00:29:55,646 INFO L226 Difference]: Without dead ends: 44 [2021-05-03 00:29:55,647 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 491.9ms TimeCoverageRelationStatistics Valid=152, Invalid=1180, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:29:55,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-05-03 00:29:55,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-05-03 00:29:55,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2021-05-03 00:29:55,654 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 39 [2021-05-03 00:29:55,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:29:55,654 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2021-05-03 00:29:55,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 19 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:55,654 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2021-05-03 00:29:55,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-05-03 00:29:55,657 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:55,657 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:55,657 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-03 00:29:55,657 INFO L428 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:55,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:55,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1998409650, now seen corresponding path program 14 times [2021-05-03 00:29:55,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:55,657 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2027841950] [2021-05-03 00:29:55,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:55,700 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_366 6) InVars {main_~b~0=v_main_~b~0_366} OutVars{main_~b~0=v_main_~b~0_366} AuxVars[] AssignedVars[] [2021-05-03 00:29:55,701 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:29:55,707 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:55,712 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:55,717 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:29:55,728 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 6 v_main_~b~0_368) (< v_main_~a~0_131 5)) InVars {main_~b~0=v_main_~b~0_368, main_~a~0=v_main_~a~0_131} OutVars{main_~b~0=v_main_~b~0_368, main_~a~0=v_main_~a~0_131} AuxVars[] AssignedVars[] [2021-05-03 00:29:55,729 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:29:55,741 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:55,743 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:29:55,751 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:29:55,769 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:29:55,770 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:55,775 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-05-03 00:29:55,782 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_139 6) InVars {main_~a~0=v_main_~a~0_139} OutVars{main_~a~0=v_main_~a~0_139} AuxVars[] AssignedVars[] [2021-05-03 00:29:55,783 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:29:55,784 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:55,788 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:55,805 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:29:55,817 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:29:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:55,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:55,884 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:29:55,886 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:29:56,119 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:56,119 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2027841950] [2021-05-03 00:29:56,120 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2027841950] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:56,120 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:56,120 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-03 00:29:56,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016048487] [2021-05-03 00:29:56,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-03 00:29:56,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:56,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-03 00:29:56,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:29:56,121 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:56,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:29:56,652 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2021-05-03 00:29:56,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-03 00:29:56,652 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2021-05-03 00:29:56,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:29:56,653 INFO L225 Difference]: With dead ends: 53 [2021-05-03 00:29:56,653 INFO L226 Difference]: Without dead ends: 46 [2021-05-03 00:29:56,653 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 583.7ms TimeCoverageRelationStatistics Valid=139, Invalid=1267, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:29:56,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-05-03 00:29:56,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2021-05-03 00:29:56,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:56,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2021-05-03 00:29:56,660 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2021-05-03 00:29:56,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:29:56,660 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-05-03 00:29:56,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:56,660 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2021-05-03 00:29:56,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-03 00:29:56,661 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:56,661 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:56,661 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-03 00:29:56,661 INFO L428 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:56,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:56,662 INFO L82 PathProgramCache]: Analyzing trace with hash -2005995760, now seen corresponding path program 15 times [2021-05-03 00:29:56,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:56,662 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [360372324] [2021-05-03 00:29:56,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:56,703 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_405 6) InVars {main_~b~0=v_main_~b~0_405} OutVars{main_~b~0=v_main_~b~0_405} AuxVars[] AssignedVars[] [2021-05-03 00:29:56,704 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:29:56,710 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:56,714 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:56,742 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:29:56,752 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~a~0_146 5) (<= 6 v_main_~b~0_407)) InVars {main_~b~0=v_main_~b~0_407, main_~a~0=v_main_~a~0_146} OutVars{main_~b~0=v_main_~b~0_407, main_~a~0=v_main_~a~0_146} AuxVars[] AssignedVars[] [2021-05-03 00:29:56,753 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:29:56,764 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:56,766 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:29:56,774 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:29:56,793 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_152 6) InVars {main_~a~0=v_main_~a~0_152} OutVars{main_~a~0=v_main_~a~0_152} AuxVars[] AssignedVars[] [2021-05-03 00:29:56,794 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:29:56,804 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:56,809 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:56,817 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:29:56,830 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:29:56,831 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:56,838 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:29:56,843 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:29:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:56,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:56,917 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:29:57,140 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:57,140 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [360372324] [2021-05-03 00:29:57,140 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [360372324] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:57,140 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:57,140 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-03 00:29:57,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721766967] [2021-05-03 00:29:57,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-03 00:29:57,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:57,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-03 00:29:57,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:29:57,142 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:57,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:29:57,759 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2021-05-03 00:29:57,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-03 00:29:57,759 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-05-03 00:29:57,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:29:57,759 INFO L225 Difference]: With dead ends: 55 [2021-05-03 00:29:57,760 INFO L226 Difference]: Without dead ends: 48 [2021-05-03 00:29:57,760 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 619.2ms TimeCoverageRelationStatistics Valid=204, Invalid=1518, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:29:57,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-05-03 00:29:57,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2021-05-03 00:29:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:57,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2021-05-03 00:29:57,767 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2021-05-03 00:29:57,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:29:57,767 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2021-05-03 00:29:57,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:57,767 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2021-05-03 00:29:57,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-05-03 00:29:57,770 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:57,770 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:57,770 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-03 00:29:57,770 INFO L428 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:57,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:57,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1948897554, now seen corresponding path program 16 times [2021-05-03 00:29:57,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:57,770 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1601178496] [2021-05-03 00:29:57,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:57,813 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_447 6) InVars {main_~b~0=v_main_~b~0_447} OutVars{main_~b~0=v_main_~b~0_447} AuxVars[] AssignedVars[] [2021-05-03 00:29:57,814 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:29:57,814 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:57,818 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:57,830 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:29:57,840 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 6 v_main_~b~0_449) (< v_main_~a~0_161 5)) InVars {main_~b~0=v_main_~b~0_449, main_~a~0=v_main_~a~0_161} OutVars{main_~b~0=v_main_~b~0_449, main_~a~0=v_main_~a~0_161} AuxVars[] AssignedVars[] [2021-05-03 00:29:57,842 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:29:57,853 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:57,857 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:29:57,865 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:29:57,883 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:29:57,883 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:57,891 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:29:57,898 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_169 6) InVars {main_~a~0=v_main_~a~0_169} OutVars{main_~a~0=v_main_~a~0_169} AuxVars[] AssignedVars[] [2021-05-03 00:29:57,900 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:29:57,900 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:57,905 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:57,923 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:29:57,935 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:29:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:57,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:57,978 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:29:57,980 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:29:58,191 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:58,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1601178496] [2021-05-03 00:29:58,191 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1601178496] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:58,191 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:58,191 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:29:58,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60072615] [2021-05-03 00:29:58,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:29:58,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:58,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:29:58,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:29:58,193 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:58,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:29:58,834 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2021-05-03 00:29:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-03 00:29:58,834 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-05-03 00:29:58,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:29:58,835 INFO L225 Difference]: With dead ends: 57 [2021-05-03 00:29:58,835 INFO L226 Difference]: Without dead ends: 50 [2021-05-03 00:29:58,835 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 615.1ms TimeCoverageRelationStatistics Valid=151, Invalid=1571, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:29:58,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-05-03 00:29:58,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2021-05-03 00:29:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:58,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2021-05-03 00:29:58,842 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2021-05-03 00:29:58,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:29:58,843 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2021-05-03 00:29:58,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 22 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:29:58,843 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2021-05-03 00:29:58,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-05-03 00:29:58,843 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:29:58,843 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:29:58,843 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-03 00:29:58,843 INFO L428 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:29:58,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:29:58,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1382870860, now seen corresponding path program 17 times [2021-05-03 00:29:58,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:29:58,844 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [795865727] [2021-05-03 00:29:58,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:29:58,884 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_490 6) InVars {main_~b~0=v_main_~b~0_490} OutVars{main_~b~0=v_main_~b~0_490} AuxVars[] AssignedVars[] [2021-05-03 00:29:58,886 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:29:58,886 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:58,890 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:58,901 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:29:58,911 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 6 v_main_~b~0_492) (< v_main_~a~0_176 5)) InVars {main_~b~0=v_main_~b~0_492, main_~a~0=v_main_~a~0_176} OutVars{main_~b~0=v_main_~b~0_492, main_~a~0=v_main_~a~0_176} AuxVars[] AssignedVars[] [2021-05-03 00:29:58,913 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:29:58,923 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:58,926 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:29:58,933 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:29:58,951 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:29:58,952 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:58,959 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:29:58,968 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_184 6) InVars {main_~a~0=v_main_~a~0_184} OutVars{main_~a~0=v_main_~a~0_184} AuxVars[] AssignedVars[] [2021-05-03 00:29:58,970 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:29:58,970 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:29:58,975 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:29:58,991 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:29:59,003 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:29:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:59,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:29:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:29:59,048 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:29:59,050 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:29:59,301 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:29:59,301 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [795865727] [2021-05-03 00:29:59,301 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [795865727] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:29:59,301 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:29:59,301 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-03 00:29:59,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005473998] [2021-05-03 00:29:59,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-03 00:29:59,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:29:59,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-03 00:29:59,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:29:59,302 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:00,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:00,034 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2021-05-03 00:30:00,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:30:00,034 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2021-05-03 00:30:00,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:00,035 INFO L225 Difference]: With dead ends: 59 [2021-05-03 00:30:00,035 INFO L226 Difference]: Without dead ends: 52 [2021-05-03 00:30:00,035 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 697.0ms TimeCoverageRelationStatistics Valid=157, Invalid=1735, Unknown=0, NotChecked=0, Total=1892 [2021-05-03 00:30:00,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-05-03 00:30:00,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2021-05-03 00:30:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:00,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2021-05-03 00:30:00,045 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2021-05-03 00:30:00,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:00,045 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2021-05-03 00:30:00,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 23 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:00,045 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2021-05-03 00:30:00,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-05-03 00:30:00,045 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:00,045 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:00,045 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-03 00:30:00,046 INFO L428 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:00,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:00,046 INFO L82 PathProgramCache]: Analyzing trace with hash -833286102, now seen corresponding path program 18 times [2021-05-03 00:30:00,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:00,046 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1051741198] [2021-05-03 00:30:00,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:00,091 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_535 6) InVars {main_~b~0=v_main_~b~0_535} OutVars{main_~b~0=v_main_~b~0_535} AuxVars[] AssignedVars[] [2021-05-03 00:30:00,092 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:00,093 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:00,097 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:00,108 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:00,120 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 6 v_main_~b~0_537) (< v_main_~a~0_191 5)) InVars {main_~b~0=v_main_~b~0_537, main_~a~0=v_main_~a~0_191} OutVars{main_~b~0=v_main_~b~0_537, main_~a~0=v_main_~a~0_191} AuxVars[] AssignedVars[] [2021-05-03 00:30:00,122 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:00,122 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:00,125 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:00,142 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:00,163 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_197 6) InVars {main_~a~0=v_main_~a~0_197} OutVars{main_~a~0=v_main_~a~0_197} AuxVars[] AssignedVars[] [2021-05-03 00:30:00,165 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:00,176 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:00,181 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:00,189 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:00,200 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:30:00,201 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:00,208 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:30:00,213 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:30:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:00,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:00,297 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:30:00,299 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:00,316 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:00,401 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:00,514 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:00,620 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:00,620 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1051741198] [2021-05-03 00:30:00,620 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1051741198] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:00,620 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:00,620 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:30:00,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375072845] [2021-05-03 00:30:00,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:30:00,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:00,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:30:00,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:30:00,621 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 25 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:01,502 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2021-05-03 00:30:01,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:30:01,502 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2021-05-03 00:30:01,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:01,503 INFO L225 Difference]: With dead ends: 61 [2021-05-03 00:30:01,503 INFO L226 Difference]: Without dead ends: 54 [2021-05-03 00:30:01,504 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 841.4ms TimeCoverageRelationStatistics Valid=152, Invalid=1918, Unknown=0, NotChecked=0, Total=2070 [2021-05-03 00:30:01,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-05-03 00:30:01,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2021-05-03 00:30:01,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:01,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2021-05-03 00:30:01,513 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2021-05-03 00:30:01,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:01,513 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2021-05-03 00:30:01,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 1.88) internal successors, (47), 24 states have internal predecessors, (47), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:01,513 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2021-05-03 00:30:01,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-03 00:30:01,514 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:01,514 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:01,514 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-03 00:30:01,514 INFO L428 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:01,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:01,514 INFO L82 PathProgramCache]: Analyzing trace with hash -256347768, now seen corresponding path program 19 times [2021-05-03 00:30:01,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:01,514 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1768729709] [2021-05-03 00:30:01,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:01,558 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_583 6) InVars {main_~b~0=v_main_~b~0_583} OutVars{main_~b~0=v_main_~b~0_583} AuxVars[] AssignedVars[] [2021-05-03 00:30:01,559 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:01,566 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:01,570 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:01,576 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:01,587 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 6 v_main_~b~0_585) (< v_main_~a~0_206 5)) InVars {main_~b~0=v_main_~b~0_585, main_~a~0=v_main_~a~0_206} OutVars{main_~b~0=v_main_~b~0_585, main_~a~0=v_main_~a~0_206} AuxVars[] AssignedVars[] [2021-05-03 00:30:01,588 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:01,589 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:01,591 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:01,608 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:01,627 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_212 6) InVars {main_~a~0=v_main_~a~0_212} OutVars{main_~a~0=v_main_~a~0_212} AuxVars[] AssignedVars[] [2021-05-03 00:30:01,629 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:01,629 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:01,634 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:01,650 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:01,661 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:30:01,662 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:01,669 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:30:01,676 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:30:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:01,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:01,730 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:30:01,731 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:01,748 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:01,844 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:01,949 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:02,097 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:02,098 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1768729709] [2021-05-03 00:30:02,098 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1768729709] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:02,098 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:02,098 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:30:02,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549181451] [2021-05-03 00:30:02,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:30:02,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:02,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:30:02,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:30:02,099 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:03,126 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2021-05-03 00:30:03,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:30:03,127 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2021-05-03 00:30:03,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:03,127 INFO L225 Difference]: With dead ends: 65 [2021-05-03 00:30:03,127 INFO L226 Difference]: Without dead ends: 58 [2021-05-03 00:30:03,128 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 20 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 924.8ms TimeCoverageRelationStatistics Valid=158, Invalid=2098, Unknown=0, NotChecked=0, Total=2256 [2021-05-03 00:30:03,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-05-03 00:30:03,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2021-05-03 00:30:03,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 53 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2021-05-03 00:30:03,137 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2021-05-03 00:30:03,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:03,137 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2021-05-03 00:30:03,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 25 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:03,137 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2021-05-03 00:30:03,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-05-03 00:30:03,138 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:03,138 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:03,138 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-03 00:30:03,138 INFO L428 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:03,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:03,138 INFO L82 PathProgramCache]: Analyzing trace with hash 130610022, now seen corresponding path program 20 times [2021-05-03 00:30:03,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:03,138 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [440253739] [2021-05-03 00:30:03,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:03,181 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_633 6) InVars {main_~b~0=v_main_~b~0_633} OutVars{main_~b~0=v_main_~b~0_633} AuxVars[] AssignedVars[] [2021-05-03 00:30:03,182 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:03,183 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:03,188 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:03,200 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:03,211 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 6 v_main_~b~0_635) (< v_main_~a~0_221 5)) InVars {main_~b~0=v_main_~b~0_635, main_~a~0=v_main_~a~0_221} OutVars{main_~b~0=v_main_~b~0_635, main_~a~0=v_main_~a~0_221} AuxVars[] AssignedVars[] [2021-05-03 00:30:03,212 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:03,223 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:03,226 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:03,235 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:03,260 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_227 6) InVars {main_~a~0=v_main_~a~0_227} OutVars{main_~a~0=v_main_~a~0_227} AuxVars[] AssignedVars[] [2021-05-03 00:30:03,262 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:03,273 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:03,277 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:03,290 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:03,303 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:30:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:03,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:03,346 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:30:03,653 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:03,653 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [440253739] [2021-05-03 00:30:03,653 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [440253739] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:03,653 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:03,653 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:30:03,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653784485] [2021-05-03 00:30:03,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:30:03,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:03,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:30:03,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:30:03,654 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:04,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:04,529 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2021-05-03 00:30:04,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:30:04,529 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2021-05-03 00:30:04,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:04,530 INFO L225 Difference]: With dead ends: 62 [2021-05-03 00:30:04,530 INFO L226 Difference]: Without dead ends: 59 [2021-05-03 00:30:04,530 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 831.9ms TimeCoverageRelationStatistics Valid=196, Invalid=2354, Unknown=0, NotChecked=0, Total=2550 [2021-05-03 00:30:04,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-03 00:30:04,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-05-03 00:30:04,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:04,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2021-05-03 00:30:04,540 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2021-05-03 00:30:04,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:04,540 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2021-05-03 00:30:04,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 26 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:04,540 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2021-05-03 00:30:04,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-05-03 00:30:04,540 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:04,540 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:04,540 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-03 00:30:04,541 INFO L428 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:04,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:04,541 INFO L82 PathProgramCache]: Analyzing trace with hash -193070689, now seen corresponding path program 21 times [2021-05-03 00:30:04,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:04,541 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1728915375] [2021-05-03 00:30:04,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:04,583 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_676 6) InVars {main_~b~0=v_main_~b~0_676} OutVars{main_~b~0=v_main_~b~0_676} AuxVars[] AssignedVars[] [2021-05-03 00:30:04,584 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:04,585 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:04,589 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:04,601 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:04,613 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 6 v_main_~b~0_678) (< v_main_~a~0_233 5)) InVars {main_~b~0=v_main_~b~0_678, main_~a~0=v_main_~a~0_233} OutVars{main_~b~0=v_main_~b~0_678, main_~a~0=v_main_~a~0_233} AuxVars[] AssignedVars[] [2021-05-03 00:30:04,614 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:04,615 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:04,617 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:04,635 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:04,661 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:30:04,662 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:04,668 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-05-03 00:30:04,674 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_241 6) InVars {main_~a~0=v_main_~a~0_241} OutVars{main_~a~0=v_main_~a~0_241} AuxVars[] AssignedVars[] [2021-05-03 00:30:04,675 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:04,686 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:04,691 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:04,699 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:04,711 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:30:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:04,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:30:04,753 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:05,098 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:05,098 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1728915375] [2021-05-03 00:30:05,098 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1728915375] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:05,098 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:05,098 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:30:05,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129768825] [2021-05-03 00:30:05,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:30:05,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:05,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:30:05,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:30:05,099 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:06,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:06,058 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2021-05-03 00:30:06,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:30:06,058 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2021-05-03 00:30:06,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:06,059 INFO L225 Difference]: With dead ends: 68 [2021-05-03 00:30:06,059 INFO L226 Difference]: Without dead ends: 61 [2021-05-03 00:30:06,060 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 918.5ms TimeCoverageRelationStatistics Valid=183, Invalid=2469, Unknown=0, NotChecked=0, Total=2652 [2021-05-03 00:30:06,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-03 00:30:06,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2021-05-03 00:30:06,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2021-05-03 00:30:06,080 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 57 [2021-05-03 00:30:06,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:06,080 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2021-05-03 00:30:06,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2021-05-03 00:30:06,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-05-03 00:30:06,081 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:06,081 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:06,081 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-03 00:30:06,081 INFO L428 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:06,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:06,081 INFO L82 PathProgramCache]: Analyzing trace with hash 810340797, now seen corresponding path program 22 times [2021-05-03 00:30:06,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:06,081 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [760291051] [2021-05-03 00:30:06,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:06,132 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_722 6) InVars {main_~b~0=v_main_~b~0_722} OutVars{main_~b~0=v_main_~b~0_722} AuxVars[] AssignedVars[] [2021-05-03 00:30:06,133 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:06,140 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:06,144 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:06,149 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:06,158 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~a~0_249 5) (<= 6 v_main_~b~0_724)) InVars {main_~b~0=v_main_~b~0_724, main_~a~0=v_main_~a~0_249} OutVars{main_~b~0=v_main_~b~0_724, main_~a~0=v_main_~a~0_249} AuxVars[] AssignedVars[] [2021-05-03 00:30:06,179 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:06,190 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:06,192 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:06,199 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:06,219 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_255 6) InVars {main_~a~0=v_main_~a~0_255} OutVars{main_~a~0=v_main_~a~0_255} AuxVars[] AssignedVars[] [2021-05-03 00:30:06,222 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:06,227 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:06,232 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:06,248 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:06,260 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:30:06,279 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:06,286 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:30:06,291 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:30:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:06,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:06,348 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:30:06,795 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:06,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [760291051] [2021-05-03 00:30:06,795 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [760291051] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:06,795 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:06,795 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:30:06,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807954561] [2021-05-03 00:30:06,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:30:06,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:06,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:30:06,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:30:06,797 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 29 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 28 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:07,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:07,804 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2021-05-03 00:30:07,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:30:07,805 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 28 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2021-05-03 00:30:07,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:07,805 INFO L225 Difference]: With dead ends: 70 [2021-05-03 00:30:07,805 INFO L226 Difference]: Without dead ends: 63 [2021-05-03 00:30:07,809 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 21 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 1017.1ms TimeCoverageRelationStatistics Valid=208, Invalid=2762, Unknown=0, NotChecked=0, Total=2970 [2021-05-03 00:30:07,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-03 00:30:07,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2021-05-03 00:30:07,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:07,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2021-05-03 00:30:07,819 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 59 [2021-05-03 00:30:07,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:07,819 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2021-05-03 00:30:07,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 28 states have internal predecessors, (56), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:07,819 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2021-05-03 00:30:07,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:30:07,820 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:07,820 INFO L523 BasicCegarLoop]: trace histogram [20, 20, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:07,820 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-03 00:30:07,820 INFO L428 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:07,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:07,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1278862757, now seen corresponding path program 23 times [2021-05-03 00:30:07,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:07,820 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [342236977] [2021-05-03 00:30:07,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:07,866 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_771 6) InVars {main_~b~0=v_main_~b~0_771} OutVars{main_~b~0=v_main_~b~0_771} AuxVars[] AssignedVars[] [2021-05-03 00:30:07,881 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:07,888 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:07,892 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:07,898 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:07,909 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 6 v_main_~b~0_773) (< v_main_~a~0_265 5)) InVars {main_~b~0=v_main_~b~0_773, main_~a~0=v_main_~a~0_265} OutVars{main_~b~0=v_main_~b~0_773, main_~a~0=v_main_~a~0_265} AuxVars[] AssignedVars[] [2021-05-03 00:30:07,910 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:07,922 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:07,924 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:07,933 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:07,952 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:30:07,952 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:07,960 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:30:07,975 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_273 6) InVars {main_~a~0=v_main_~a~0_273} OutVars{main_~a~0=v_main_~a~0_273} AuxVars[] AssignedVars[] [2021-05-03 00:30:07,976 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:07,977 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:07,982 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:08,000 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:08,013 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:30:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:08,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:08,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:30:08,100 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:08,571 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:08,571 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [342236977] [2021-05-03 00:30:08,571 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [342236977] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:08,572 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:08,572 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:30:08,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693795863] [2021-05-03 00:30:08,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:30:08,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:08,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:30:08,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=852, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:30:08,574 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 29 states have internal predecessors, (58), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:09,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:09,686 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2021-05-03 00:30:09,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:30:09,686 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 29 states have internal predecessors, (58), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2021-05-03 00:30:09,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:09,687 INFO L225 Difference]: With dead ends: 72 [2021-05-03 00:30:09,687 INFO L226 Difference]: Without dead ends: 65 [2021-05-03 00:30:09,688 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 1094.4ms TimeCoverageRelationStatistics Valid=195, Invalid=2885, Unknown=0, NotChecked=0, Total=3080 [2021-05-03 00:30:09,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-05-03 00:30:09,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2021-05-03 00:30:09,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2021-05-03 00:30:09,697 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 61 [2021-05-03 00:30:09,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:09,697 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2021-05-03 00:30:09,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 29 states have internal predecessors, (58), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:09,697 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2021-05-03 00:30:09,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-05-03 00:30:09,697 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:09,697 INFO L523 BasicCegarLoop]: trace histogram [21, 21, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:09,697 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-03 00:30:09,697 INFO L428 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:09,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:09,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1041216377, now seen corresponding path program 24 times [2021-05-03 00:30:09,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:09,698 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1865674186] [2021-05-03 00:30:09,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:09,737 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_821 6) InVars {main_~b~0=v_main_~b~0_821} OutVars{main_~b~0=v_main_~b~0_821} AuxVars[] AssignedVars[] [2021-05-03 00:30:09,738 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:09,745 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:09,749 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:09,754 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:09,765 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~a~0_281 5) (<= 6 v_main_~b~0_823)) InVars {main_~b~0=v_main_~b~0_823, main_~a~0=v_main_~a~0_281} OutVars{main_~b~0=v_main_~b~0_823, main_~a~0=v_main_~a~0_281} AuxVars[] AssignedVars[] [2021-05-03 00:30:09,766 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:09,779 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:09,782 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:09,791 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:09,812 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:30:09,813 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:09,822 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:30:09,830 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_289 6) InVars {main_~a~0=v_main_~a~0_289} OutVars{main_~a~0=v_main_~a~0_289} AuxVars[] AssignedVars[] [2021-05-03 00:30:09,831 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:09,832 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:09,836 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:09,853 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:09,864 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:30:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:09,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:09,902 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:30:09,903 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:10,304 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:10,304 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1865674186] [2021-05-03 00:30:10,304 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1865674186] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:10,304 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:10,304 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:30:10,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016056760] [2021-05-03 00:30:10,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:30:10,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:10,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:30:10,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=912, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:30:10,305 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 30 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:11,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:11,484 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2021-05-03 00:30:11,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:30:11,485 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 30 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2021-05-03 00:30:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:11,485 INFO L225 Difference]: With dead ends: 74 [2021-05-03 00:30:11,485 INFO L226 Difference]: Without dead ends: 67 [2021-05-03 00:30:11,486 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1093.6ms TimeCoverageRelationStatistics Valid=201, Invalid=3105, Unknown=0, NotChecked=0, Total=3306 [2021-05-03 00:30:11,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-03 00:30:11,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2021-05-03 00:30:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2021-05-03 00:30:11,495 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 63 [2021-05-03 00:30:11,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:11,495 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2021-05-03 00:30:11,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 30 states have internal predecessors, (60), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:11,495 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2021-05-03 00:30:11,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-03 00:30:11,496 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:11,496 INFO L523 BasicCegarLoop]: trace histogram [22, 22, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:11,496 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-05-03 00:30:11,496 INFO L428 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:11,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:11,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1549237527, now seen corresponding path program 25 times [2021-05-03 00:30:11,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:11,496 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1126349778] [2021-05-03 00:30:11,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:11,537 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_873 6) InVars {main_~b~0=v_main_~b~0_873} OutVars{main_~b~0=v_main_~b~0_873} AuxVars[] AssignedVars[] [2021-05-03 00:30:11,538 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:11,538 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:11,542 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:11,552 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:11,562 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~a~0_297 5) (<= 6 v_main_~b~0_875)) InVars {main_~b~0=v_main_~b~0_875, main_~a~0=v_main_~a~0_297} OutVars{main_~b~0=v_main_~b~0_875, main_~a~0=v_main_~a~0_297} AuxVars[] AssignedVars[] [2021-05-03 00:30:11,563 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:11,563 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:11,565 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:11,580 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:11,601 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_303 6) InVars {main_~a~0=v_main_~a~0_303} OutVars{main_~a~0=v_main_~a~0_303} AuxVars[] AssignedVars[] [2021-05-03 00:30:11,602 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:11,603 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:11,607 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:11,622 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:11,633 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:30:11,634 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:11,640 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:30:11,645 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:30:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:11,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:11,697 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:30:11,699 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:11,714 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:11,790 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:11,917 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:12,133 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:12,300 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:12,301 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1126349778] [2021-05-03 00:30:12,301 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1126349778] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:12,301 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:12,301 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:30:12,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163776665] [2021-05-03 00:30:12,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:30:12,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:12,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:30:12,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=962, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:30:12,302 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand has 32 states, 32 states have (on average 1.9375) internal successors, (62), 31 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:13,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:13,779 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2021-05-03 00:30:13,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:30:13,779 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.9375) internal successors, (62), 31 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2021-05-03 00:30:13,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:13,780 INFO L225 Difference]: With dead ends: 76 [2021-05-03 00:30:13,780 INFO L226 Difference]: Without dead ends: 69 [2021-05-03 00:30:13,781 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 1467.2ms TimeCoverageRelationStatistics Valid=230, Invalid=3310, Unknown=0, NotChecked=0, Total=3540 [2021-05-03 00:30:13,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-05-03 00:30:13,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2021-05-03 00:30:13,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.03125) internal successors, (66), 64 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2021-05-03 00:30:13,790 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 65 [2021-05-03 00:30:13,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:13,790 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2021-05-03 00:30:13,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 1.9375) internal successors, (62), 31 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:13,791 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2021-05-03 00:30:13,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:30:13,791 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:13,791 INFO L523 BasicCegarLoop]: trace histogram [23, 23, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:13,791 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-03 00:30:13,791 INFO L428 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:13,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:13,791 INFO L82 PathProgramCache]: Analyzing trace with hash 131290933, now seen corresponding path program 26 times [2021-05-03 00:30:13,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:13,792 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1455426792] [2021-05-03 00:30:13,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:13,832 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_928 6) InVars {main_~b~0=v_main_~b~0_928} OutVars{main_~b~0=v_main_~b~0_928} AuxVars[] AssignedVars[] [2021-05-03 00:30:13,833 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:13,839 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:13,842 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:13,847 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:13,858 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~a~0_313 5) (<= 6 v_main_~b~0_930)) InVars {main_~b~0=v_main_~b~0_930, main_~a~0=v_main_~a~0_313} OutVars{main_~b~0=v_main_~b~0_930, main_~a~0=v_main_~a~0_313} AuxVars[] AssignedVars[] [2021-05-03 00:30:13,861 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:13,862 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:13,864 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:13,879 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:13,897 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_319 6) InVars {main_~a~0=v_main_~a~0_319} OutVars{main_~a~0=v_main_~a~0_319} AuxVars[] AssignedVars[] [2021-05-03 00:30:13,898 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:13,907 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:13,912 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:13,919 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:13,931 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:30:13,931 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:13,937 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:30:13,942 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:30:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:13,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:14,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:30:14,001 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:14,017 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:14,094 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:14,213 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:14,383 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:14,550 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:14,551 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1455426792] [2021-05-03 00:30:14,551 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1455426792] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:14,551 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:14,551 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:30:14,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563161497] [2021-05-03 00:30:14,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:30:14,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:14,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:30:14,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1043, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:30:14,553 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 33 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 32 states have internal predecessors, (64), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:16,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:16,087 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2021-05-03 00:30:16,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:30:16,088 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 32 states have internal predecessors, (64), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2021-05-03 00:30:16,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:16,088 INFO L225 Difference]: With dead ends: 80 [2021-05-03 00:30:16,088 INFO L226 Difference]: Without dead ends: 73 [2021-05-03 00:30:16,089 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 1364.5ms TimeCoverageRelationStatistics Valid=202, Invalid=3580, Unknown=0, NotChecked=0, Total=3782 [2021-05-03 00:30:16,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-03 00:30:16,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2021-05-03 00:30:16,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:16,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2021-05-03 00:30:16,100 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 67 [2021-05-03 00:30:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:16,100 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2021-05-03 00:30:16,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 32 states have internal predecessors, (64), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:16,100 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2021-05-03 00:30:16,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-05-03 00:30:16,100 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:16,100 INFO L523 BasicCegarLoop]: trace histogram [24, 24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:16,100 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-05-03 00:30:16,100 INFO L428 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:16,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:16,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1010753069, now seen corresponding path program 27 times [2021-05-03 00:30:16,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:16,101 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [516062827] [2021-05-03 00:30:16,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:16,140 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_985 6) InVars {main_~b~0=v_main_~b~0_985} OutVars{main_~b~0=v_main_~b~0_985} AuxVars[] AssignedVars[] [2021-05-03 00:30:16,141 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:16,146 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:16,150 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:16,155 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:16,164 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 6 v_main_~b~0_987) (< v_main_~a~0_329 5)) InVars {main_~b~0=v_main_~b~0_987, main_~a~0=v_main_~a~0_329} OutVars{main_~b~0=v_main_~b~0_987, main_~a~0=v_main_~a~0_329} AuxVars[] AssignedVars[] [2021-05-03 00:30:16,165 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:16,166 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:16,167 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:16,182 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:16,199 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_335 6) InVars {main_~a~0=v_main_~a~0_335} OutVars{main_~a~0=v_main_~a~0_335} AuxVars[] AssignedVars[] [2021-05-03 00:30:16,200 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:16,209 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:16,213 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:16,221 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:16,232 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:30:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:16,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:16,267 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:30:16,879 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:16,879 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [516062827] [2021-05-03 00:30:16,879 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [516062827] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:16,879 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:16,879 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-03 00:30:16,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753877384] [2021-05-03 00:30:16,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-03 00:30:16,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:16,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-03 00:30:16,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1161, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:30:16,880 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 34 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 33 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:18,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:18,319 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2021-05-03 00:30:18,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:30:18,319 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 33 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2021-05-03 00:30:18,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:18,320 INFO L225 Difference]: With dead ends: 77 [2021-05-03 00:30:18,320 INFO L226 Difference]: Without dead ends: 74 [2021-05-03 00:30:18,321 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 24 SyntacticMatches, 11 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 1422.8ms TimeCoverageRelationStatistics Valid=240, Invalid=3920, Unknown=0, NotChecked=0, Total=4160 [2021-05-03 00:30:18,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-05-03 00:30:18,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-05-03 00:30:18,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2021-05-03 00:30:18,331 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 69 [2021-05-03 00:30:18,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:18,331 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2021-05-03 00:30:18,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 33 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:18,331 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2021-05-03 00:30:18,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-05-03 00:30:18,332 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:18,332 INFO L523 BasicCegarLoop]: trace histogram [24, 24, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:18,332 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-05-03 00:30:18,332 INFO L428 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:18,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:18,332 INFO L82 PathProgramCache]: Analyzing trace with hash 715167762, now seen corresponding path program 28 times [2021-05-03 00:30:18,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:18,332 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [883606414] [2021-05-03 00:30:18,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:18,372 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_1035 6) InVars {main_~b~0=v_main_~b~0_1035} OutVars{main_~b~0=v_main_~b~0_1035} AuxVars[] AssignedVars[] [2021-05-03 00:30:18,373 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:18,378 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:18,382 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:18,387 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:18,396 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~a~0_342 5) (<= 6 v_main_~b~0_1037)) InVars {main_~b~0=v_main_~b~0_1037, main_~a~0=v_main_~a~0_342} OutVars{main_~b~0=v_main_~b~0_1037, main_~a~0=v_main_~a~0_342} AuxVars[] AssignedVars[] [2021-05-03 00:30:18,397 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:18,398 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:18,400 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:18,415 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:18,432 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:30:18,432 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:18,437 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-05-03 00:30:18,442 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_350 6) InVars {main_~a~0=v_main_~a~0_350} OutVars{main_~a~0=v_main_~a~0_350} AuxVars[] AssignedVars[] [2021-05-03 00:30:18,443 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:18,444 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:18,448 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:18,463 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:18,475 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:30:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:18,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:18,512 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:30:18,513 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:19,113 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:19,113 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [883606414] [2021-05-03 00:30:19,113 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [883606414] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:19,113 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:19,113 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-03 00:30:19,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852267052] [2021-05-03 00:30:19,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-03 00:30:19,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:19,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-03 00:30:19,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1171, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:30:19,114 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:20,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:20,640 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2021-05-03 00:30:20,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-03 00:30:20,640 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2021-05-03 00:30:20,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:20,641 INFO L225 Difference]: With dead ends: 83 [2021-05-03 00:30:20,641 INFO L226 Difference]: Without dead ends: 76 [2021-05-03 00:30:20,642 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 30 SyntacticMatches, 9 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 1464.8ms TimeCoverageRelationStatistics Valid=227, Invalid=4063, Unknown=0, NotChecked=0, Total=4290 [2021-05-03 00:30:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-05-03 00:30:20,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2021-05-03 00:30:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2021-05-03 00:30:20,653 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2021-05-03 00:30:20,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:20,653 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2021-05-03 00:30:20,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:20,653 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2021-05-03 00:30:20,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-03 00:30:20,653 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:20,653 INFO L523 BasicCegarLoop]: trace histogram [25, 25, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:20,653 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-05-03 00:30:20,653 INFO L428 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:20,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:20,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1749131120, now seen corresponding path program 29 times [2021-05-03 00:30:20,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:20,654 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [287238980] [2021-05-03 00:30:20,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:20,695 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_1088 6) InVars {main_~b~0=v_main_~b~0_1088} OutVars{main_~b~0=v_main_~b~0_1088} AuxVars[] AssignedVars[] [2021-05-03 00:30:20,695 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:20,701 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:20,705 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:20,710 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:20,720 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 6 v_main_~b~0_1090) (< v_main_~a~0_359 5)) InVars {main_~b~0=v_main_~b~0_1090, main_~a~0=v_main_~a~0_359} OutVars{main_~b~0=v_main_~b~0_1090, main_~a~0=v_main_~a~0_359} AuxVars[] AssignedVars[] [2021-05-03 00:30:20,721 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:20,730 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:20,732 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:20,739 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:20,757 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_365 6) InVars {main_~a~0=v_main_~a~0_365} OutVars{main_~a~0=v_main_~a~0_365} AuxVars[] AssignedVars[] [2021-05-03 00:30:20,758 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:20,767 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:20,771 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:20,778 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:20,790 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:30:20,791 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:20,797 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:30:20,802 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:30:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:20,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:20,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:30:21,442 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:21,442 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [287238980] [2021-05-03 00:30:21,442 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [287238980] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:21,442 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:21,442 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-03 00:30:21,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227907686] [2021-05-03 00:30:21,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-03 00:30:21,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:21,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-03 00:30:21,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1303, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:30:21,444 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:23,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:23,028 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2021-05-03 00:30:23,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-03 00:30:23,029 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2021-05-03 00:30:23,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:23,029 INFO L225 Difference]: With dead ends: 85 [2021-05-03 00:30:23,030 INFO L226 Difference]: Without dead ends: 78 [2021-05-03 00:30:23,030 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 1488.0ms TimeCoverageRelationStatistics Valid=252, Invalid=4440, Unknown=0, NotChecked=0, Total=4692 [2021-05-03 00:30:23,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-05-03 00:30:23,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2021-05-03 00:30:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:23,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2021-05-03 00:30:23,041 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2021-05-03 00:30:23,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:23,041 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2021-05-03 00:30:23,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2021-05-03 00:30:23,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-03 00:30:23,042 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:23,042 INFO L523 BasicCegarLoop]: trace histogram [26, 26, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:23,042 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-03 00:30:23,042 INFO L428 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:23,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:23,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1044494514, now seen corresponding path program 30 times [2021-05-03 00:30:23,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:23,042 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1968595757] [2021-05-03 00:30:23,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:23,082 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_1144 6) InVars {main_~b~0=v_main_~b~0_1144} OutVars{main_~b~0=v_main_~b~0_1144} AuxVars[] AssignedVars[] [2021-05-03 00:30:23,083 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:23,083 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:23,087 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:23,096 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:23,106 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~a~0_376 5) (<= 6 v_main_~b~0_1146)) InVars {main_~b~0=v_main_~b~0_1146, main_~a~0=v_main_~a~0_376} OutVars{main_~b~0=v_main_~b~0_1146, main_~a~0=v_main_~a~0_376} AuxVars[] AssignedVars[] [2021-05-03 00:30:23,107 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:23,116 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:23,118 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:23,125 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:23,142 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:30:23,143 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:23,149 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:30:23,156 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_384 6) InVars {main_~a~0=v_main_~a~0_384} OutVars{main_~a~0=v_main_~a~0_384} AuxVars[] AssignedVars[] [2021-05-03 00:30:23,156 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:23,157 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:23,161 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:23,176 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:23,188 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:30:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:23,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:23,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:30:23,227 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:23,903 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:23,903 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1968595757] [2021-05-03 00:30:23,903 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1968595757] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:23,903 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:23,903 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-03 00:30:23,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055316864] [2021-05-03 00:30:23,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-03 00:30:23,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:23,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-03 00:30:23,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1313, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:30:23,904 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:25,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:25,578 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2021-05-03 00:30:25,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-03 00:30:25,579 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2021-05-03 00:30:25,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:25,579 INFO L225 Difference]: With dead ends: 87 [2021-05-03 00:30:25,579 INFO L226 Difference]: Without dead ends: 80 [2021-05-03 00:30:25,580 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 30 SyntacticMatches, 11 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1143 ImplicationChecksByTransitivity, 1619.1ms TimeCoverageRelationStatistics Valid=239, Invalid=4591, Unknown=0, NotChecked=0, Total=4830 [2021-05-03 00:30:25,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-05-03 00:30:25,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2021-05-03 00:30:25,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 75 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2021-05-03 00:30:25,591 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2021-05-03 00:30:25,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:25,592 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2021-05-03 00:30:25,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:25,592 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2021-05-03 00:30:25,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-05-03 00:30:25,592 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:25,592 INFO L523 BasicCegarLoop]: trace histogram [27, 27, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:25,592 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-05-03 00:30:25,592 INFO L428 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:25,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:25,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1364168788, now seen corresponding path program 31 times [2021-05-03 00:30:25,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:25,593 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1149933206] [2021-05-03 00:30:25,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:25,632 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_1201 6) InVars {main_~b~0=v_main_~b~0_1201} OutVars{main_~b~0=v_main_~b~0_1201} AuxVars[] AssignedVars[] [2021-05-03 00:30:25,633 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:25,639 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:25,642 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:25,647 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:25,657 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~a~0_393 5) (<= 6 v_main_~b~0_1203)) InVars {main_~b~0=v_main_~b~0_1203, main_~a~0=v_main_~a~0_393} OutVars{main_~b~0=v_main_~b~0_1203, main_~a~0=v_main_~a~0_393} AuxVars[] AssignedVars[] [2021-05-03 00:30:25,658 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:25,667 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:25,669 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:25,676 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:25,692 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:30:25,693 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:25,699 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:30:25,705 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_401 6) InVars {main_~a~0=v_main_~a~0_401} OutVars{main_~a~0=v_main_~a~0_401} AuxVars[] AssignedVars[] [2021-05-03 00:30:25,706 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:25,707 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:25,711 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:25,726 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:25,743 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:30:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:25,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:25,778 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:30:25,779 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:26,415 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:26,415 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1149933206] [2021-05-03 00:30:26,415 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1149933206] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:26,415 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:26,415 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-03 00:30:26,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828953194] [2021-05-03 00:30:26,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-03 00:30:26,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:26,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-03 00:30:26,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1387, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:30:26,416 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:28,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:28,172 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2021-05-03 00:30:28,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-03 00:30:28,173 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2021-05-03 00:30:28,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:28,173 INFO L225 Difference]: With dead ends: 89 [2021-05-03 00:30:28,173 INFO L226 Difference]: Without dead ends: 82 [2021-05-03 00:30:28,174 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 35 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 1619.3ms TimeCoverageRelationStatistics Valid=245, Invalid=4867, Unknown=0, NotChecked=0, Total=5112 [2021-05-03 00:30:28,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-05-03 00:30:28,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2021-05-03 00:30:28,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:28,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2021-05-03 00:30:28,185 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2021-05-03 00:30:28,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:28,186 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2021-05-03 00:30:28,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:28,186 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2021-05-03 00:30:28,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-05-03 00:30:28,186 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:28,186 INFO L523 BasicCegarLoop]: trace histogram [28, 28, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:28,186 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-03 00:30:28,186 INFO L428 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:28,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:28,187 INFO L82 PathProgramCache]: Analyzing trace with hash 666499210, now seen corresponding path program 32 times [2021-05-03 00:30:28,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:28,187 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1858430677] [2021-05-03 00:30:28,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:28,226 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_1260 6) InVars {main_~b~0=v_main_~b~0_1260} OutVars{main_~b~0=v_main_~b~0_1260} AuxVars[] AssignedVars[] [2021-05-03 00:30:28,227 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:28,227 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:28,231 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:28,240 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:28,249 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 6 v_main_~b~0_1262) (< v_main_~a~0_410 5)) InVars {main_~b~0=v_main_~b~0_1262, main_~a~0=v_main_~a~0_410} OutVars{main_~b~0=v_main_~b~0_1262, main_~a~0=v_main_~a~0_410} AuxVars[] AssignedVars[] [2021-05-03 00:30:28,250 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:28,260 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:28,262 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:28,269 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:28,287 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_416 6) InVars {main_~a~0=v_main_~a~0_416} OutVars{main_~a~0=v_main_~a~0_416} AuxVars[] AssignedVars[] [2021-05-03 00:30:28,288 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:28,297 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:28,301 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:28,308 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:28,320 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:30:28,320 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:28,327 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:30:28,332 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:30:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:28,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:28,384 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:30:28,385 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:28,399 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:28,485 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:28,613 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:28,782 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:29,004 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:29,182 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:29,183 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1858430677] [2021-05-03 00:30:29,183 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1858430677] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:29,183 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:29,183 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-03 00:30:29,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140569047] [2021-05-03 00:30:29,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-03 00:30:29,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:29,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-03 00:30:29,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1468, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:30:29,184 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:31,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:31,247 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2021-05-03 00:30:31,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-03 00:30:31,247 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2021-05-03 00:30:31,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:31,248 INFO L225 Difference]: With dead ends: 91 [2021-05-03 00:30:31,248 INFO L226 Difference]: Without dead ends: 84 [2021-05-03 00:30:31,249 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 31 SyntacticMatches, 12 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 1887.9ms TimeCoverageRelationStatistics Valid=240, Invalid=5162, Unknown=0, NotChecked=0, Total=5402 [2021-05-03 00:30:31,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-05-03 00:30:31,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2021-05-03 00:30:31,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:31,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2021-05-03 00:30:31,261 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2021-05-03 00:30:31,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:31,261 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2021-05-03 00:30:31,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:31,262 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2021-05-03 00:30:31,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-05-03 00:30:31,262 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:31,262 INFO L523 BasicCegarLoop]: trace histogram [29, 29, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:31,262 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-05-03 00:30:31,262 INFO L428 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:31,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:31,262 INFO L82 PathProgramCache]: Analyzing trace with hash -2071674392, now seen corresponding path program 33 times [2021-05-03 00:30:31,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:31,263 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [929688844] [2021-05-03 00:30:31,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:31,303 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_1322 6) InVars {main_~b~0=v_main_~b~0_1322} OutVars{main_~b~0=v_main_~b~0_1322} AuxVars[] AssignedVars[] [2021-05-03 00:30:31,304 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:31,304 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:31,308 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:31,318 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:31,328 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 6 v_main_~b~0_1324) (< v_main_~a~0_427 5)) InVars {main_~b~0=v_main_~b~0_1324, main_~a~0=v_main_~a~0_427} OutVars{main_~b~0=v_main_~b~0_1324, main_~a~0=v_main_~a~0_427} AuxVars[] AssignedVars[] [2021-05-03 00:30:31,328 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:31,329 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:31,331 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:31,351 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:31,369 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_433 6) InVars {main_~a~0=v_main_~a~0_433} OutVars{main_~a~0=v_main_~a~0_433} AuxVars[] AssignedVars[] [2021-05-03 00:30:31,370 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:31,379 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:31,382 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:31,390 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:31,401 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:30:31,402 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:31,408 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:30:31,413 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:30:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:31,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:31,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:30:32,279 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:32,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [929688844] [2021-05-03 00:30:32,279 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [929688844] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:32,279 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:32,279 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-03 00:30:32,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133484005] [2021-05-03 00:30:32,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-03 00:30:32,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:32,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-03 00:30:32,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1654, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:30:32,281 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:33,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:33,956 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2021-05-03 00:30:33,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-03 00:30:33,956 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2021-05-03 00:30:33,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:33,957 INFO L225 Difference]: With dead ends: 95 [2021-05-03 00:30:33,957 INFO L226 Difference]: Without dead ends: 88 [2021-05-03 00:30:33,957 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 32 SyntacticMatches, 10 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 1750.6ms TimeCoverageRelationStatistics Valid=352, Invalid=5654, Unknown=0, NotChecked=0, Total=6006 [2021-05-03 00:30:33,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-05-03 00:30:33,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2021-05-03 00:30:33,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 83 states have internal predecessors, (85), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:33,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2021-05-03 00:30:33,970 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2021-05-03 00:30:33,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:33,971 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2021-05-03 00:30:33,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:33,971 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2021-05-03 00:30:33,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-05-03 00:30:33,971 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:33,971 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:33,971 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-05-03 00:30:33,971 INFO L428 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:33,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:33,972 INFO L82 PathProgramCache]: Analyzing trace with hash -641553466, now seen corresponding path program 34 times [2021-05-03 00:30:33,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:33,972 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1722610568] [2021-05-03 00:30:33,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:34,026 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_1386 6) InVars {main_~b~0=v_main_~b~0_1386} OutVars{main_~b~0=v_main_~b~0_1386} AuxVars[] AssignedVars[] [2021-05-03 00:30:34,027 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:34,028 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:34,031 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:34,039 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:34,047 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~a~0_444 5) (<= 6 v_main_~b~0_1388)) InVars {main_~b~0=v_main_~b~0_1388, main_~a~0=v_main_~a~0_444} OutVars{main_~b~0=v_main_~b~0_1388, main_~a~0=v_main_~a~0_444} AuxVars[] AssignedVars[] [2021-05-03 00:30:34,050 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:34,051 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:34,052 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:34,064 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:34,105 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_450 6) InVars {main_~a~0=v_main_~a~0_450} OutVars{main_~a~0=v_main_~a~0_450} AuxVars[] AssignedVars[] [2021-05-03 00:30:34,106 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:34,107 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:34,110 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:34,125 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:34,135 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:30:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:34,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:34,170 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:30:34,829 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:34,830 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1722610568] [2021-05-03 00:30:34,830 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1722610568] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:34,830 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:34,830 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-05-03 00:30:34,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72070165] [2021-05-03 00:30:34,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-05-03 00:30:34,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:34,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-05-03 00:30:34,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1692, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:30:34,831 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:36,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:36,625 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2021-05-03 00:30:36,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-03 00:30:36,626 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2021-05-03 00:30:36,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:36,626 INFO L225 Difference]: With dead ends: 92 [2021-05-03 00:30:36,626 INFO L226 Difference]: Without dead ends: 89 [2021-05-03 00:30:36,627 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 29 SyntacticMatches, 14 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1553 ImplicationChecksByTransitivity, 1632.7ms TimeCoverageRelationStatistics Valid=284, Invalid=5878, Unknown=0, NotChecked=0, Total=6162 [2021-05-03 00:30:36,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-03 00:30:36,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-05-03 00:30:36,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2021-05-03 00:30:36,641 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 84 [2021-05-03 00:30:36,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:36,641 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2021-05-03 00:30:36,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2021-05-03 00:30:36,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-05-03 00:30:36,642 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:36,642 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:36,642 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-05-03 00:30:36,642 INFO L428 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:36,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:36,642 INFO L82 PathProgramCache]: Analyzing trace with hash 129295679, now seen corresponding path program 35 times [2021-05-03 00:30:36,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:36,642 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2048167159] [2021-05-03 00:30:36,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:36,685 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_1443 6) InVars {main_~b~0=v_main_~b~0_1443} OutVars{main_~b~0=v_main_~b~0_1443} AuxVars[] AssignedVars[] [2021-05-03 00:30:36,686 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:36,692 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:36,696 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:36,702 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:36,712 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 6 v_main_~b~0_1445) (< v_main_~a~0_458 5)) InVars {main_~b~0=v_main_~b~0_1445, main_~a~0=v_main_~a~0_458} OutVars{main_~b~0=v_main_~b~0_1445, main_~a~0=v_main_~a~0_458} AuxVars[] AssignedVars[] [2021-05-03 00:30:36,714 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:36,714 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:36,716 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:36,733 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:36,751 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:30:36,752 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:36,757 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-05-03 00:30:36,763 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_466 6) InVars {main_~a~0=v_main_~a~0_466} OutVars{main_~a~0=v_main_~a~0_466} AuxVars[] AssignedVars[] [2021-05-03 00:30:36,764 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:36,775 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:36,780 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:36,788 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:36,801 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:30:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:36,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:36,843 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:30:36,844 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:37,705 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:37,705 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2048167159] [2021-05-03 00:30:37,705 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2048167159] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:37,705 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:37,706 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-03 00:30:37,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827326749] [2021-05-03 00:30:37,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-03 00:30:37,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:37,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-03 00:30:37,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1702, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:30:37,707 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:39,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:39,952 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2021-05-03 00:30:39,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-03 00:30:39,952 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2021-05-03 00:30:39,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:39,953 INFO L225 Difference]: With dead ends: 98 [2021-05-03 00:30:39,953 INFO L226 Difference]: Without dead ends: 91 [2021-05-03 00:30:39,953 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 2081.5ms TimeCoverageRelationStatistics Valid=271, Invalid=6049, Unknown=0, NotChecked=0, Total=6320 [2021-05-03 00:30:39,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-05-03 00:30:39,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2021-05-03 00:30:39,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:39,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2021-05-03 00:30:39,967 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 87 [2021-05-03 00:30:39,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:39,968 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2021-05-03 00:30:39,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 2.0) internal successors, (84), 41 states have internal predecessors, (84), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:39,968 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2021-05-03 00:30:39,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-05-03 00:30:39,968 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:39,968 INFO L523 BasicCegarLoop]: trace histogram [31, 31, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:39,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-05-03 00:30:39,968 INFO L428 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:39,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:39,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1366775133, now seen corresponding path program 36 times [2021-05-03 00:30:39,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:39,969 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [913670582] [2021-05-03 00:30:39,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:40,011 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_1503 6) InVars {main_~b~0=v_main_~b~0_1503} OutVars{main_~b~0=v_main_~b~0_1503} AuxVars[] AssignedVars[] [2021-05-03 00:30:40,012 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:40,013 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:40,017 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:40,030 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:40,041 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 6 v_main_~b~0_1505) (< v_main_~a~0_476 5)) InVars {main_~b~0=v_main_~b~0_1505, main_~a~0=v_main_~a~0_476} OutVars{main_~b~0=v_main_~b~0_1505, main_~a~0=v_main_~a~0_476} AuxVars[] AssignedVars[] [2021-05-03 00:30:40,042 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:40,043 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:40,045 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:40,062 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:40,082 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_482 6) InVars {main_~a~0=v_main_~a~0_482} OutVars{main_~a~0=v_main_~a~0_482} AuxVars[] AssignedVars[] [2021-05-03 00:30:40,083 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:40,094 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:40,098 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:40,107 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:40,120 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:30:40,121 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:40,128 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:30:40,133 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:30:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:40,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:40,191 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:30:40,193 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:40,210 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:40,309 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:40,434 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:40,623 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:40,840 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:41,161 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:41,239 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:41,239 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [913670582] [2021-05-03 00:30:41,239 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [913670582] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:41,239 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:41,239 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2021-05-03 00:30:41,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261867020] [2021-05-03 00:30:41,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-05-03 00:30:41,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:41,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-05-03 00:30:41,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1791, Unknown=0, NotChecked=0, Total=1892 [2021-05-03 00:30:41,240 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:43,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:43,885 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2021-05-03 00:30:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-03 00:30:43,886 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2021-05-03 00:30:43,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:43,886 INFO L225 Difference]: With dead ends: 100 [2021-05-03 00:30:43,886 INFO L226 Difference]: Without dead ends: 93 [2021-05-03 00:30:43,887 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 36 SyntacticMatches, 12 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1459 ImplicationChecksByTransitivity, 2404.0ms TimeCoverageRelationStatistics Valid=266, Invalid=6376, Unknown=0, NotChecked=0, Total=6642 [2021-05-03 00:30:43,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-03 00:30:43,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2021-05-03 00:30:43,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:43,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2021-05-03 00:30:43,902 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 89 [2021-05-03 00:30:43,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:43,902 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2021-05-03 00:30:43,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 43 states, 43 states have (on average 2.0) internal successors, (86), 42 states have internal predecessors, (86), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:43,902 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2021-05-03 00:30:43,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-05-03 00:30:43,903 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:43,903 INFO L523 BasicCegarLoop]: trace histogram [32, 32, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:43,903 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-05-03 00:30:43,903 INFO L428 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:43,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:43,903 INFO L82 PathProgramCache]: Analyzing trace with hash 878589435, now seen corresponding path program 37 times [2021-05-03 00:30:43,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:43,903 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [973088789] [2021-05-03 00:30:43,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:43,947 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_1566 6) InVars {main_~b~0=v_main_~b~0_1566} OutVars{main_~b~0=v_main_~b~0_1566} AuxVars[] AssignedVars[] [2021-05-03 00:30:43,948 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:43,955 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:43,959 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:43,965 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:43,975 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~a~0_494 5) (<= 6 v_main_~b~0_1568)) InVars {main_~b~0=v_main_~b~0_1568, main_~a~0=v_main_~a~0_494} OutVars{main_~b~0=v_main_~b~0_1568, main_~a~0=v_main_~a~0_494} AuxVars[] AssignedVars[] [2021-05-03 00:30:43,977 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:43,978 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:43,980 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:43,998 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:44,015 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:30:44,016 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:44,024 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:30:44,031 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_502 6) InVars {main_~a~0=v_main_~a~0_502} OutVars{main_~a~0=v_main_~a~0_502} AuxVars[] AssignedVars[] [2021-05-03 00:30:44,032 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:44,033 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:44,037 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:44,056 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:44,069 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:30:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:44,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:44,109 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:30:44,110 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:45,059 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:45,059 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [973088789] [2021-05-03 00:30:45,059 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [973088789] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:45,059 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:45,059 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2021-05-03 00:30:45,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115583235] [2021-05-03 00:30:45,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-03 00:30:45,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:45,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-03 00:30:45,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1872, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:30:45,060 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:47,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:47,553 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2021-05-03 00:30:47,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-03 00:30:47,554 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2021-05-03 00:30:47,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:47,554 INFO L225 Difference]: With dead ends: 102 [2021-05-03 00:30:47,554 INFO L226 Difference]: Without dead ends: 95 [2021-05-03 00:30:47,555 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 40 SyntacticMatches, 9 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 2299.4ms TimeCoverageRelationStatistics Valid=283, Invalid=6689, Unknown=0, NotChecked=0, Total=6972 [2021-05-03 00:30:47,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-05-03 00:30:47,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2021-05-03 00:30:47,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2021-05-03 00:30:47,570 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 91 [2021-05-03 00:30:47,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:47,570 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2021-05-03 00:30:47,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 44 states have (on average 2.0) internal successors, (88), 43 states have internal predecessors, (88), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:47,570 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2021-05-03 00:30:47,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-05-03 00:30:47,571 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:47,571 INFO L523 BasicCegarLoop]: trace histogram [33, 33, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:47,571 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-05-03 00:30:47,571 INFO L428 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:47,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:47,571 INFO L82 PathProgramCache]: Analyzing trace with hash -116431079, now seen corresponding path program 38 times [2021-05-03 00:30:47,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:47,571 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2017966574] [2021-05-03 00:30:47,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:47,614 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_1630 6) InVars {main_~b~0=v_main_~b~0_1630} OutVars{main_~b~0=v_main_~b~0_1630} AuxVars[] AssignedVars[] [2021-05-03 00:30:47,615 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:47,621 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:47,625 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:47,632 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:47,642 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 6 v_main_~b~0_1632) (< v_main_~a~0_512 5)) InVars {main_~b~0=v_main_~b~0_1632, main_~a~0=v_main_~a~0_512} OutVars{main_~b~0=v_main_~b~0_1632, main_~a~0=v_main_~a~0_512} AuxVars[] AssignedVars[] [2021-05-03 00:30:47,643 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:47,655 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:47,657 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:47,666 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:47,684 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:30:47,685 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:47,692 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:30:47,699 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_520 6) InVars {main_~a~0=v_main_~a~0_520} OutVars{main_~a~0=v_main_~a~0_520} AuxVars[] AssignedVars[] [2021-05-03 00:30:47,700 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:47,701 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:47,706 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:47,723 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:47,736 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:30:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:47,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:47,777 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:30:47,779 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:48,757 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:48,757 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2017966574] [2021-05-03 00:30:48,757 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2017966574] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:48,757 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:48,757 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2021-05-03 00:30:48,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484192097] [2021-05-03 00:30:48,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-03 00:30:48,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:48,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-03 00:30:48,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1960, Unknown=0, NotChecked=0, Total=2070 [2021-05-03 00:30:48,758 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:51,387 INFO L93 Difference]: Finished difference Result 104 states and 107 transitions. [2021-05-03 00:30:51,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-05-03 00:30:51,387 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2021-05-03 00:30:51,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:51,388 INFO L225 Difference]: With dead ends: 104 [2021-05-03 00:30:51,388 INFO L226 Difference]: Without dead ends: 97 [2021-05-03 00:30:51,389 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 42 SyntacticMatches, 8 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1645 ImplicationChecksByTransitivity, 2415.6ms TimeCoverageRelationStatistics Valid=289, Invalid=7021, Unknown=0, NotChecked=0, Total=7310 [2021-05-03 00:30:51,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-03 00:30:51,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2021-05-03 00:30:51,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:51,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2021-05-03 00:30:51,404 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 93 [2021-05-03 00:30:51,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:51,405 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2021-05-03 00:30:51,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 45 states, 45 states have (on average 2.0) internal successors, (90), 44 states have internal predecessors, (90), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:51,405 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2021-05-03 00:30:51,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-05-03 00:30:51,405 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:51,405 INFO L523 BasicCegarLoop]: trace histogram [34, 34, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:51,405 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-05-03 00:30:51,405 INFO L428 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:51,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:51,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1446561975, now seen corresponding path program 39 times [2021-05-03 00:30:51,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:51,406 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1216559602] [2021-05-03 00:30:51,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:51,449 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_1696 6) InVars {main_~b~0=v_main_~b~0_1696} OutVars{main_~b~0=v_main_~b~0_1696} AuxVars[] AssignedVars[] [2021-05-03 00:30:51,450 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:51,451 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:51,455 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:51,467 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:51,478 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~a~0_530 5) (<= 6 v_main_~b~0_1698)) InVars {main_~b~0=v_main_~b~0_1698, main_~a~0=v_main_~a~0_530} OutVars{main_~b~0=v_main_~b~0_1698, main_~a~0=v_main_~a~0_530} AuxVars[] AssignedVars[] [2021-05-03 00:30:51,479 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:51,491 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:51,493 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:51,502 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:51,522 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_536 6) InVars {main_~a~0=v_main_~a~0_536} OutVars{main_~a~0=v_main_~a~0_536} AuxVars[] AssignedVars[] [2021-05-03 00:30:51,523 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:51,534 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:51,539 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:51,548 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:51,561 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:30:51,562 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:51,570 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:30:51,576 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:30:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:51,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:51,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:30:52,838 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:52,838 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1216559602] [2021-05-03 00:30:52,838 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1216559602] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:52,838 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:52,838 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-05-03 00:30:52,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414558768] [2021-05-03 00:30:52,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-05-03 00:30:52,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:52,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-05-03 00:30:52,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2210, Unknown=0, NotChecked=0, Total=2352 [2021-05-03 00:30:52,839 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:55,613 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2021-05-03 00:30:55,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-05-03 00:30:55,613 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2021-05-03 00:30:55,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:55,614 INFO L225 Difference]: With dead ends: 106 [2021-05-03 00:30:55,614 INFO L226 Difference]: Without dead ends: 99 [2021-05-03 00:30:55,615 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 34 SyntacticMatches, 15 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1965 ImplicationChecksByTransitivity, 2709.9ms TimeCoverageRelationStatistics Valid=344, Invalid=7666, Unknown=0, NotChecked=0, Total=8010 [2021-05-03 00:30:55,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-03 00:30:55,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2021-05-03 00:30:55,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:55,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2021-05-03 00:30:55,631 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 95 [2021-05-03 00:30:55,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:55,631 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2021-05-03 00:30:55,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 2.0) internal successors, (92), 45 states have internal predecessors, (92), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2021-05-03 00:30:55,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-05-03 00:30:55,632 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:30:55,632 INFO L523 BasicCegarLoop]: trace histogram [35, 35, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:30:55,632 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-05-03 00:30:55,632 INFO L428 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:30:55,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:30:55,632 INFO L82 PathProgramCache]: Analyzing trace with hash 244333269, now seen corresponding path program 40 times [2021-05-03 00:30:55,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:30:55,632 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1680275304] [2021-05-03 00:30:55,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:30:55,675 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~b~0_1765 6) InVars {main_~b~0=v_main_~b~0_1765} OutVars{main_~b~0=v_main_~b~0_1765} AuxVars[] AssignedVars[] [2021-05-03 00:30:55,676 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:30:55,683 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:55,687 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:55,693 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:30:55,703 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 6 v_main_~b~0_1767) (< v_main_~a~0_548 5)) InVars {main_~b~0=v_main_~b~0_1767, main_~a~0=v_main_~a~0_548} OutVars{main_~b~0=v_main_~b~0_1767, main_~a~0=v_main_~a~0_548} AuxVars[] AssignedVars[] [2021-05-03 00:30:55,704 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size [2021-05-03 00:30:55,716 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:55,718 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-03 00:30:55,726 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.6 percent of original size 50 [2021-05-03 00:30:55,746 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~a~0_554 6) InVars {main_~a~0=v_main_~a~0_554} OutVars{main_~a~0=v_main_~a~0_554} AuxVars[] AssignedVars[] [2021-05-03 00:30:55,747 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size [2021-05-03 00:30:55,758 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:55,763 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:30:55,771 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.3 percent of original size 56 [2021-05-03 00:30:55,783 INFO L181 rdanLoopAcceleration]: Guard: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] [2021-05-03 00:30:55,784 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:30:55,791 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:30:55,797 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:30:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:55,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:30:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:30:55,854 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:30:55,856 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:55,872 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:55,962 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:56,090 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:56,256 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:56,470 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:56,738 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:30:57,020 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:30:57,020 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1680275304] [2021-05-03 00:30:57,020 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1680275304] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:30:57,020 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:30:57,020 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-05-03 00:30:57,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996008356] [2021-05-03 00:30:57,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-05-03 00:30:57,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:30:57,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-05-03 00:30:57,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2147, Unknown=0, NotChecked=0, Total=2256 [2021-05-03 00:30:57,021 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:59,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:30:59,868 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2021-05-03 00:30:59,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-05-03 00:30:59,869 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2021-05-03 00:30:59,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:30:59,869 INFO L225 Difference]: With dead ends: 105 [2021-05-03 00:30:59,869 INFO L226 Difference]: Without dead ends: 0 [2021-05-03 00:30:59,870 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 42 SyntacticMatches, 10 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1759 ImplicationChecksByTransitivity, 2653.0ms TimeCoverageRelationStatistics Valid=296, Invalid=7894, Unknown=0, NotChecked=0, Total=8190 [2021-05-03 00:30:59,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-03 00:30:59,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-03 00:30:59,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-03 00:30:59,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-03 00:30:59,871 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2021-05-03 00:30:59,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:30:59,871 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-03 00:30:59,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 47 states, 47 states have (on average 2.0) internal successors, (94), 46 states have internal predecessors, (94), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:30:59,871 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-03 00:30:59,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-03 00:30:59,872 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-05-03 00:30:59,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-03 00:31:00,076 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 103 [2021-05-03 00:31:00,494 WARN L205 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 100 [2021-05-03 00:31:00,679 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2021-05-03 00:31:01,407 WARN L205 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2021-05-03 00:31:02,092 WARN L205 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-05-03 00:31:02,097 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2021-05-03 00:31:02,097 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2021-05-03 00:31:02,097 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2021-05-03 00:31:02,097 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-03 00:31:02,097 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2021-05-03 00:31:02,097 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-03 00:31:02,097 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-03 00:31:02,097 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-03 00:31:02,097 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-03 00:31:02,097 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-03 00:31:02,097 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 15 29) the Hoare annotation is: true [2021-05-03 00:31:02,097 INFO L201 CegarLoopUtils]: At program point L25-1(lines 25 27) the Hoare annotation is: true [2021-05-03 00:31:02,097 INFO L194 CegarLoopUtils]: At program point L21-2(lines 21 23) the Hoare annotation is: (let ((.cse7 (= main_~b~0 3)) (.cse3 (= main_~a~0 2)) (.cse10 (= main_~a~0 3)) (.cse2 (= main_~b~0 1)) (.cse8 (= main_~a~0 1)) (.cse9 (= main_~b~0 0)) (.cse4 (= main_~b~0 2)) (.cse0 (= 5 main_~b~0)) (.cse6 (= 5 main_~a~0)) (.cse1 (= main_~a~0 0)) (.cse11 (= main_~b~0 4)) (.cse5 (= main_~a~0 4))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse0 .cse3) (and .cse4 .cse3) (and .cse0 .cse5) (and .cse6 .cse7) (and .cse8 .cse9) (and .cse8 .cse4) (and .cse10 .cse4) (and .cse2 .cse5) (and .cse6 .cse4) (and .cse6 .cse9) (and .cse7 .cse5) (and .cse8 .cse7) (and .cse10 .cse9) (and .cse7 .cse3) (and .cse9 .cse5) (and .cse11 .cse6) (and .cse11 .cse10) (and .cse7 .cse1) (and .cse10 .cse7) (and .cse2 .cse10) (and .cse4 .cse5) (and .cse11 .cse3) (and .cse0 .cse8) (and .cse2 .cse3) (and .cse11 .cse8) (and .cse9 .cse3) (and .cse0 .cse10) (and .cse2 .cse6) (and .cse2 .cse8) (and .cse9 .cse1) (and .cse4 .cse1) (and .cse0 .cse6) (and .cse11 .cse1) (and .cse11 .cse5))) [2021-05-03 00:31:02,098 INFO L194 CegarLoopUtils]: At program point L21-3(lines 21 23) the Hoare annotation is: (let ((.cse8 (= main_~b~0 3)) (.cse11 (= main_~a~0 3)) (.cse4 (= main_~b~0 6)) (.cse5 (= main_~a~0 2)) (.cse3 (= main_~b~0 1)) (.cse9 (= main_~a~0 1)) (.cse10 (= main_~b~0 0)) (.cse6 (= main_~b~0 2)) (.cse0 (= 5 main_~b~0)) (.cse2 (= 5 main_~a~0)) (.cse1 (= main_~a~0 0)) (.cse12 (= main_~b~0 4)) (.cse7 (= main_~a~0 4))) (or (and .cse0 .cse1) (and .cse2 (<= main_~b~0 6) (<= 6 main_~b~0)) (and .cse3 .cse1) (and .cse4 .cse1) (and .cse0 .cse5) (and .cse6 .cse5) (and .cse0 .cse7) (and .cse2 .cse8) (and .cse9 .cse10) (and .cse9 .cse6) (and .cse11 .cse6) (and .cse3 .cse7) (and .cse2 .cse6) (and .cse2 .cse10) (and .cse8 .cse7) (and .cse9 .cse8) (and .cse4 .cse7) (and .cse11 .cse10) (and .cse8 .cse5) (and .cse10 .cse7) (and .cse12 .cse2) (and .cse12 .cse11) (and .cse8 .cse1) (and .cse11 .cse8) (and .cse3 .cse11) (and .cse12 .cse5) (and .cse6 .cse7) (and .cse0 .cse9) (and .cse3 .cse5) (and .cse9 .cse4) (and .cse12 .cse9) (and .cse10 .cse5) (and .cse0 .cse11) (and .cse3 .cse2) (and .cse11 .cse4) (and .cse4 .cse5) (and .cse3 .cse9) (and .cse10 .cse1) (and .cse6 .cse1) (and .cse0 .cse2) (and .cse12 .cse1) (and .cse12 .cse7))) [2021-05-03 00:31:02,098 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 15 29) the Hoare annotation is: true [2021-05-03 00:31:02,098 INFO L194 CegarLoopUtils]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 26) the Hoare annotation is: false [2021-05-03 00:31:02,098 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 15 29) the Hoare annotation is: true [2021-05-03 00:31:02,098 INFO L194 CegarLoopUtils]: At program point L26(line 26) the Hoare annotation is: false [2021-05-03 00:31:02,098 INFO L194 CegarLoopUtils]: At program point L20-2(lines 20 24) the Hoare annotation is: (let ((.cse0 (= main_~b~0 6))) (or (and (= 5 main_~a~0) (<= main_~b~0 6) (<= 6 main_~b~0)) (and (= main_~a~0 3) .cse0) (and .cse0 (= main_~a~0 2)) (and .cse0 (= main_~a~0 0)) (and .cse0 (= main_~a~0 4)) (and (= main_~a~0 1) .cse0))) [2021-05-03 00:31:02,098 INFO L194 CegarLoopUtils]: At program point L20-3(lines 20 24) the Hoare annotation is: (let ((.cse0 (= main_~b~0 6))) (or (and (= 5 main_~a~0) .cse0) (and (< 5 main_~b~0) (<= main_~a~0 6) (< 5 main_~a~0) (<= main_~b~0 6)) (and (= main_~a~0 3) .cse0) (and .cse0 (= main_~a~0 2)) (and (= main_~a~0 0) .cse0) (and (= main_~a~0 1) .cse0) (and (= main_~a~0 4) .cse0))) [2021-05-03 00:31:02,098 INFO L194 CegarLoopUtils]: At program point L20-4(lines 15 29) the Hoare annotation is: (and (< 5 main_~b~0) (<= main_~a~0 6) (< 5 main_~a~0) (<= main_~b~0 6)) [2021-05-03 00:31:02,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.05 12:31:02 BoogieIcfgContainer [2021-05-03 00:31:02,112 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-03 00:31:02,112 INFO L168 Benchmark]: Toolchain (without parser) took 75075.19 ms. Allocated memory was 180.4 MB in the beginning and 475.0 MB in the end (delta: 294.6 MB). Free memory was 145.9 MB in the beginning and 236.9 MB in the end (delta: -91.0 MB). Peak memory consumption was 269.5 MB. Max. memory is 8.0 GB. [2021-05-03 00:31:02,112 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 180.4 MB. Free memory is still 162.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-03 00:31:02,112 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.13 ms. Allocated memory is still 180.4 MB. Free memory was 145.7 MB in the beginning and 136.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-05-03 00:31:02,112 INFO L168 Benchmark]: Boogie Preprocessor took 72.78 ms. Allocated memory is still 180.4 MB. Free memory was 136.5 MB in the beginning and 163.8 MB in the end (delta: -27.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 8.0 GB. [2021-05-03 00:31:02,113 INFO L168 Benchmark]: RCFGBuilder took 259.83 ms. Allocated memory is still 180.4 MB. Free memory was 163.8 MB in the beginning and 151.2 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-05-03 00:31:02,113 INFO L168 Benchmark]: TraceAbstraction took 74598.05 ms. Allocated memory was 180.4 MB in the beginning and 475.0 MB in the end (delta: 294.6 MB). Free memory was 150.7 MB in the beginning and 236.9 MB in the end (delta: -86.2 MB). Peak memory consumption was 274.6 MB. Max. memory is 8.0 GB. [2021-05-03 00:31:02,113 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 180.4 MB. Free memory is still 162.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 139.13 ms. Allocated memory is still 180.4 MB. Free memory was 145.7 MB in the beginning and 136.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 72.78 ms. Allocated memory is still 180.4 MB. Free memory was 136.5 MB in the beginning and 163.8 MB in the end (delta: -27.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 259.83 ms. Allocated memory is still 180.4 MB. Free memory was 163.8 MB in the beginning and 151.2 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 74598.05 ms. Allocated memory was 180.4 MB in the beginning and 475.0 MB in the end (delta: 294.6 MB). Free memory was 150.7 MB in the beginning and 236.9 MB in the end (delta: -86.2 MB). Peak memory consumption was 274.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 26]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 72322.2ms, OverallIterations: 42, TraceHistogramMax: 35, EmptinessCheckTime: 27.6ms, AutomataDifference: 45749.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 2224.2ms, InitialAbstractionConstructionTime: 6.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 347 SDtfs, 1561 SDslu, 3143 SDs, 0 SdLazy, 53705 SolverSat, 1333 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14071.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3178 GetRequests, 975 SyntacticMatches, 232 SemanticMatches, 1971 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28622 ImplicationChecksByTransitivity, 43397.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=41, InterpolantAutomatonStates: 1030, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 390.5ms AutomataMinimizationTime, 42 MinimizatonAttempts, 56 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 115 NumberOfFragments, 709 HoareAnnotationTreeSize, 18 FomulaSimplifications, 8717063165983 FormulaSimplificationTreeSizeReduction, 619.4ms HoareSimplificationTime, 18 FomulaSimplificationsInter, 2997 FormulaSimplificationTreeSizeReductionInter, 1594.7ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((5 == a && b == 6) || (((5 < b && a <= 6) && 5 < a) && b <= 6)) || (a == 3 && b == 6)) || (b == 6 && a == 2)) || (a == 0 && b == 6)) || (a == 1 && b == 6)) || (a == 4 && b == 6) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((5 == b && a == 0) || ((5 == a && b <= 6) && 6 <= b)) || (b == 1 && a == 0)) || (b == 6 && a == 0)) || (5 == b && a == 2)) || (b == 2 && a == 2)) || (5 == b && a == 4)) || (5 == a && b == 3)) || (a == 1 && b == 0)) || (a == 1 && b == 2)) || (a == 3 && b == 2)) || (b == 1 && a == 4)) || (5 == a && b == 2)) || (5 == a && b == 0)) || (b == 3 && a == 4)) || (a == 1 && b == 3)) || (b == 6 && a == 4)) || (a == 3 && b == 0)) || (b == 3 && a == 2)) || (b == 0 && a == 4)) || (b == 4 && 5 == a)) || (b == 4 && a == 3)) || (b == 3 && a == 0)) || (a == 3 && b == 3)) || (b == 1 && a == 3)) || (b == 4 && a == 2)) || (b == 2 && a == 4)) || (5 == b && a == 1)) || (b == 1 && a == 2)) || (a == 1 && b == 6)) || (b == 4 && a == 1)) || (b == 0 && a == 2)) || (5 == b && a == 3)) || (b == 1 && 5 == a)) || (a == 3 && b == 6)) || (b == 6 && a == 2)) || (b == 1 && a == 1)) || (b == 0 && a == 0)) || (b == 2 && a == 0)) || (5 == b && 5 == a)) || (b == 4 && a == 0)) || (b == 4 && a == 4) - ProcedureContractResult [Line: 15]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! Received shutdown request...