/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/eca-rers2012/Problem11_label25.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 13:34:13,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 13:34:13,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 13:34:13,441 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 13:34:13,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 13:34:13,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 13:34:13,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 13:34:13,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 13:34:13,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 13:34:13,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 13:34:13,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 13:34:13,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 13:34:13,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 13:34:13,473 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 13:34:13,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 13:34:13,476 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 13:34:13,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 13:34:13,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 13:34:13,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 13:34:13,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 13:34:13,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 13:34:13,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 13:34:13,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 13:34:13,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 13:34:13,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 13:34:13,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 13:34:13,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 13:34:13,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 13:34:13,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 13:34:13,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 13:34:13,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 13:34:13,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 13:34:13,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 13:34:13,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 13:34:13,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 13:34:13,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 13:34:13,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 13:34:13,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 13:34:13,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 13:34:13,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 13:34:13,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 13:34:13,516 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 13:34:13,544 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 13:34:13,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 13:34:13,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 13:34:13,546 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 13:34:13,546 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 13:34:13,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 13:34:13,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 13:34:13,547 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 13:34:13,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 13:34:13,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 13:34:13,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 13:34:13,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 13:34:13,548 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 13:34:13,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 13:34:13,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 13:34:13,548 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 13:34:13,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 13:34:13,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 13:34:13,549 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 13:34:13,549 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 13:34:13,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 13:34:13,550 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 13:34:13,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 13:34:13,550 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 13:34:13,550 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 13:34:13,551 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-bitabs/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 [2021-01-06 13:34:13,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 13:34:13,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 13:34:13,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 13:34:13,999 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 13:34:14,000 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 13:34:14,001 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label25.c [2021-01-06 13:34:14,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/210aed6f3/5bd004ca75c74218a1270ae9ed5dbd22/FLAGef9fcfa6c [2021-01-06 13:34:14,834 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 13:34:14,834 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label25.c [2021-01-06 13:34:14,854 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/210aed6f3/5bd004ca75c74218a1270ae9ed5dbd22/FLAGef9fcfa6c [2021-01-06 13:34:15,033 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/210aed6f3/5bd004ca75c74218a1270ae9ed5dbd22 [2021-01-06 13:34:15,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 13:34:15,046 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 13:34:15,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 13:34:15,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 13:34:15,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 13:34:15,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 01:34:15" (1/1) ... [2021-01-06 13:34:15,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25efa617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:15, skipping insertion in model container [2021-01-06 13:34:15,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 01:34:15" (1/1) ... [2021-01-06 13:34:15,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 13:34:15,148 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 13:34:15,382 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label25.c[4556,4569] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2021-01-06 13:34:15,805 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 13:34:15,815 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 13:34:15,838 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label25.c[4556,4569] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a29~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a25~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2021-01-06 13:34:15,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 13:34:16,017 INFO L208 MainTranslator]: Completed translation [2021-01-06 13:34:16,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:16 WrapperNode [2021-01-06 13:34:16,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 13:34:16,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 13:34:16,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 13:34:16,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 13:34:16,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:16" (1/1) ... [2021-01-06 13:34:16,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:16" (1/1) ... [2021-01-06 13:34:16,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 13:34:16,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 13:34:16,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 13:34:16,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 13:34:16,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:16" (1/1) ... [2021-01-06 13:34:16,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:16" (1/1) ... [2021-01-06 13:34:16,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:16" (1/1) ... [2021-01-06 13:34:16,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:16" (1/1) ... [2021-01-06 13:34:16,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:16" (1/1) ... [2021-01-06 13:34:16,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:16" (1/1) ... [2021-01-06 13:34:16,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:16" (1/1) ... [2021-01-06 13:34:16,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 13:34:16,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 13:34:16,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 13:34:16,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 13:34:16,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:16" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/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-01-06 13:34:16,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 13:34:16,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 13:34:16,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 13:34:16,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 13:34:18,522 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 13:34:18,523 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 13:34:18,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 01:34:18 BoogieIcfgContainer [2021-01-06 13:34:18,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 13:34:18,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 13:34:18,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 13:34:18,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 13:34:18,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 01:34:15" (1/3) ... [2021-01-06 13:34:18,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4be117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 01:34:18, skipping insertion in model container [2021-01-06 13:34:18,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:16" (2/3) ... [2021-01-06 13:34:18,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4be117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 01:34:18, skipping insertion in model container [2021-01-06 13:34:18,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 01:34:18" (3/3) ... [2021-01-06 13:34:18,542 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem11_label25.c [2021-01-06 13:34:18,552 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 13:34:18,558 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 13:34:18,587 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 13:34:18,637 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 13:34:18,638 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 13:34:18,638 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 13:34:18,638 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 13:34:18,638 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 13:34:18,638 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 13:34:18,638 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 13:34:18,638 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 13:34:18,670 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2021-01-06 13:34:18,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-06 13:34:18,680 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:18,681 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:34:18,681 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:18,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:18,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1843609039, now seen corresponding path program 1 times [2021-01-06 13:34:18,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:18,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391067268] [2021-01-06 13:34:18,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:18,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391067268] [2021-01-06 13:34:18,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:18,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:34:18,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416963979] [2021-01-06 13:34:18,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:18,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:19,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:19,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:19,021 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 3 states. [2021-01-06 13:34:20,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:20,706 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2021-01-06 13:34:20,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:20,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2021-01-06 13:34:20,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:20,732 INFO L225 Difference]: With dead ends: 761 [2021-01-06 13:34:20,732 INFO L226 Difference]: Without dead ends: 413 [2021-01-06 13:34:20,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:20,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-01-06 13:34:20,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2021-01-06 13:34:20,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2021-01-06 13:34:20,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2021-01-06 13:34:20,853 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 31 [2021-01-06 13:34:20,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:20,853 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2021-01-06 13:34:20,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:20,854 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2021-01-06 13:34:20,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 13:34:20,858 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:20,859 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:34:20,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 13:34:20,859 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:20,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:20,860 INFO L82 PathProgramCache]: Analyzing trace with hash 511429272, now seen corresponding path program 1 times [2021-01-06 13:34:20,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:20,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021468551] [2021-01-06 13:34:20,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:21,119 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:21,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021468551] [2021-01-06 13:34:21,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:21,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:34:21,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218458663] [2021-01-06 13:34:21,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:21,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:21,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:21,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:21,128 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand 3 states. [2021-01-06 13:34:22,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:22,401 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2021-01-06 13:34:22,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:22,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2021-01-06 13:34:22,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:22,412 INFO L225 Difference]: With dead ends: 1211 [2021-01-06 13:34:22,412 INFO L226 Difference]: Without dead ends: 800 [2021-01-06 13:34:22,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:22,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2021-01-06 13:34:22,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2021-01-06 13:34:22,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2021-01-06 13:34:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions. [2021-01-06 13:34:22,486 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 99 [2021-01-06 13:34:22,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:22,486 INFO L481 AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions. [2021-01-06 13:34:22,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions. [2021-01-06 13:34:22,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 13:34:22,490 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:22,491 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:34:22,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 13:34:22,491 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:22,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:22,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2046842248, now seen corresponding path program 1 times [2021-01-06 13:34:22,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:22,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264796242] [2021-01-06 13:34:22,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:22,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264796242] [2021-01-06 13:34:22,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:22,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:22,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493141601] [2021-01-06 13:34:22,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:34:22,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:22,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:34:22,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:34:22,809 INFO L87 Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand 4 states. [2021-01-06 13:34:25,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:25,022 INFO L93 Difference]: Finished difference Result 2505 states and 3428 transitions. [2021-01-06 13:34:25,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:34:25,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2021-01-06 13:34:25,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:25,044 INFO L225 Difference]: With dead ends: 2505 [2021-01-06 13:34:25,044 INFO L226 Difference]: Without dead ends: 1718 [2021-01-06 13:34:25,050 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 13:34:25,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2021-01-06 13:34:25,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1714. [2021-01-06 13:34:25,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1714 states. [2021-01-06 13:34:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2101 transitions. [2021-01-06 13:34:25,105 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2101 transitions. Word has length 100 [2021-01-06 13:34:25,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:25,105 INFO L481 AbstractCegarLoop]: Abstraction has 1714 states and 2101 transitions. [2021-01-06 13:34:25,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:34:25,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2101 transitions. [2021-01-06 13:34:25,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-01-06 13:34:25,112 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:25,113 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:34:25,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 13:34:25,113 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:25,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:25,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1827645373, now seen corresponding path program 1 times [2021-01-06 13:34:25,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:25,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455893443] [2021-01-06 13:34:25,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:25,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455893443] [2021-01-06 13:34:25,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:25,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:25,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862518540] [2021-01-06 13:34:25,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:34:25,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:25,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:34:25,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:34:25,338 INFO L87 Difference]: Start difference. First operand 1714 states and 2101 transitions. Second operand 4 states. [2021-01-06 13:34:27,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:27,458 INFO L93 Difference]: Finished difference Result 5296 states and 6687 transitions. [2021-01-06 13:34:27,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:34:27,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2021-01-06 13:34:27,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:27,483 INFO L225 Difference]: With dead ends: 5296 [2021-01-06 13:34:27,484 INFO L226 Difference]: Without dead ends: 3768 [2021-01-06 13:34:27,487 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:34:27,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2021-01-06 13:34:27,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 3767. [2021-01-06 13:34:27,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3767 states. [2021-01-06 13:34:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3767 states to 3767 states and 4629 transitions. [2021-01-06 13:34:27,594 INFO L78 Accepts]: Start accepts. Automaton has 3767 states and 4629 transitions. Word has length 158 [2021-01-06 13:34:27,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:27,598 INFO L481 AbstractCegarLoop]: Abstraction has 3767 states and 4629 transitions. [2021-01-06 13:34:27,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:34:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3767 states and 4629 transitions. [2021-01-06 13:34:27,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-01-06 13:34:27,608 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:27,609 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:34:27,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 13:34:27,609 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:27,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:27,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1853380539, now seen corresponding path program 1 times [2021-01-06 13:34:27,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:27,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536647489] [2021-01-06 13:34:27,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:27,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536647489] [2021-01-06 13:34:27,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:27,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:27,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476229852] [2021-01-06 13:34:27,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:27,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:27,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:27,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:27,913 INFO L87 Difference]: Start difference. First operand 3767 states and 4629 transitions. Second operand 3 states. [2021-01-06 13:34:29,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:29,166 INFO L93 Difference]: Finished difference Result 8652 states and 10854 transitions. [2021-01-06 13:34:29,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:29,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2021-01-06 13:34:29,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:29,196 INFO L225 Difference]: With dead ends: 8652 [2021-01-06 13:34:29,196 INFO L226 Difference]: Without dead ends: 5256 [2021-01-06 13:34:29,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:29,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5256 states. [2021-01-06 13:34:29,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5256 to 5241. [2021-01-06 13:34:29,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5241 states. [2021-01-06 13:34:29,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5241 states to 5241 states and 6331 transitions. [2021-01-06 13:34:29,328 INFO L78 Accepts]: Start accepts. Automaton has 5241 states and 6331 transitions. Word has length 211 [2021-01-06 13:34:29,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:29,330 INFO L481 AbstractCegarLoop]: Abstraction has 5241 states and 6331 transitions. [2021-01-06 13:34:29,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:29,330 INFO L276 IsEmpty]: Start isEmpty. Operand 5241 states and 6331 transitions. [2021-01-06 13:34:29,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-01-06 13:34:29,334 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:29,334 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:34:29,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 13:34:29,335 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:29,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:29,336 INFO L82 PathProgramCache]: Analyzing trace with hash 898941365, now seen corresponding path program 1 times [2021-01-06 13:34:29,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:29,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723923389] [2021-01-06 13:34:29,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:29,590 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-01-06 13:34:29,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723923389] [2021-01-06 13:34:29,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:29,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:29,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599435324] [2021-01-06 13:34:29,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:29,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:29,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:29,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:29,593 INFO L87 Difference]: Start difference. First operand 5241 states and 6331 transitions. Second operand 3 states. [2021-01-06 13:34:30,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:30,792 INFO L93 Difference]: Finished difference Result 11049 states and 13480 transitions. [2021-01-06 13:34:30,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:30,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2021-01-06 13:34:30,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:30,825 INFO L225 Difference]: With dead ends: 11049 [2021-01-06 13:34:30,825 INFO L226 Difference]: Without dead ends: 6179 [2021-01-06 13:34:30,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:30,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6179 states. [2021-01-06 13:34:30,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6179 to 6161. [2021-01-06 13:34:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6161 states. [2021-01-06 13:34:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6161 states to 6161 states and 7431 transitions. [2021-01-06 13:34:30,973 INFO L78 Accepts]: Start accepts. Automaton has 6161 states and 7431 transitions. Word has length 212 [2021-01-06 13:34:30,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:30,974 INFO L481 AbstractCegarLoop]: Abstraction has 6161 states and 7431 transitions. [2021-01-06 13:34:30,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:30,974 INFO L276 IsEmpty]: Start isEmpty. Operand 6161 states and 7431 transitions. [2021-01-06 13:34:30,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-01-06 13:34:30,977 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:30,978 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:34:30,978 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 13:34:30,978 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:30,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:30,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1164869568, now seen corresponding path program 1 times [2021-01-06 13:34:30,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:30,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515352801] [2021-01-06 13:34:30,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-01-06 13:34:31,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515352801] [2021-01-06 13:34:31,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:31,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:31,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179586925] [2021-01-06 13:34:31,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:31,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:31,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:31,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:31,221 INFO L87 Difference]: Start difference. First operand 6161 states and 7431 transitions. Second operand 3 states. [2021-01-06 13:34:32,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:32,639 INFO L93 Difference]: Finished difference Result 13249 states and 16226 transitions. [2021-01-06 13:34:32,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:32,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2021-01-06 13:34:32,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:32,678 INFO L225 Difference]: With dead ends: 13249 [2021-01-06 13:34:32,679 INFO L226 Difference]: Without dead ends: 7459 [2021-01-06 13:34:32,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:32,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7459 states. [2021-01-06 13:34:32,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7459 to 7265. [2021-01-06 13:34:32,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7265 states. [2021-01-06 13:34:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7265 states to 7265 states and 8727 transitions. [2021-01-06 13:34:32,856 INFO L78 Accepts]: Start accepts. Automaton has 7265 states and 8727 transitions. Word has length 213 [2021-01-06 13:34:32,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:32,856 INFO L481 AbstractCegarLoop]: Abstraction has 7265 states and 8727 transitions. [2021-01-06 13:34:32,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:32,857 INFO L276 IsEmpty]: Start isEmpty. Operand 7265 states and 8727 transitions. [2021-01-06 13:34:32,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2021-01-06 13:34:32,861 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:32,862 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:34:32,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 13:34:32,862 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:32,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:32,863 INFO L82 PathProgramCache]: Analyzing trace with hash 479506802, now seen corresponding path program 1 times [2021-01-06 13:34:32,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:32,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469237998] [2021-01-06 13:34:32,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:33,077 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:33,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469237998] [2021-01-06 13:34:33,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:33,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 13:34:33,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159017603] [2021-01-06 13:34:33,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:34:33,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:33,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:34:33,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:34:33,080 INFO L87 Difference]: Start difference. First operand 7265 states and 8727 transitions. Second operand 4 states. [2021-01-06 13:34:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:35,216 INFO L93 Difference]: Finished difference Result 20645 states and 25403 transitions. [2021-01-06 13:34:35,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:34:35,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2021-01-06 13:34:35,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:35,270 INFO L225 Difference]: With dead ends: 20645 [2021-01-06 13:34:35,270 INFO L226 Difference]: Without dead ends: 13751 [2021-01-06 13:34:35,285 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:34:35,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13751 states. [2021-01-06 13:34:35,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13751 to 13745. [2021-01-06 13:34:35,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13745 states. [2021-01-06 13:34:35,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13745 states to 13745 states and 16367 transitions. [2021-01-06 13:34:35,622 INFO L78 Accepts]: Start accepts. Automaton has 13745 states and 16367 transitions. Word has length 233 [2021-01-06 13:34:35,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:35,622 INFO L481 AbstractCegarLoop]: Abstraction has 13745 states and 16367 transitions. [2021-01-06 13:34:35,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:34:35,623 INFO L276 IsEmpty]: Start isEmpty. Operand 13745 states and 16367 transitions. [2021-01-06 13:34:35,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-01-06 13:34:35,627 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:35,628 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:34:35,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 13:34:35,628 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:35,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:35,629 INFO L82 PathProgramCache]: Analyzing trace with hash -554811765, now seen corresponding path program 1 times [2021-01-06 13:34:35,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:35,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857493273] [2021-01-06 13:34:35,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:35,917 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:35,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857493273] [2021-01-06 13:34:35,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:35,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 13:34:35,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501152518] [2021-01-06 13:34:35,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:34:35,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:35,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:34:35,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:34:35,920 INFO L87 Difference]: Start difference. First operand 13745 states and 16367 transitions. Second operand 4 states. [2021-01-06 13:34:38,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:38,387 INFO L93 Difference]: Finished difference Result 32285 states and 39124 transitions. [2021-01-06 13:34:38,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:34:38,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2021-01-06 13:34:38,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:38,434 INFO L225 Difference]: With dead ends: 32285 [2021-01-06 13:34:38,434 INFO L226 Difference]: Without dead ends: 18911 [2021-01-06 13:34:38,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:34:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18911 states. [2021-01-06 13:34:38,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18911 to 18898. [2021-01-06 13:34:38,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18898 states. [2021-01-06 13:34:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18898 states to 18898 states and 22646 transitions. [2021-01-06 13:34:38,729 INFO L78 Accepts]: Start accepts. Automaton has 18898 states and 22646 transitions. Word has length 243 [2021-01-06 13:34:38,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:38,730 INFO L481 AbstractCegarLoop]: Abstraction has 18898 states and 22646 transitions. [2021-01-06 13:34:38,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:34:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 18898 states and 22646 transitions. [2021-01-06 13:34:38,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2021-01-06 13:34:38,736 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:38,737 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:34:38,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 13:34:38,737 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:38,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:38,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1688647778, now seen corresponding path program 1 times [2021-01-06 13:34:38,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:38,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375744154] [2021-01-06 13:34:38,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:38,968 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-01-06 13:34:38,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375744154] [2021-01-06 13:34:38,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:38,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:38,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503960313] [2021-01-06 13:34:38,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:38,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:38,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:38,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:38,974 INFO L87 Difference]: Start difference. First operand 18898 states and 22646 transitions. Second operand 3 states. [2021-01-06 13:34:40,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:40,435 INFO L93 Difference]: Finished difference Result 37622 states and 45125 transitions. [2021-01-06 13:34:40,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:40,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2021-01-06 13:34:40,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:40,481 INFO L225 Difference]: With dead ends: 37622 [2021-01-06 13:34:40,481 INFO L226 Difference]: Without dead ends: 18910 [2021-01-06 13:34:40,507 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:40,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18910 states. [2021-01-06 13:34:40,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18910 to 18713. [2021-01-06 13:34:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18713 states. [2021-01-06 13:34:40,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18713 states to 18713 states and 21758 transitions. [2021-01-06 13:34:40,863 INFO L78 Accepts]: Start accepts. Automaton has 18713 states and 21758 transitions. Word has length 250 [2021-01-06 13:34:40,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:40,864 INFO L481 AbstractCegarLoop]: Abstraction has 18713 states and 21758 transitions. [2021-01-06 13:34:40,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:40,864 INFO L276 IsEmpty]: Start isEmpty. Operand 18713 states and 21758 transitions. [2021-01-06 13:34:40,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2021-01-06 13:34:40,872 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:40,872 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:34:40,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 13:34:40,873 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:40,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:40,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1152681977, now seen corresponding path program 1 times [2021-01-06 13:34:40,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:40,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527671459] [2021-01-06 13:34:40,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:41,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527671459] [2021-01-06 13:34:41,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:41,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:41,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389898320] [2021-01-06 13:34:41,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:34:41,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:41,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:34:41,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:34:41,244 INFO L87 Difference]: Start difference. First operand 18713 states and 21758 transitions. Second operand 4 states. [2021-01-06 13:34:43,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:43,390 INFO L93 Difference]: Finished difference Result 39443 states and 46214 transitions. [2021-01-06 13:34:43,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:34:43,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 264 [2021-01-06 13:34:43,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:43,440 INFO L225 Difference]: With dead ends: 39443 [2021-01-06 13:34:43,440 INFO L226 Difference]: Without dead ends: 20548 [2021-01-06 13:34:43,459 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:34:43,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20548 states. [2021-01-06 13:34:43,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20548 to 18323. [2021-01-06 13:34:43,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18323 states. [2021-01-06 13:34:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18323 states to 18323 states and 20627 transitions. [2021-01-06 13:34:43,800 INFO L78 Accepts]: Start accepts. Automaton has 18323 states and 20627 transitions. Word has length 264 [2021-01-06 13:34:43,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:43,801 INFO L481 AbstractCegarLoop]: Abstraction has 18323 states and 20627 transitions. [2021-01-06 13:34:43,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:34:43,801 INFO L276 IsEmpty]: Start isEmpty. Operand 18323 states and 20627 transitions. [2021-01-06 13:34:43,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2021-01-06 13:34:43,813 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:43,813 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:34:43,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 13:34:43,814 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:43,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:43,814 INFO L82 PathProgramCache]: Analyzing trace with hash -800517391, now seen corresponding path program 1 times [2021-01-06 13:34:43,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:43,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865038279] [2021-01-06 13:34:43,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:44,017 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2021-01-06 13:34:44,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865038279] [2021-01-06 13:34:44,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:44,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:44,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455473283] [2021-01-06 13:34:44,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:44,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:44,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:44,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:44,020 INFO L87 Difference]: Start difference. First operand 18323 states and 20627 transitions. Second operand 3 states. [2021-01-06 13:34:45,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:45,260 INFO L93 Difference]: Finished difference Result 38295 states and 43093 transitions. [2021-01-06 13:34:45,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:45,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2021-01-06 13:34:45,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:45,307 INFO L225 Difference]: With dead ends: 38295 [2021-01-06 13:34:45,307 INFO L226 Difference]: Without dead ends: 22370 [2021-01-06 13:34:45,321 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:45,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22370 states. [2021-01-06 13:34:45,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22370 to 14266. [2021-01-06 13:34:45,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14266 states. [2021-01-06 13:34:45,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14266 states to 14266 states and 16175 transitions. [2021-01-06 13:34:45,571 INFO L78 Accepts]: Start accepts. Automaton has 14266 states and 16175 transitions. Word has length 298 [2021-01-06 13:34:45,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:45,571 INFO L481 AbstractCegarLoop]: Abstraction has 14266 states and 16175 transitions. [2021-01-06 13:34:45,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:45,572 INFO L276 IsEmpty]: Start isEmpty. Operand 14266 states and 16175 transitions. [2021-01-06 13:34:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2021-01-06 13:34:45,582 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:45,583 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:34:45,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 13:34:45,583 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:45,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:45,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1067278363, now seen corresponding path program 1 times [2021-01-06 13:34:45,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:45,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443449931] [2021-01-06 13:34:45,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 56 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:46,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443449931] [2021-01-06 13:34:46,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649497397] [2021-01-06 13:34:46,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:34:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:46,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 13:34:46,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:34:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-01-06 13:34:46,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:34:46,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-01-06 13:34:46,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967048998] [2021-01-06 13:34:46,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:46,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:46,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:46,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:34:46,999 INFO L87 Difference]: Start difference. First operand 14266 states and 16175 transitions. Second operand 3 states. [2021-01-06 13:34:48,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:48,289 INFO L93 Difference]: Finished difference Result 29266 states and 33183 transitions. [2021-01-06 13:34:48,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:48,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2021-01-06 13:34:48,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:48,317 INFO L225 Difference]: With dead ends: 29266 [2021-01-06 13:34:48,318 INFO L226 Difference]: Without dead ends: 15002 [2021-01-06 13:34:48,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:34:48,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15002 states. [2021-01-06 13:34:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15002 to 14634. [2021-01-06 13:34:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14634 states. [2021-01-06 13:34:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14634 states to 14634 states and 16559 transitions. [2021-01-06 13:34:48,708 INFO L78 Accepts]: Start accepts. Automaton has 14634 states and 16559 transitions. Word has length 311 [2021-01-06 13:34:48,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:48,709 INFO L481 AbstractCegarLoop]: Abstraction has 14634 states and 16559 transitions. [2021-01-06 13:34:48,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:48,709 INFO L276 IsEmpty]: Start isEmpty. Operand 14634 states and 16559 transitions. [2021-01-06 13:34:48,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2021-01-06 13:34:48,722 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:48,723 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:34:48,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-06 13:34:48,924 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:48,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:48,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1650248133, now seen corresponding path program 1 times [2021-01-06 13:34:48,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:48,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640301108] [2021-01-06 13:34:48,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:49,273 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-01-06 13:34:49,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640301108] [2021-01-06 13:34:49,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:49,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 13:34:49,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115513562] [2021-01-06 13:34:49,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:34:49,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:49,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:34:49,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:34:49,276 INFO L87 Difference]: Start difference. First operand 14634 states and 16559 transitions. Second operand 4 states. [2021-01-06 13:34:51,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:51,951 INFO L93 Difference]: Finished difference Result 36290 states and 41093 transitions. [2021-01-06 13:34:51,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:34:51,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2021-01-06 13:34:51,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:51,993 INFO L225 Difference]: With dead ends: 36290 [2021-01-06 13:34:51,993 INFO L226 Difference]: Without dead ends: 21474 [2021-01-06 13:34:52,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:34:52,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21474 states. [2021-01-06 13:34:52,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21474 to 19253. [2021-01-06 13:34:52,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19253 states. [2021-01-06 13:34:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19253 states to 19253 states and 21754 transitions. [2021-01-06 13:34:52,410 INFO L78 Accepts]: Start accepts. Automaton has 19253 states and 21754 transitions. Word has length 318 [2021-01-06 13:34:52,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:52,411 INFO L481 AbstractCegarLoop]: Abstraction has 19253 states and 21754 transitions. [2021-01-06 13:34:52,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:34:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 19253 states and 21754 transitions. [2021-01-06 13:34:52,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2021-01-06 13:34:52,423 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:52,424 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:34:52,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 13:34:52,424 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:52,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:52,425 INFO L82 PathProgramCache]: Analyzing trace with hash 623756768, now seen corresponding path program 1 times [2021-01-06 13:34:52,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:52,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414229374] [2021-01-06 13:34:52,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 57 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:52,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414229374] [2021-01-06 13:34:52,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916298829] [2021-01-06 13:34:52,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:34:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:52,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 13:34:52,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:34:53,230 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 13:34:53,454 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 57 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:53,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:34:53,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 6 [2021-01-06 13:34:53,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813022083] [2021-01-06 13:34:53,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 13:34:53,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:53,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 13:34:53,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:34:53,456 INFO L87 Difference]: Start difference. First operand 19253 states and 21754 transitions. Second operand 7 states. [2021-01-06 13:34:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:57,885 INFO L93 Difference]: Finished difference Result 58425 states and 65841 transitions. [2021-01-06 13:34:57,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 13:34:57,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 329 [2021-01-06 13:34:57,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:57,936 INFO L225 Difference]: With dead ends: 58425 [2021-01-06 13:34:57,936 INFO L226 Difference]: Without dead ends: 38805 [2021-01-06 13:34:57,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:34:57,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38805 states. [2021-01-06 13:34:58,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38805 to 34744. [2021-01-06 13:34:58,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34744 states. [2021-01-06 13:34:58,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34744 states to 34744 states and 38940 transitions. [2021-01-06 13:34:58,571 INFO L78 Accepts]: Start accepts. Automaton has 34744 states and 38940 transitions. Word has length 329 [2021-01-06 13:34:58,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:58,571 INFO L481 AbstractCegarLoop]: Abstraction has 34744 states and 38940 transitions. [2021-01-06 13:34:58,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 13:34:58,572 INFO L276 IsEmpty]: Start isEmpty. Operand 34744 states and 38940 transitions. [2021-01-06 13:34:58,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2021-01-06 13:34:58,598 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:58,598 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:34:58,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-06 13:34:58,812 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:58,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:58,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1046000135, now seen corresponding path program 1 times [2021-01-06 13:34:58,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:58,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627133482] [2021-01-06 13:34:58,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:59,229 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-01-06 13:34:59,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627133482] [2021-01-06 13:34:59,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:59,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:59,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674337303] [2021-01-06 13:34:59,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:34:59,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:59,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:34:59,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:34:59,232 INFO L87 Difference]: Start difference. First operand 34744 states and 38940 transitions. Second operand 4 states. [2021-01-06 13:35:01,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:01,200 INFO L93 Difference]: Finished difference Result 67276 states and 75366 transitions. [2021-01-06 13:35:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:35:01,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 401 [2021-01-06 13:35:01,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:01,248 INFO L225 Difference]: With dead ends: 67276 [2021-01-06 13:35:01,248 INFO L226 Difference]: Without dead ends: 34932 [2021-01-06 13:35:01,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:35:01,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34932 states. [2021-01-06 13:35:01,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34932 to 33272. [2021-01-06 13:35:01,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2021-01-06 13:35:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 37133 transitions. [2021-01-06 13:35:02,030 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 37133 transitions. Word has length 401 [2021-01-06 13:35:02,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:02,030 INFO L481 AbstractCegarLoop]: Abstraction has 33272 states and 37133 transitions. [2021-01-06 13:35:02,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:35:02,030 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 37133 transitions. [2021-01-06 13:35:02,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2021-01-06 13:35:02,052 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:02,052 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:02,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 13:35:02,053 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:02,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:02,053 INFO L82 PathProgramCache]: Analyzing trace with hash 830831852, now seen corresponding path program 1 times [2021-01-06 13:35:02,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:02,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480284829] [2021-01-06 13:35:02,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2021-01-06 13:35:02,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480284829] [2021-01-06 13:35:02,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:35:02,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:35:02,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210792550] [2021-01-06 13:35:02,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:35:02,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:02,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:35:02,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:02,495 INFO L87 Difference]: Start difference. First operand 33272 states and 37133 transitions. Second operand 3 states. [2021-01-06 13:35:04,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:04,167 INFO L93 Difference]: Finished difference Result 65615 states and 73227 transitions. [2021-01-06 13:35:04,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:35:04,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 404 [2021-01-06 13:35:04,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:04,205 INFO L225 Difference]: With dead ends: 65615 [2021-01-06 13:35:04,206 INFO L226 Difference]: Without dead ends: 34742 [2021-01-06 13:35:04,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:04,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34742 states. [2021-01-06 13:35:04,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34742 to 30673. [2021-01-06 13:35:04,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30673 states. [2021-01-06 13:35:04,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30673 states to 30673 states and 34099 transitions. [2021-01-06 13:35:04,717 INFO L78 Accepts]: Start accepts. Automaton has 30673 states and 34099 transitions. Word has length 404 [2021-01-06 13:35:04,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:04,718 INFO L481 AbstractCegarLoop]: Abstraction has 30673 states and 34099 transitions. [2021-01-06 13:35:04,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:35:04,718 INFO L276 IsEmpty]: Start isEmpty. Operand 30673 states and 34099 transitions. [2021-01-06 13:35:04,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2021-01-06 13:35:04,737 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:04,738 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:04,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 13:35:04,738 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:04,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:04,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1524508717, now seen corresponding path program 1 times [2021-01-06 13:35:04,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:04,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139229103] [2021-01-06 13:35:04,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:05,530 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 86 proven. 226 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-01-06 13:35:05,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139229103] [2021-01-06 13:35:05,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541919833] [2021-01-06 13:35:05,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:35:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:05,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 13:35:05,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:35:06,360 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-01-06 13:35:06,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:35:06,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 13:35:06,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804866100] [2021-01-06 13:35:06,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:35:06,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:06,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:35:06,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:35:06,363 INFO L87 Difference]: Start difference. First operand 30673 states and 34099 transitions. Second operand 4 states. [2021-01-06 13:35:08,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:08,822 INFO L93 Difference]: Finished difference Result 70188 states and 78144 transitions. [2021-01-06 13:35:08,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:35:08,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 429 [2021-01-06 13:35:08,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:08,863 INFO L225 Difference]: With dead ends: 70188 [2021-01-06 13:35:08,863 INFO L226 Difference]: Without dead ends: 39885 [2021-01-06 13:35:08,882 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:35:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39885 states. [2021-01-06 13:35:09,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39885 to 34360. [2021-01-06 13:35:09,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34360 states. [2021-01-06 13:35:09,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34360 states to 34360 states and 38184 transitions. [2021-01-06 13:35:09,383 INFO L78 Accepts]: Start accepts. Automaton has 34360 states and 38184 transitions. Word has length 429 [2021-01-06 13:35:09,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:09,384 INFO L481 AbstractCegarLoop]: Abstraction has 34360 states and 38184 transitions. [2021-01-06 13:35:09,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:35:09,384 INFO L276 IsEmpty]: Start isEmpty. Operand 34360 states and 38184 transitions. [2021-01-06 13:35:09,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2021-01-06 13:35:09,401 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:09,401 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:09,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-06 13:35:09,608 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:09,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:09,609 INFO L82 PathProgramCache]: Analyzing trace with hash 904880191, now seen corresponding path program 1 times [2021-01-06 13:35:09,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:09,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440728277] [2021-01-06 13:35:09,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 339 proven. 179 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-01-06 13:35:10,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440728277] [2021-01-06 13:35:10,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718288423] [2021-01-06 13:35:10,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:35:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:10,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 13:35:10,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:35:11,019 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2021-01-06 13:35:11,019 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:35:11,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-06 13:35:11,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191197905] [2021-01-06 13:35:11,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:35:11,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:11,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:35:11,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 13:35:11,022 INFO L87 Difference]: Start difference. First operand 34360 states and 38184 transitions. Second operand 3 states. [2021-01-06 13:35:12,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:12,445 INFO L93 Difference]: Finished difference Result 69818 states and 77574 transitions. [2021-01-06 13:35:12,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:35:12,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 449 [2021-01-06 13:35:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:12,486 INFO L225 Difference]: With dead ends: 69818 [2021-01-06 13:35:12,487 INFO L226 Difference]: Without dead ends: 35644 [2021-01-06 13:35:12,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 13:35:12,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35644 states. [2021-01-06 13:35:12,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35644 to 33614. [2021-01-06 13:35:12,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33614 states. [2021-01-06 13:35:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33614 states to 33614 states and 37180 transitions. [2021-01-06 13:35:13,029 INFO L78 Accepts]: Start accepts. Automaton has 33614 states and 37180 transitions. Word has length 449 [2021-01-06 13:35:13,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:13,030 INFO L481 AbstractCegarLoop]: Abstraction has 33614 states and 37180 transitions. [2021-01-06 13:35:13,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:35:13,030 INFO L276 IsEmpty]: Start isEmpty. Operand 33614 states and 37180 transitions. [2021-01-06 13:35:13,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2021-01-06 13:35:13,047 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:13,048 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:13,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:35:13,254 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:13,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:13,255 INFO L82 PathProgramCache]: Analyzing trace with hash -563407623, now seen corresponding path program 1 times [2021-01-06 13:35:13,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:13,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78718954] [2021-01-06 13:35:13,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2021-01-06 13:35:13,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78718954] [2021-01-06 13:35:13,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:35:13,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:35:13,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150029395] [2021-01-06 13:35:13,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:35:13,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:13,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:35:13,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:13,824 INFO L87 Difference]: Start difference. First operand 33614 states and 37180 transitions. Second operand 3 states. [2021-01-06 13:35:15,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:15,386 INFO L93 Difference]: Finished difference Result 70016 states and 77542 transitions. [2021-01-06 13:35:15,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:35:15,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 467 [2021-01-06 13:35:15,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:15,423 INFO L225 Difference]: With dead ends: 70016 [2021-01-06 13:35:15,423 INFO L226 Difference]: Without dead ends: 37140 [2021-01-06 13:35:15,443 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:15,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37140 states. [2021-01-06 13:35:15,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37140 to 36217. [2021-01-06 13:35:15,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36217 states. [2021-01-06 13:35:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36217 states to 36217 states and 39710 transitions. [2021-01-06 13:35:15,935 INFO L78 Accepts]: Start accepts. Automaton has 36217 states and 39710 transitions. Word has length 467 [2021-01-06 13:35:15,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:15,936 INFO L481 AbstractCegarLoop]: Abstraction has 36217 states and 39710 transitions. [2021-01-06 13:35:15,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:35:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 36217 states and 39710 transitions. [2021-01-06 13:35:15,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2021-01-06 13:35:15,950 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:15,951 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:15,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 13:35:15,951 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:15,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:15,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1347349967, now seen corresponding path program 1 times [2021-01-06 13:35:15,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:15,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424732185] [2021-01-06 13:35:15,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 86 proven. 252 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-01-06 13:35:16,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424732185] [2021-01-06 13:35:16,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398815812] [2021-01-06 13:35:16,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:35:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:16,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 13:35:16,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:35:17,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 13:35:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 86 proven. 252 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-01-06 13:35:17,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:35:17,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 6 [2021-01-06 13:35:17,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068696707] [2021-01-06 13:35:17,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 13:35:17,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:17,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 13:35:17,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:35:17,746 INFO L87 Difference]: Start difference. First operand 36217 states and 39710 transitions. Second operand 7 states. [2021-01-06 13:35:22,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:22,340 INFO L93 Difference]: Finished difference Result 47837 states and 52324 transitions. [2021-01-06 13:35:22,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 13:35:22,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 467 [2021-01-06 13:35:22,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:22,389 INFO L225 Difference]: With dead ends: 47837 [2021-01-06 13:35:22,390 INFO L226 Difference]: Without dead ends: 47835 [2021-01-06 13:35:22,401 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:35:22,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47835 states. [2021-01-06 13:35:22,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47835 to 36217. [2021-01-06 13:35:22,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36217 states. [2021-01-06 13:35:22,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36217 states to 36217 states and 39710 transitions. [2021-01-06 13:35:22,829 INFO L78 Accepts]: Start accepts. Automaton has 36217 states and 39710 transitions. Word has length 467 [2021-01-06 13:35:22,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:22,829 INFO L481 AbstractCegarLoop]: Abstraction has 36217 states and 39710 transitions. [2021-01-06 13:35:22,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 13:35:22,830 INFO L276 IsEmpty]: Start isEmpty. Operand 36217 states and 39710 transitions. [2021-01-06 13:35:22,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2021-01-06 13:35:22,852 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:22,852 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:23,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-01-06 13:35:23,066 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:23,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:23,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1279621825, now seen corresponding path program 1 times [2021-01-06 13:35:23,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:23,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902273384] [2021-01-06 13:35:23,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:23,589 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2021-01-06 13:35:23,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902273384] [2021-01-06 13:35:23,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:35:23,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 13:35:23,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847038711] [2021-01-06 13:35:23,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:35:23,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:23,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:35:23,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:35:23,591 INFO L87 Difference]: Start difference. First operand 36217 states and 39710 transitions. Second operand 4 states. [2021-01-06 13:35:26,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:26,025 INFO L93 Difference]: Finished difference Result 72437 states and 79346 transitions. [2021-01-06 13:35:26,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:35:26,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 496 [2021-01-06 13:35:26,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:26,077 INFO L225 Difference]: With dead ends: 72437 [2021-01-06 13:35:26,077 INFO L226 Difference]: Without dead ends: 37327 [2021-01-06 13:35:26,098 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:35:26,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37327 states. [2021-01-06 13:35:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37327 to 27155. [2021-01-06 13:35:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27155 states. [2021-01-06 13:35:26,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27155 states to 27155 states and 29540 transitions. [2021-01-06 13:35:26,434 INFO L78 Accepts]: Start accepts. Automaton has 27155 states and 29540 transitions. Word has length 496 [2021-01-06 13:35:26,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:26,434 INFO L481 AbstractCegarLoop]: Abstraction has 27155 states and 29540 transitions. [2021-01-06 13:35:26,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:35:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 27155 states and 29540 transitions. [2021-01-06 13:35:26,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2021-01-06 13:35:26,457 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:26,457 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:26,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 13:35:26,458 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:26,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:26,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1494685698, now seen corresponding path program 1 times [2021-01-06 13:35:26,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:26,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706103238] [2021-01-06 13:35:26,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 261 proven. 142 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-01-06 13:35:27,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706103238] [2021-01-06 13:35:27,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152508953] [2021-01-06 13:35:27,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:35:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:27,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 13:35:27,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:35:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 86 proven. 317 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-01-06 13:35:28,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:35:28,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2021-01-06 13:35:28,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532271865] [2021-01-06 13:35:28,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 13:35:28,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:28,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 13:35:28,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-06 13:35:28,813 INFO L87 Difference]: Start difference. First operand 27155 states and 29540 transitions. Second operand 8 states. [2021-01-06 13:35:33,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:33,182 INFO L93 Difference]: Finished difference Result 53363 states and 58120 transitions. [2021-01-06 13:35:33,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 13:35:33,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 520 [2021-01-06 13:35:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:33,222 INFO L225 Difference]: With dead ends: 53363 [2021-01-06 13:35:33,223 INFO L226 Difference]: Without dead ends: 26393 [2021-01-06 13:35:33,244 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-01-06 13:35:33,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26393 states. [2021-01-06 13:35:33,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26393 to 25279. [2021-01-06 13:35:33,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25279 states. [2021-01-06 13:35:33,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25279 states to 25279 states and 27516 transitions. [2021-01-06 13:35:33,643 INFO L78 Accepts]: Start accepts. Automaton has 25279 states and 27516 transitions. Word has length 520 [2021-01-06 13:35:33,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:33,644 INFO L481 AbstractCegarLoop]: Abstraction has 25279 states and 27516 transitions. [2021-01-06 13:35:33,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 13:35:33,644 INFO L276 IsEmpty]: Start isEmpty. Operand 25279 states and 27516 transitions. [2021-01-06 13:35:33,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2021-01-06 13:35:33,667 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:33,667 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:33,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:35:33,881 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:33,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:33,882 INFO L82 PathProgramCache]: Analyzing trace with hash -313751130, now seen corresponding path program 1 times [2021-01-06 13:35:33,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:33,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253360370] [2021-01-06 13:35:33,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:34,290 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 617 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2021-01-06 13:35:34,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253360370] [2021-01-06 13:35:34,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:35:34,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:35:34,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237111065] [2021-01-06 13:35:34,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:35:34,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:34,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:35:34,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:34,293 INFO L87 Difference]: Start difference. First operand 25279 states and 27516 transitions. Second operand 3 states. [2021-01-06 13:35:35,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:35,691 INFO L93 Difference]: Finished difference Result 47792 states and 52037 transitions. [2021-01-06 13:35:35,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:35:35,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 533 [2021-01-06 13:35:35,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:35,725 INFO L225 Difference]: With dead ends: 47792 [2021-01-06 13:35:35,725 INFO L226 Difference]: Without dead ends: 25279 [2021-01-06 13:35:35,743 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:35,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25279 states. [2021-01-06 13:35:35,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25279 to 24727. [2021-01-06 13:35:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24727 states. [2021-01-06 13:35:36,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24727 states to 24727 states and 26845 transitions. [2021-01-06 13:35:36,005 INFO L78 Accepts]: Start accepts. Automaton has 24727 states and 26845 transitions. Word has length 533 [2021-01-06 13:35:36,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:36,005 INFO L481 AbstractCegarLoop]: Abstraction has 24727 states and 26845 transitions. [2021-01-06 13:35:36,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:35:36,005 INFO L276 IsEmpty]: Start isEmpty. Operand 24727 states and 26845 transitions. [2021-01-06 13:35:36,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2021-01-06 13:35:36,021 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:36,022 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:36,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 13:35:36,022 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:36,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:36,023 INFO L82 PathProgramCache]: Analyzing trace with hash -550112838, now seen corresponding path program 1 times [2021-01-06 13:35:36,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:36,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805276662] [2021-01-06 13:35:36,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:36,708 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2021-01-06 13:35:36,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805276662] [2021-01-06 13:35:36,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:35:36,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 13:35:36,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115158359] [2021-01-06 13:35:36,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 13:35:36,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:36,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 13:35:36,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 13:35:36,710 INFO L87 Difference]: Start difference. First operand 24727 states and 26845 transitions. Second operand 5 states. [2021-01-06 13:35:39,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:39,597 INFO L93 Difference]: Finished difference Result 36344 states and 39382 transitions. [2021-01-06 13:35:39,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 13:35:39,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 541 [2021-01-06 13:35:39,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:39,635 INFO L225 Difference]: With dead ends: 36344 [2021-01-06 13:35:39,636 INFO L226 Difference]: Without dead ends: 36342 [2021-01-06 13:35:39,646 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 13:35:39,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36342 states. [2021-01-06 13:35:40,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36342 to 28967. [2021-01-06 13:35:40,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28967 states. [2021-01-06 13:35:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28967 states to 28967 states and 31453 transitions. [2021-01-06 13:35:40,054 INFO L78 Accepts]: Start accepts. Automaton has 28967 states and 31453 transitions. Word has length 541 [2021-01-06 13:35:40,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:40,054 INFO L481 AbstractCegarLoop]: Abstraction has 28967 states and 31453 transitions. [2021-01-06 13:35:40,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 13:35:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 28967 states and 31453 transitions. [2021-01-06 13:35:40,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2021-01-06 13:35:40,072 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:40,073 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:40,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 13:35:40,073 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:40,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:40,074 INFO L82 PathProgramCache]: Analyzing trace with hash 348163194, now seen corresponding path program 1 times [2021-01-06 13:35:40,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:40,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247981954] [2021-01-06 13:35:40,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:40,890 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 29 proven. 394 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2021-01-06 13:35:40,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247981954] [2021-01-06 13:35:40,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680359523] [2021-01-06 13:35:40,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:35:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:41,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 13:35:41,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:35:41,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 13:35:42,133 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 29 proven. 394 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2021-01-06 13:35:42,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:35:42,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2021-01-06 13:35:42,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333102669] [2021-01-06 13:35:42,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 13:35:42,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:42,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 13:35:42,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-06 13:35:42,135 INFO L87 Difference]: Start difference. First operand 28967 states and 31453 transitions. Second operand 9 states. [2021-01-06 13:35:48,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:48,631 INFO L93 Difference]: Finished difference Result 78028 states and 84663 transitions. [2021-01-06 13:35:48,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 13:35:48,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 555 [2021-01-06 13:35:48,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:48,688 INFO L225 Difference]: With dead ends: 78028 [2021-01-06 13:35:48,688 INFO L226 Difference]: Without dead ends: 51459 [2021-01-06 13:35:48,708 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-01-06 13:35:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51459 states. [2021-01-06 13:35:49,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51459 to 47223. [2021-01-06 13:35:49,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47223 states. [2021-01-06 13:35:49,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47223 states to 47223 states and 51287 transitions. [2021-01-06 13:35:49,229 INFO L78 Accepts]: Start accepts. Automaton has 47223 states and 51287 transitions. Word has length 555 [2021-01-06 13:35:49,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:49,229 INFO L481 AbstractCegarLoop]: Abstraction has 47223 states and 51287 transitions. [2021-01-06 13:35:49,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 13:35:49,230 INFO L276 IsEmpty]: Start isEmpty. Operand 47223 states and 51287 transitions. [2021-01-06 13:35:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2021-01-06 13:35:49,256 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:49,256 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:49,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-01-06 13:35:49,458 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:49,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:49,459 INFO L82 PathProgramCache]: Analyzing trace with hash -293700836, now seen corresponding path program 1 times [2021-01-06 13:35:49,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:49,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790271344] [2021-01-06 13:35:49,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:50,342 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2021-01-06 13:35:50,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790271344] [2021-01-06 13:35:50,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:35:50,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:35:50,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041927958] [2021-01-06 13:35:50,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:35:50,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:50,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:35:50,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:35:50,344 INFO L87 Difference]: Start difference. First operand 47223 states and 51287 transitions. Second operand 4 states. [2021-01-06 13:35:53,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:53,237 INFO L93 Difference]: Finished difference Result 106787 states and 116167 transitions. [2021-01-06 13:35:53,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:35:53,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 576 [2021-01-06 13:35:53,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:53,307 INFO L225 Difference]: With dead ends: 106787 [2021-01-06 13:35:53,307 INFO L226 Difference]: Without dead ends: 59933 [2021-01-06 13:35:53,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:35:53,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59933 states. [2021-01-06 13:35:54,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59933 to 55871. [2021-01-06 13:35:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55871 states. [2021-01-06 13:35:54,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55871 states to 55871 states and 59932 transitions. [2021-01-06 13:35:54,227 INFO L78 Accepts]: Start accepts. Automaton has 55871 states and 59932 transitions. Word has length 576 [2021-01-06 13:35:54,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:54,228 INFO L481 AbstractCegarLoop]: Abstraction has 55871 states and 59932 transitions. [2021-01-06 13:35:54,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:35:54,228 INFO L276 IsEmpty]: Start isEmpty. Operand 55871 states and 59932 transitions. [2021-01-06 13:35:54,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2021-01-06 13:35:54,250 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:54,250 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:54,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 13:35:54,250 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:54,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:54,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1618246653, now seen corresponding path program 1 times [2021-01-06 13:35:54,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:54,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830997695] [2021-01-06 13:35:54,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:54,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1000 backedges. 762 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2021-01-06 13:35:54,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830997695] [2021-01-06 13:35:54,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:35:54,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:35:54,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705853451] [2021-01-06 13:35:54,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:35:54,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:54,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:35:54,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:54,992 INFO L87 Difference]: Start difference. First operand 55871 states and 59932 transitions. Second operand 3 states. [2021-01-06 13:35:56,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:56,698 INFO L93 Difference]: Finished difference Result 109344 states and 117331 transitions. [2021-01-06 13:35:56,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:35:56,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 578 [2021-01-06 13:35:56,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:56,758 INFO L225 Difference]: With dead ends: 109344 [2021-01-06 13:35:56,759 INFO L226 Difference]: Without dead ends: 56239 [2021-01-06 13:35:56,778 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:56,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56239 states. [2021-01-06 13:35:57,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56239 to 55503. [2021-01-06 13:35:57,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55503 states. [2021-01-06 13:35:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55503 states to 55503 states and 59499 transitions. [2021-01-06 13:35:57,727 INFO L78 Accepts]: Start accepts. Automaton has 55503 states and 59499 transitions. Word has length 578 [2021-01-06 13:35:57,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:57,728 INFO L481 AbstractCegarLoop]: Abstraction has 55503 states and 59499 transitions. [2021-01-06 13:35:57,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:35:57,728 INFO L276 IsEmpty]: Start isEmpty. Operand 55503 states and 59499 transitions. [2021-01-06 13:35:57,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2021-01-06 13:35:57,771 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:57,772 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:57,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 13:35:57,772 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:57,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:57,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1149354582, now seen corresponding path program 1 times [2021-01-06 13:35:57,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:57,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680460631] [2021-01-06 13:35:57,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:58,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 840 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2021-01-06 13:35:58,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680460631] [2021-01-06 13:35:58,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:35:58,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:35:58,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419103224] [2021-01-06 13:35:58,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:35:58,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:58,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:35:58,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:58,745 INFO L87 Difference]: Start difference. First operand 55503 states and 59499 transitions. Second operand 3 states. [2021-01-06 13:36:00,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:36:00,446 INFO L93 Difference]: Finished difference Result 112658 states and 120782 transitions. [2021-01-06 13:36:00,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:36:00,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 653 [2021-01-06 13:36:00,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:36:00,513 INFO L225 Difference]: With dead ends: 112658 [2021-01-06 13:36:00,514 INFO L226 Difference]: Without dead ends: 57525 [2021-01-06 13:36:00,547 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:36:00,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57525 states. [2021-01-06 13:36:01,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57525 to 38187. [2021-01-06 13:36:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38187 states. [2021-01-06 13:36:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38187 states to 38187 states and 40636 transitions. [2021-01-06 13:36:01,468 INFO L78 Accepts]: Start accepts. Automaton has 38187 states and 40636 transitions. Word has length 653 [2021-01-06 13:36:01,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:36:01,469 INFO L481 AbstractCegarLoop]: Abstraction has 38187 states and 40636 transitions. [2021-01-06 13:36:01,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:36:01,469 INFO L276 IsEmpty]: Start isEmpty. Operand 38187 states and 40636 transitions. [2021-01-06 13:36:01,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2021-01-06 13:36:01,495 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:36:01,496 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:36:01,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 13:36:01,496 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:36:01,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:36:01,497 INFO L82 PathProgramCache]: Analyzing trace with hash -2110969161, now seen corresponding path program 1 times [2021-01-06 13:36:01,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:36:01,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039185815] [2021-01-06 13:36:01,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:36:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:36:02,534 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 153 proven. 843 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:36:02,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039185815] [2021-01-06 13:36:02,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685629679] [2021-01-06 13:36:02,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:36:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:36:02,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 11 conjunts are in the unsatisfiable core [2021-01-06 13:36:02,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:36:03,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 13:36:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 29 proven. 967 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:36:04,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:36:04,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2021-01-06 13:36:04,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892451435] [2021-01-06 13:36:04,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 13:36:04,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:36:04,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 13:36:04,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-01-06 13:36:04,100 INFO L87 Difference]: Start difference. First operand 38187 states and 40636 transitions. Second operand 13 states. [2021-01-06 13:36:14,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:36:14,105 INFO L93 Difference]: Finished difference Result 104401 states and 110969 transitions. [2021-01-06 13:36:14,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 13:36:14,106 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 672 [2021-01-06 13:36:14,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:36:14,177 INFO L225 Difference]: With dead ends: 104401 [2021-01-06 13:36:14,177 INFO L226 Difference]: Without dead ends: 67322 [2021-01-06 13:36:14,201 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 679 GetRequests, 666 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-01-06 13:36:14,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67322 states. [2021-01-06 13:36:15,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67322 to 43173. [2021-01-06 13:36:15,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43173 states. [2021-01-06 13:36:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43173 states to 43173 states and 45916 transitions. [2021-01-06 13:36:15,220 INFO L78 Accepts]: Start accepts. Automaton has 43173 states and 45916 transitions. Word has length 672 [2021-01-06 13:36:15,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:36:15,220 INFO L481 AbstractCegarLoop]: Abstraction has 43173 states and 45916 transitions. [2021-01-06 13:36:15,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 13:36:15,220 INFO L276 IsEmpty]: Start isEmpty. Operand 43173 states and 45916 transitions. [2021-01-06 13:36:15,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2021-01-06 13:36:15,247 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:36:15,247 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:36:15,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:36:15,461 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:36:15,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:36:15,462 INFO L82 PathProgramCache]: Analyzing trace with hash -40752651, now seen corresponding path program 1 times [2021-01-06 13:36:15,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:36:15,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520690658] [2021-01-06 13:36:15,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:36:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:36:16,515 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 673 proven. 198 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-01-06 13:36:16,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520690658] [2021-01-06 13:36:16,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928162956] [2021-01-06 13:36:16,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 13:36:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:36:16,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 13:36:16,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:36:17,113 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 13:36:17,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 13:36:17,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 13:36:17,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 13:36:17,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 13:36:17,373 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 13:36:17,376 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 13:36:17,388 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 13:36:17,391 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 13:36:17,403 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 13:36:17,405 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 13:36:17,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 13:36:17,525 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:17,815 INFO L757 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:18,142 INFO L757 QuantifierPusher]: Run 30 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:18,440 INFO L757 QuantifierPusher]: Run 40 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:18,660 INFO L757 QuantifierPusher]: Run 50 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:18,931 INFO L757 QuantifierPusher]: Run 60 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:19,378 INFO L757 QuantifierPusher]: Run 70 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:20,253 INFO L757 QuantifierPusher]: Run 80 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:21,527 INFO L757 QuantifierPusher]: Run 90 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:22,905 INFO L757 QuantifierPusher]: Run 100 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:24,674 INFO L757 QuantifierPusher]: Run 110 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:27,182 INFO L757 QuantifierPusher]: Run 120 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:29,985 INFO L757 QuantifierPusher]: Run 130 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:33,298 INFO L757 QuantifierPusher]: Run 140 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:36,774 INFO L757 QuantifierPusher]: Run 150 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:40,820 INFO L757 QuantifierPusher]: Run 160 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug.