/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_label24.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 13:34:11,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 13:34:11,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 13:34:11,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 13:34:11,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 13:34:11,898 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 13:34:11,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 13:34:11,902 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 13:34:11,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 13:34:11,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 13:34:11,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 13:34:11,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 13:34:11,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 13:34:11,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 13:34:11,922 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 13:34:11,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 13:34:11,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 13:34:11,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 13:34:11,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 13:34:11,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 13:34:11,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 13:34:11,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 13:34:11,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 13:34:11,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 13:34:11,958 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 13:34:11,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 13:34:11,959 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 13:34:11,960 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 13:34:11,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 13:34:11,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 13:34:11,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 13:34:11,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 13:34:11,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 13:34:11,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 13:34:11,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 13:34:11,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 13:34:11,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 13:34:11,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 13:34:11,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 13:34:11,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 13:34:11,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 13:34:11,971 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:12,003 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 13:34:12,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 13:34:12,005 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 13:34:12,006 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 13:34:12,006 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 13:34:12,006 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 13:34:12,007 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 13:34:12,007 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 13:34:12,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 13:34:12,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 13:34:12,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 13:34:12,008 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 13:34:12,008 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 13:34:12,008 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 13:34:12,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 13:34:12,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 13:34:12,009 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 13:34:12,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 13:34:12,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 13:34:12,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 13:34:12,010 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 13:34:12,010 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 13:34:12,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 13:34:12,011 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 13:34:12,011 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 13:34:12,011 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:12,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 13:34:12,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 13:34:12,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 13:34:12,403 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 13:34:12,403 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 13:34:12,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label24.c [2021-01-06 13:34:12,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f3330f798/9baaafc5e57e41a1a7b808214848b593/FLAG0ee10e466 [2021-01-06 13:34:13,353 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 13:34:13,354 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label24.c [2021-01-06 13:34:13,374 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f3330f798/9baaafc5e57e41a1a7b808214848b593/FLAG0ee10e466 [2021-01-06 13:34:13,393 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/f3330f798/9baaafc5e57e41a1a7b808214848b593 [2021-01-06 13:34:13,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 13:34:13,398 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 13:34:13,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 13:34:13,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 13:34:13,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 13:34:13,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 01:34:13" (1/1) ... [2021-01-06 13:34:13,406 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28da138b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:13, skipping insertion in model container [2021-01-06 13:34:13,406 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 01:34:13" (1/1) ... [2021-01-06 13:34:13,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 13:34:13,484 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 13:34:13,709 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_label24.c[7451,7464] 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:14,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 13:34:14,191 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 13:34:14,256 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_label24.c[7451,7464] 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:14,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 13:34:14,444 INFO L208 MainTranslator]: Completed translation [2021-01-06 13:34:14,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:14 WrapperNode [2021-01-06 13:34:14,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 13:34:14,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 13:34:14,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 13:34:14,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 13:34:14,455 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:14" (1/1) ... [2021-01-06 13:34:14,506 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:14" (1/1) ... [2021-01-06 13:34:14,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 13:34:14,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 13:34:14,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 13:34:14,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 13:34:14,641 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:14" (1/1) ... [2021-01-06 13:34:14,642 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:14" (1/1) ... [2021-01-06 13:34:14,653 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:14" (1/1) ... [2021-01-06 13:34:14,653 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:14" (1/1) ... [2021-01-06 13:34:14,698 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:14" (1/1) ... [2021-01-06 13:34:14,711 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:14" (1/1) ... [2021-01-06 13:34:14,726 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:14" (1/1) ... [2021-01-06 13:34:14,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 13:34:14,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 13:34:14,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 13:34:14,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 13:34:14,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:14" (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:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 13:34:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 13:34:14,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 13:34:14,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 13:34:16,671 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 13:34:16,671 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 13:34:16,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 01:34:16 BoogieIcfgContainer [2021-01-06 13:34:16,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 13:34:16,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 13:34:16,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 13:34:16,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 13:34:16,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 01:34:13" (1/3) ... [2021-01-06 13:34:16,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ebf4c82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 01:34:16, skipping insertion in model container [2021-01-06 13:34:16,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 01:34:14" (2/3) ... [2021-01-06 13:34:16,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ebf4c82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 01:34:16, skipping insertion in model container [2021-01-06 13:34:16,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 01:34:16" (3/3) ... [2021-01-06 13:34:16,683 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem11_label24.c [2021-01-06 13:34:16,689 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 13:34:16,695 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 13:34:16,714 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 13:34:16,742 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 13:34:16,743 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 13:34:16,743 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 13:34:16,743 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 13:34:16,743 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 13:34:16,743 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 13:34:16,743 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 13:34:16,744 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 13:34:16,764 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2021-01-06 13:34:16,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 13:34:16,773 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:16,774 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, 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:16,774 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:16,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:16,781 INFO L82 PathProgramCache]: Analyzing trace with hash 2122806209, now seen corresponding path program 1 times [2021-01-06 13:34:16,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:16,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704729112] [2021-01-06 13:34:16,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:17,168 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:17,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704729112] [2021-01-06 13:34:17,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:17,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:34:17,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971531592] [2021-01-06 13:34:17,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:17,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:17,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:17,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:17,199 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 3 states. [2021-01-06 13:34:18,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:18,586 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2021-01-06 13:34:18,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:18,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2021-01-06 13:34:18,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:18,620 INFO L225 Difference]: With dead ends: 761 [2021-01-06 13:34:18,620 INFO L226 Difference]: Without dead ends: 413 [2021-01-06 13:34:18,625 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:18,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-01-06 13:34:18,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2021-01-06 13:34:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2021-01-06 13:34:18,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2021-01-06 13:34:18,699 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 51 [2021-01-06 13:34:18,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:18,700 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2021-01-06 13:34:18,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:18,700 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2021-01-06 13:34:18,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-01-06 13:34:18,706 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:18,706 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, 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] [2021-01-06 13:34:18,706 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 13:34:18,707 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:18,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:18,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1424628072, now seen corresponding path program 1 times [2021-01-06 13:34:18,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:18,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118318436] [2021-01-06 13:34:18,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:18,962 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:18,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118318436] [2021-01-06 13:34:18,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:18,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:34:18,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630371575] [2021-01-06 13:34:18,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:18,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:18,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:18,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:18,969 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand 3 states. [2021-01-06 13:34:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:20,060 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2021-01-06 13:34:20,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:20,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2021-01-06 13:34:20,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:20,067 INFO L225 Difference]: With dead ends: 1211 [2021-01-06 13:34:20,067 INFO L226 Difference]: Without dead ends: 800 [2021-01-06 13:34:20,069 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,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2021-01-06 13:34:20,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2021-01-06 13:34:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2021-01-06 13:34:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions. [2021-01-06 13:34:20,130 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 119 [2021-01-06 13:34:20,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:20,131 INFO L481 AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions. [2021-01-06 13:34:20,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:20,131 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions. [2021-01-06 13:34:20,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-06 13:34:20,137 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:20,137 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, 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] [2021-01-06 13:34:20,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 13:34:20,138 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:20,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:20,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1033925576, now seen corresponding path program 1 times [2021-01-06 13:34:20,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:20,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629191596] [2021-01-06 13:34:20,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:20,385 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:20,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629191596] [2021-01-06 13:34:20,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:20,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:20,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573257720] [2021-01-06 13:34:20,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:34:20,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:20,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:34:20,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:34:20,402 INFO L87 Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand 4 states. [2021-01-06 13:34:22,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:22,508 INFO L93 Difference]: Finished difference Result 2505 states and 3428 transitions. [2021-01-06 13:34:22,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:34:22,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2021-01-06 13:34:22,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:22,520 INFO L225 Difference]: With dead ends: 2505 [2021-01-06 13:34:22,521 INFO L226 Difference]: Without dead ends: 1718 [2021-01-06 13:34:22,524 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:22,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2021-01-06 13:34:22,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1714. [2021-01-06 13:34:22,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1714 states. [2021-01-06 13:34:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2101 transitions. [2021-01-06 13:34:22,575 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2101 transitions. Word has length 120 [2021-01-06 13:34:22,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:22,576 INFO L481 AbstractCegarLoop]: Abstraction has 1714 states and 2101 transitions. [2021-01-06 13:34:22,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:34:22,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2101 transitions. [2021-01-06 13:34:22,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 13:34:22,584 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:22,584 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, 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] [2021-01-06 13:34:22,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 13:34:22,585 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:22,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:22,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1823083661, now seen corresponding path program 1 times [2021-01-06 13:34:22,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:22,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804300489] [2021-01-06 13:34:22,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:22,775 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:22,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804300489] [2021-01-06 13:34:22,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:22,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:22,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379990788] [2021-01-06 13:34:22,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:22,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:22,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:22,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:22,783 INFO L87 Difference]: Start difference. First operand 1714 states and 2101 transitions. Second operand 3 states. [2021-01-06 13:34:23,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:23,973 INFO L93 Difference]: Finished difference Result 4005 states and 5048 transitions. [2021-01-06 13:34:23,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:23,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2021-01-06 13:34:23,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:23,987 INFO L225 Difference]: With dead ends: 4005 [2021-01-06 13:34:23,988 INFO L226 Difference]: Without dead ends: 2477 [2021-01-06 13:34:23,990 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:23,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2021-01-06 13:34:24,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2474. [2021-01-06 13:34:24,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2474 states. [2021-01-06 13:34:24,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3044 transitions. [2021-01-06 13:34:24,049 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3044 transitions. Word has length 178 [2021-01-06 13:34:24,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:24,050 INFO L481 AbstractCegarLoop]: Abstraction has 2474 states and 3044 transitions. [2021-01-06 13:34:24,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:24,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3044 transitions. [2021-01-06 13:34:24,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2021-01-06 13:34:24,056 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:24,056 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 13:34:24,057 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:24,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:24,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1160646091, now seen corresponding path program 1 times [2021-01-06 13:34:24,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:24,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038643119] [2021-01-06 13:34:24,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:24,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038643119] [2021-01-06 13:34:24,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:24,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:24,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528457123] [2021-01-06 13:34:24,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:24,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:24,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:24,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:24,286 INFO L87 Difference]: Start difference. First operand 2474 states and 3044 transitions. Second operand 3 states. [2021-01-06 13:34:25,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:25,414 INFO L93 Difference]: Finished difference Result 5885 states and 7350 transitions. [2021-01-06 13:34:25,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:25,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2021-01-06 13:34:25,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:25,432 INFO L225 Difference]: With dead ends: 5885 [2021-01-06 13:34:25,432 INFO L226 Difference]: Without dead ends: 3597 [2021-01-06 13:34:25,436 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:25,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3597 states. [2021-01-06 13:34:25,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3597 to 3397. [2021-01-06 13:34:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3397 states. [2021-01-06 13:34:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4111 transitions. [2021-01-06 13:34:25,524 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 4111 transitions. Word has length 231 [2021-01-06 13:34:25,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:25,525 INFO L481 AbstractCegarLoop]: Abstraction has 3397 states and 4111 transitions. [2021-01-06 13:34:25,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:25,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 4111 transitions. [2021-01-06 13:34:25,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-01-06 13:34:25,530 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:25,530 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 13:34:25,530 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:25,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:25,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1440418757, now seen corresponding path program 1 times [2021-01-06 13:34:25,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:25,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792931220] [2021-01-06 13:34:25,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:25,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792931220] [2021-01-06 13:34:25,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:25,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 13:34:25,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623650222] [2021-01-06 13:34:25,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:34:25,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:25,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:34:25,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:34:25,739 INFO L87 Difference]: Start difference. First operand 3397 states and 4111 transitions. Second operand 4 states. [2021-01-06 13:34:27,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:27,975 INFO L93 Difference]: Finished difference Result 9581 states and 11902 transitions. [2021-01-06 13:34:27,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:34:27,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2021-01-06 13:34:27,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:28,005 INFO L225 Difference]: With dead ends: 9581 [2021-01-06 13:34:28,006 INFO L226 Difference]: Without dead ends: 6186 [2021-01-06 13:34:28,011 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:28,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6186 states. [2021-01-06 13:34:28,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6186 to 5987. [2021-01-06 13:34:28,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5987 states. [2021-01-06 13:34:28,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5987 states to 5987 states and 7314 transitions. [2021-01-06 13:34:28,152 INFO L78 Accepts]: Start accepts. Automaton has 5987 states and 7314 transitions. Word has length 232 [2021-01-06 13:34:28,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:28,153 INFO L481 AbstractCegarLoop]: Abstraction has 5987 states and 7314 transitions. [2021-01-06 13:34:28,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:34:28,153 INFO L276 IsEmpty]: Start isEmpty. Operand 5987 states and 7314 transitions. [2021-01-06 13:34:28,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2021-01-06 13:34:28,158 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:28,158 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 13:34:28,159 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:28,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:28,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1400544816, now seen corresponding path program 1 times [2021-01-06 13:34:28,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:28,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158504867] [2021-01-06 13:34:28,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:28,331 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-01-06 13:34:28,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158504867] [2021-01-06 13:34:28,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:28,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:28,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14814466] [2021-01-06 13:34:28,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:28,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:28,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:28,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:28,334 INFO L87 Difference]: Start difference. First operand 5987 states and 7314 transitions. Second operand 3 states. [2021-01-06 13:34:29,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:29,549 INFO L93 Difference]: Finished difference Result 13276 states and 16460 transitions. [2021-01-06 13:34:29,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:29,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2021-01-06 13:34:29,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:29,583 INFO L225 Difference]: With dead ends: 13276 [2021-01-06 13:34:29,584 INFO L226 Difference]: Without dead ends: 7659 [2021-01-06 13:34:29,593 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,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7659 states. [2021-01-06 13:34:29,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7659 to 7643. [2021-01-06 13:34:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7643 states. [2021-01-06 13:34:29,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7643 states to 7643 states and 9174 transitions. [2021-01-06 13:34:29,731 INFO L78 Accepts]: Start accepts. Automaton has 7643 states and 9174 transitions. Word has length 233 [2021-01-06 13:34:29,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:29,732 INFO L481 AbstractCegarLoop]: Abstraction has 7643 states and 9174 transitions. [2021-01-06 13:34:29,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:29,732 INFO L276 IsEmpty]: Start isEmpty. Operand 7643 states and 9174 transitions. [2021-01-06 13:34:29,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-01-06 13:34:29,737 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:29,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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 13:34:29,738 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:29,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:29,739 INFO L82 PathProgramCache]: Analyzing trace with hash 826529202, now seen corresponding path program 1 times [2021-01-06 13:34:29,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:29,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837525556] [2021-01-06 13:34:29,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:30,025 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:30,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837525556] [2021-01-06 13:34:30,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:30,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:30,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003155111] [2021-01-06 13:34:30,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:34:30,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:30,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:34:30,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:34:30,028 INFO L87 Difference]: Start difference. First operand 7643 states and 9174 transitions. Second operand 4 states. [2021-01-06 13:34:32,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:32,217 INFO L93 Difference]: Finished difference Result 16401 states and 19943 transitions. [2021-01-06 13:34:32,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:34:32,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2021-01-06 13:34:32,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:32,274 INFO L225 Difference]: With dead ends: 16401 [2021-01-06 13:34:32,274 INFO L226 Difference]: Without dead ends: 9128 [2021-01-06 13:34:32,284 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:32,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9128 states. [2021-01-06 13:34:32,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9128 to 9119. [2021-01-06 13:34:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9119 states. [2021-01-06 13:34:32,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9119 states to 9119 states and 10868 transitions. [2021-01-06 13:34:32,452 INFO L78 Accepts]: Start accepts. Automaton has 9119 states and 10868 transitions. Word has length 243 [2021-01-06 13:34:32,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:32,453 INFO L481 AbstractCegarLoop]: Abstraction has 9119 states and 10868 transitions. [2021-01-06 13:34:32,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:34:32,453 INFO L276 IsEmpty]: Start isEmpty. Operand 9119 states and 10868 transitions. [2021-01-06 13:34:32,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-01-06 13:34:32,459 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:32,459 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, 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] [2021-01-06 13:34:32,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 13:34:32,460 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:32,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:32,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1535621630, now seen corresponding path program 1 times [2021-01-06 13:34:32,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:32,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008658043] [2021-01-06 13:34:32,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:32,709 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-01-06 13:34:32,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008658043] [2021-01-06 13:34:32,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:32,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:32,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183142934] [2021-01-06 13:34:32,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:32,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:32,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:32,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:32,713 INFO L87 Difference]: Start difference. First operand 9119 states and 10868 transitions. Second operand 3 states. [2021-01-06 13:34:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:33,903 INFO L93 Difference]: Finished difference Result 19550 states and 23437 transitions. [2021-01-06 13:34:33,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:33,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2021-01-06 13:34:33,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:33,925 INFO L225 Difference]: With dead ends: 19550 [2021-01-06 13:34:33,925 INFO L226 Difference]: Without dead ends: 10802 [2021-01-06 13:34:33,936 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:33,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10802 states. [2021-01-06 13:34:34,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10802 to 10406. [2021-01-06 13:34:34,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10406 states. [2021-01-06 13:34:34,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10406 states to 10406 states and 12401 transitions. [2021-01-06 13:34:34,093 INFO L78 Accepts]: Start accepts. Automaton has 10406 states and 12401 transitions. Word has length 253 [2021-01-06 13:34:34,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:34,094 INFO L481 AbstractCegarLoop]: Abstraction has 10406 states and 12401 transitions. [2021-01-06 13:34:34,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:34,094 INFO L276 IsEmpty]: Start isEmpty. Operand 10406 states and 12401 transitions. [2021-01-06 13:34:34,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2021-01-06 13:34:34,103 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:34,103 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, 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, 1, 1, 1, 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:34,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 13:34:34,103 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:34,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:34,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1353186746, now seen corresponding path program 1 times [2021-01-06 13:34:34,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:34,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739516453] [2021-01-06 13:34:34,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-01-06 13:34:34,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739516453] [2021-01-06 13:34:34,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:34,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:34,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843460542] [2021-01-06 13:34:34,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:34,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:34,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:34,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:34,362 INFO L87 Difference]: Start difference. First operand 10406 states and 12401 transitions. Second operand 3 states. [2021-01-06 13:34:35,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:35,629 INFO L93 Difference]: Finished difference Result 20820 states and 24826 transitions. [2021-01-06 13:34:35,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:35,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2021-01-06 13:34:35,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:35,657 INFO L225 Difference]: With dead ends: 20820 [2021-01-06 13:34:35,657 INFO L226 Difference]: Without dead ends: 10600 [2021-01-06 13:34:35,670 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:35,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10600 states. [2021-01-06 13:34:35,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10600 to 10589. [2021-01-06 13:34:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10589 states. [2021-01-06 13:34:35,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10589 states to 10589 states and 12263 transitions. [2021-01-06 13:34:35,877 INFO L78 Accepts]: Start accepts. Automaton has 10589 states and 12263 transitions. Word has length 284 [2021-01-06 13:34:35,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:35,877 INFO L481 AbstractCegarLoop]: Abstraction has 10589 states and 12263 transitions. [2021-01-06 13:34:35,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:35,878 INFO L276 IsEmpty]: Start isEmpty. Operand 10589 states and 12263 transitions. [2021-01-06 13:34:35,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2021-01-06 13:34:35,890 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:35,890 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, 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, 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] [2021-01-06 13:34:35,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 13:34:35,891 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:35,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:35,891 INFO L82 PathProgramCache]: Analyzing trace with hash 263747274, now seen corresponding path program 1 times [2021-01-06 13:34:35,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:35,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484435280] [2021-01-06 13:34:35,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-01-06 13:34:36,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484435280] [2021-01-06 13:34:36,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:36,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:36,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123889912] [2021-01-06 13:34:36,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:36,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:36,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:36,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:36,112 INFO L87 Difference]: Start difference. First operand 10589 states and 12263 transitions. Second operand 3 states. [2021-01-06 13:34:37,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:37,425 INFO L93 Difference]: Finished difference Result 25597 states and 29894 transitions. [2021-01-06 13:34:37,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:37,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2021-01-06 13:34:37,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:37,462 INFO L225 Difference]: With dead ends: 25597 [2021-01-06 13:34:37,463 INFO L226 Difference]: Without dead ends: 15379 [2021-01-06 13:34:37,478 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:37,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15379 states. [2021-01-06 13:34:37,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15379 to 15373. [2021-01-06 13:34:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15373 states. [2021-01-06 13:34:37,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15373 states to 15373 states and 17769 transitions. [2021-01-06 13:34:37,691 INFO L78 Accepts]: Start accepts. Automaton has 15373 states and 17769 transitions. Word has length 322 [2021-01-06 13:34:37,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:37,692 INFO L481 AbstractCegarLoop]: Abstraction has 15373 states and 17769 transitions. [2021-01-06 13:34:37,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:37,692 INFO L276 IsEmpty]: Start isEmpty. Operand 15373 states and 17769 transitions. [2021-01-06 13:34:37,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2021-01-06 13:34:37,705 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:37,706 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, 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, 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] [2021-01-06 13:34:37,706 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 13:34:37,706 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:37,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:37,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1188223949, now seen corresponding path program 1 times [2021-01-06 13:34:37,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:37,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435046654] [2021-01-06 13:34:37,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-01-06 13:34:38,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435046654] [2021-01-06 13:34:38,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:38,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:38,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185578216] [2021-01-06 13:34:38,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:38,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:38,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:38,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:38,034 INFO L87 Difference]: Start difference. First operand 15373 states and 17769 transitions. Second operand 3 states. [2021-01-06 13:34:39,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:39,216 INFO L93 Difference]: Finished difference Result 29790 states and 34447 transitions. [2021-01-06 13:34:39,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:39,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 325 [2021-01-06 13:34:39,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:39,244 INFO L225 Difference]: With dead ends: 29790 [2021-01-06 13:34:39,244 INFO L226 Difference]: Without dead ends: 14788 [2021-01-06 13:34:39,258 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:39,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14788 states. [2021-01-06 13:34:39,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14788 to 14600. [2021-01-06 13:34:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2021-01-06 13:34:39,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 16131 transitions. [2021-01-06 13:34:39,538 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 16131 transitions. Word has length 325 [2021-01-06 13:34:39,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:39,539 INFO L481 AbstractCegarLoop]: Abstraction has 14600 states and 16131 transitions. [2021-01-06 13:34:39,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 16131 transitions. [2021-01-06 13:34:39,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2021-01-06 13:34:39,552 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:39,552 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, 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, 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] [2021-01-06 13:34:39,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 13:34:39,553 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:39,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:39,554 INFO L82 PathProgramCache]: Analyzing trace with hash -56733327, now seen corresponding path program 1 times [2021-01-06 13:34:39,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:39,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021815909] [2021-01-06 13:34:39,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2021-01-06 13:34:39,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021815909] [2021-01-06 13:34:39,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:39,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:39,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733314847] [2021-01-06 13:34:39,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:39,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:39,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:39,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:39,774 INFO L87 Difference]: Start difference. First operand 14600 states and 16131 transitions. Second operand 3 states. [2021-01-06 13:34:40,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:40,888 INFO L93 Difference]: Finished difference Result 31221 states and 34495 transitions. [2021-01-06 13:34:40,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:40,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2021-01-06 13:34:40,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:40,914 INFO L225 Difference]: With dead ends: 31221 [2021-01-06 13:34:40,914 INFO L226 Difference]: Without dead ends: 16991 [2021-01-06 13:34:40,921 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,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16991 states. [2021-01-06 13:34:41,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16991 to 10363. [2021-01-06 13:34:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10363 states. [2021-01-06 13:34:41,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10363 states to 10363 states and 11538 transitions. [2021-01-06 13:34:41,074 INFO L78 Accepts]: Start accepts. Automaton has 10363 states and 11538 transitions. Word has length 326 [2021-01-06 13:34:41,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:41,075 INFO L481 AbstractCegarLoop]: Abstraction has 10363 states and 11538 transitions. [2021-01-06 13:34:41,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:41,075 INFO L276 IsEmpty]: Start isEmpty. Operand 10363 states and 11538 transitions. [2021-01-06 13:34:41,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2021-01-06 13:34:41,086 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:41,087 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 13:34:41,087 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:41,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:41,088 INFO L82 PathProgramCache]: Analyzing trace with hash 234214298, now seen corresponding path program 1 times [2021-01-06 13:34:41,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:41,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229174245] [2021-01-06 13:34:41,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:41,401 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-01-06 13:34:41,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229174245] [2021-01-06 13:34:41,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:41,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 13:34:41,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338712342] [2021-01-06 13:34:41,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:41,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:41,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:41,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:41,404 INFO L87 Difference]: Start difference. First operand 10363 states and 11538 transitions. Second operand 3 states. [2021-01-06 13:34:42,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:42,064 INFO L93 Difference]: Finished difference Result 20352 states and 22690 transitions. [2021-01-06 13:34:42,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:42,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2021-01-06 13:34:42,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:42,080 INFO L225 Difference]: With dead ends: 20352 [2021-01-06 13:34:42,081 INFO L226 Difference]: Without dead ends: 10359 [2021-01-06 13:34:42,089 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:42,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10359 states. [2021-01-06 13:34:42,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10359 to 10359. [2021-01-06 13:34:42,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10359 states. [2021-01-06 13:34:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10359 states to 10359 states and 11528 transitions. [2021-01-06 13:34:42,223 INFO L78 Accepts]: Start accepts. Automaton has 10359 states and 11528 transitions. Word has length 333 [2021-01-06 13:34:42,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:42,224 INFO L481 AbstractCegarLoop]: Abstraction has 10359 states and 11528 transitions. [2021-01-06 13:34:42,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:42,224 INFO L276 IsEmpty]: Start isEmpty. Operand 10359 states and 11528 transitions. [2021-01-06 13:34:42,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2021-01-06 13:34:42,237 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:42,237 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:34:42,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 13:34:42,238 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:42,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:42,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1309922959, now seen corresponding path program 1 times [2021-01-06 13:34:42,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:42,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342759003] [2021-01-06 13:34:42,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:42,470 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2021-01-06 13:34:42,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342759003] [2021-01-06 13:34:42,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:42,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:42,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340821189] [2021-01-06 13:34:42,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:42,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:42,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:42,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:42,472 INFO L87 Difference]: Start difference. First operand 10359 states and 11528 transitions. Second operand 3 states. [2021-01-06 13:34:43,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:43,836 INFO L93 Difference]: Finished difference Result 23844 states and 26484 transitions. [2021-01-06 13:34:43,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:43,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 357 [2021-01-06 13:34:43,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:43,858 INFO L225 Difference]: With dead ends: 23844 [2021-01-06 13:34:43,858 INFO L226 Difference]: Without dead ends: 12009 [2021-01-06 13:34:43,869 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:43,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12009 states. [2021-01-06 13:34:44,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12009 to 10905. [2021-01-06 13:34:44,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10905 states. [2021-01-06 13:34:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10905 states to 10905 states and 11944 transitions. [2021-01-06 13:34:44,068 INFO L78 Accepts]: Start accepts. Automaton has 10905 states and 11944 transitions. Word has length 357 [2021-01-06 13:34:44,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:44,068 INFO L481 AbstractCegarLoop]: Abstraction has 10905 states and 11944 transitions. [2021-01-06 13:34:44,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 10905 states and 11944 transitions. [2021-01-06 13:34:44,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2021-01-06 13:34:44,081 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:44,082 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, 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, 2, 2, 2, 2, 2, 2, 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:44,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 13:34:44,082 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:44,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:44,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1148869825, now seen corresponding path program 1 times [2021-01-06 13:34:44,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:44,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095766325] [2021-01-06 13:34:44,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:44,400 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-01-06 13:34:44,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095766325] [2021-01-06 13:34:44,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:44,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:44,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398394380] [2021-01-06 13:34:44,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:34:44,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:44,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:34:44,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:34:44,402 INFO L87 Difference]: Start difference. First operand 10905 states and 11944 transitions. Second operand 3 states. [2021-01-06 13:34:45,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:45,545 INFO L93 Difference]: Finished difference Result 23659 states and 25948 transitions. [2021-01-06 13:34:45,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:34:45,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 362 [2021-01-06 13:34:45,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:45,560 INFO L225 Difference]: With dead ends: 23659 [2021-01-06 13:34:45,560 INFO L226 Difference]: Without dead ends: 13124 [2021-01-06 13:34:45,569 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,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13124 states. [2021-01-06 13:34:45,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13124 to 12013. [2021-01-06 13:34:45,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12013 states. [2021-01-06 13:34:45,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12013 states to 12013 states and 13130 transitions. [2021-01-06 13:34:45,780 INFO L78 Accepts]: Start accepts. Automaton has 12013 states and 13130 transitions. Word has length 362 [2021-01-06 13:34:45,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:45,780 INFO L481 AbstractCegarLoop]: Abstraction has 12013 states and 13130 transitions. [2021-01-06 13:34:45,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:34:45,780 INFO L276 IsEmpty]: Start isEmpty. Operand 12013 states and 13130 transitions. [2021-01-06 13:34:45,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2021-01-06 13:34:45,789 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:45,790 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 13:34:45,790 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:45,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:45,791 INFO L82 PathProgramCache]: Analyzing trace with hash 827224776, now seen corresponding path program 1 times [2021-01-06 13:34:45,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:45,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46093767] [2021-01-06 13:34:45,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-01-06 13:34:46,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46093767] [2021-01-06 13:34:46,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:34:46,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:34:46,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041826925] [2021-01-06 13:34:46,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:34:46,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:46,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:34:46,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:34:46,143 INFO L87 Difference]: Start difference. First operand 12013 states and 13130 transitions. Second operand 4 states. [2021-01-06 13:34:48,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:48,096 INFO L93 Difference]: Finished difference Result 31400 states and 34348 transitions. [2021-01-06 13:34:48,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:34:48,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 372 [2021-01-06 13:34:48,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:48,184 INFO L225 Difference]: With dead ends: 31400 [2021-01-06 13:34:48,184 INFO L226 Difference]: Without dead ends: 19389 [2021-01-06 13:34:48,191 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:48,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19389 states. [2021-01-06 13:34:48,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19389 to 17913. [2021-01-06 13:34:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17913 states. [2021-01-06 13:34:48,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17913 states to 17913 states and 19535 transitions. [2021-01-06 13:34:48,429 INFO L78 Accepts]: Start accepts. Automaton has 17913 states and 19535 transitions. Word has length 372 [2021-01-06 13:34:48,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:48,430 INFO L481 AbstractCegarLoop]: Abstraction has 17913 states and 19535 transitions. [2021-01-06 13:34:48,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:34:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 17913 states and 19535 transitions. [2021-01-06 13:34:48,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2021-01-06 13:34:48,442 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:48,443 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 13:34:48,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 13:34:48,444 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:48,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:48,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1553293930, now seen corresponding path program 1 times [2021-01-06 13:34:48,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:48,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865136118] [2021-01-06 13:34:48,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 146 proven. 200 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-01-06 13:34:48,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865136118] [2021-01-06 13:34:48,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764500798] [2021-01-06 13:34:48,876 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:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:34:49,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 13:34:49,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:34:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 244 proven. 179 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 13:34:50,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:34:50,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2021-01-06 13:34:50,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930873646] [2021-01-06 13:34:50,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 13:34:50,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:34:50,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 13:34:50,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-01-06 13:34:50,309 INFO L87 Difference]: Start difference. First operand 17913 states and 19535 transitions. Second operand 9 states. [2021-01-06 13:34:58,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:34:58,785 INFO L93 Difference]: Finished difference Result 52492 states and 57070 transitions. [2021-01-06 13:34:58,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 13:34:58,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 389 [2021-01-06 13:34:58,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:34:58,887 INFO L225 Difference]: With dead ends: 52492 [2021-01-06 13:34:58,888 INFO L226 Difference]: Without dead ends: 34397 [2021-01-06 13:34:58,900 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=350, Unknown=0, NotChecked=0, Total=506 [2021-01-06 13:34:58,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34397 states. [2021-01-06 13:34:59,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34397 to 32101. [2021-01-06 13:34:59,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32101 states. [2021-01-06 13:34:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32101 states to 32101 states and 34719 transitions. [2021-01-06 13:34:59,552 INFO L78 Accepts]: Start accepts. Automaton has 32101 states and 34719 transitions. Word has length 389 [2021-01-06 13:34:59,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:34:59,552 INFO L481 AbstractCegarLoop]: Abstraction has 32101 states and 34719 transitions. [2021-01-06 13:34:59,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 13:34:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 32101 states and 34719 transitions. [2021-01-06 13:34:59,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2021-01-06 13:34:59,572 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:34:59,572 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, 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, 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:34:59,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-06 13:34:59,787 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:34:59,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:34:59,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1546004851, now seen corresponding path program 1 times [2021-01-06 13:34:59,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:34:59,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150707457] [2021-01-06 13:34:59,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:34:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:00,236 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2021-01-06 13:35:00,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150707457] [2021-01-06 13:35:00,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:35:00,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:35:00,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477890709] [2021-01-06 13:35:00,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 13:35:00,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:00,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 13:35:00,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 13:35:00,241 INFO L87 Difference]: Start difference. First operand 32101 states and 34719 transitions. Second operand 4 states. [2021-01-06 13:35:02,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:02,655 INFO L93 Difference]: Finished difference Result 65493 states and 70878 transitions. [2021-01-06 13:35:02,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 13:35:02,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 394 [2021-01-06 13:35:02,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:02,748 INFO L225 Difference]: With dead ends: 65493 [2021-01-06 13:35:02,748 INFO L226 Difference]: Without dead ends: 33762 [2021-01-06 13:35:02,768 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:02,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33762 states. [2021-01-06 13:35:03,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33762 to 30623. [2021-01-06 13:35:03,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30623 states. [2021-01-06 13:35:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30623 states to 30623 states and 33091 transitions. [2021-01-06 13:35:03,235 INFO L78 Accepts]: Start accepts. Automaton has 30623 states and 33091 transitions. Word has length 394 [2021-01-06 13:35:03,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:03,235 INFO L481 AbstractCegarLoop]: Abstraction has 30623 states and 33091 transitions. [2021-01-06 13:35:03,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 13:35:03,235 INFO L276 IsEmpty]: Start isEmpty. Operand 30623 states and 33091 transitions. [2021-01-06 13:35:03,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2021-01-06 13:35:03,247 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:03,247 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 13:35:03,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 13:35:03,248 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:03,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:03,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1216776914, now seen corresponding path program 1 times [2021-01-06 13:35:03,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:03,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152446695] [2021-01-06 13:35:03,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:03,531 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2021-01-06 13:35:03,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152446695] [2021-01-06 13:35:03,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:35:03,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:35:03,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864140127] [2021-01-06 13:35:03,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:35:03,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:03,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:35:03,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:03,534 INFO L87 Difference]: Start difference. First operand 30623 states and 33091 transitions. Second operand 3 states. [2021-01-06 13:35:05,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:05,049 INFO L93 Difference]: Finished difference Result 61974 states and 66993 transitions. [2021-01-06 13:35:05,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:35:05,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 403 [2021-01-06 13:35:05,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:05,088 INFO L225 Difference]: With dead ends: 61974 [2021-01-06 13:35:05,088 INFO L226 Difference]: Without dead ends: 31721 [2021-01-06 13:35:05,109 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:05,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31721 states. [2021-01-06 13:35:05,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31721 to 30982. [2021-01-06 13:35:05,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30982 states. [2021-01-06 13:35:05,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30982 states to 30982 states and 33315 transitions. [2021-01-06 13:35:05,535 INFO L78 Accepts]: Start accepts. Automaton has 30982 states and 33315 transitions. Word has length 403 [2021-01-06 13:35:05,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:05,535 INFO L481 AbstractCegarLoop]: Abstraction has 30982 states and 33315 transitions. [2021-01-06 13:35:05,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:35:05,535 INFO L276 IsEmpty]: Start isEmpty. Operand 30982 states and 33315 transitions. [2021-01-06 13:35:05,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2021-01-06 13:35:05,547 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:05,548 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-01-06 13:35:05,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 13:35:05,548 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:05,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:05,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1148113260, now seen corresponding path program 1 times [2021-01-06 13:35:05,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:05,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774338304] [2021-01-06 13:35:05,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:06,306 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2021-01-06 13:35:06,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774338304] [2021-01-06 13:35:06,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:35:06,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:35:06,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267171499] [2021-01-06 13:35:06,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:35:06,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:06,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:35:06,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:06,308 INFO L87 Difference]: Start difference. First operand 30982 states and 33315 transitions. Second operand 3 states. [2021-01-06 13:35:07,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:07,670 INFO L93 Difference]: Finished difference Result 63982 states and 68823 transitions. [2021-01-06 13:35:07,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:35:07,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 434 [2021-01-06 13:35:07,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:07,771 INFO L225 Difference]: With dead ends: 63982 [2021-01-06 13:35:07,772 INFO L226 Difference]: Without dead ends: 33370 [2021-01-06 13:35:07,783 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:07,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33370 states. [2021-01-06 13:35:08,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33370 to 26924. [2021-01-06 13:35:08,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26924 states. [2021-01-06 13:35:08,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26924 states to 26924 states and 28800 transitions. [2021-01-06 13:35:08,137 INFO L78 Accepts]: Start accepts. Automaton has 26924 states and 28800 transitions. Word has length 434 [2021-01-06 13:35:08,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:08,137 INFO L481 AbstractCegarLoop]: Abstraction has 26924 states and 28800 transitions. [2021-01-06 13:35:08,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:35:08,138 INFO L276 IsEmpty]: Start isEmpty. Operand 26924 states and 28800 transitions. [2021-01-06 13:35:08,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2021-01-06 13:35:08,149 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:08,149 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:08,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 13:35:08,149 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:08,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:08,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1848032332, now seen corresponding path program 1 times [2021-01-06 13:35:08,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:08,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688196800] [2021-01-06 13:35:08,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:08,752 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 608 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-01-06 13:35:08,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688196800] [2021-01-06 13:35:08,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:35:08,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 13:35:08,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175392508] [2021-01-06 13:35:08,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:35:08,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:08,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:35:08,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 13:35:08,755 INFO L87 Difference]: Start difference. First operand 26924 states and 28800 transitions. Second operand 3 states. [2021-01-06 13:35:10,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:10,075 INFO L93 Difference]: Finished difference Result 52192 states and 55896 transitions. [2021-01-06 13:35:10,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:35:10,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 468 [2021-01-06 13:35:10,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:10,111 INFO L225 Difference]: With dead ends: 52192 [2021-01-06 13:35:10,111 INFO L226 Difference]: Without dead ends: 28032 [2021-01-06 13:35:10,129 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:10,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28032 states. [2021-01-06 13:35:10,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28032 to 26740. [2021-01-06 13:35:10,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26740 states. [2021-01-06 13:35:10,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26740 states to 26740 states and 28591 transitions. [2021-01-06 13:35:10,503 INFO L78 Accepts]: Start accepts. Automaton has 26740 states and 28591 transitions. Word has length 468 [2021-01-06 13:35:10,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:10,504 INFO L481 AbstractCegarLoop]: Abstraction has 26740 states and 28591 transitions. [2021-01-06 13:35:10,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:35:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 26740 states and 28591 transitions. [2021-01-06 13:35:10,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2021-01-06 13:35:10,512 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:10,513 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, 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, 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] [2021-01-06 13:35:10,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 13:35:10,513 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:10,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:10,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1117136727, now seen corresponding path program 1 times [2021-01-06 13:35:10,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:10,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787209274] [2021-01-06 13:35:10,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 365 proven. 36 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2021-01-06 13:35:11,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787209274] [2021-01-06 13:35:11,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696664841] [2021-01-06 13:35:11,283 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:35:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:11,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 13:35:11,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:35:12,121 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 401 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2021-01-06 13:35:12,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 13:35:12,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-01-06 13:35:12,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459141753] [2021-01-06 13:35:12,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 13:35:12,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:12,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 13:35:12,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:35:12,123 INFO L87 Difference]: Start difference. First operand 26740 states and 28591 transitions. Second operand 3 states. [2021-01-06 13:35:13,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:13,247 INFO L93 Difference]: Finished difference Result 50532 states and 54093 transitions. [2021-01-06 13:35:13,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 13:35:13,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 472 [2021-01-06 13:35:13,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:13,275 INFO L225 Difference]: With dead ends: 50532 [2021-01-06 13:35:13,275 INFO L226 Difference]: Without dead ends: 26372 [2021-01-06 13:35:13,290 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-06 13:35:13,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26372 states. [2021-01-06 13:35:13,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26372 to 26004. [2021-01-06 13:35:13,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26004 states. [2021-01-06 13:35:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26004 states to 26004 states and 27790 transitions. [2021-01-06 13:35:13,628 INFO L78 Accepts]: Start accepts. Automaton has 26004 states and 27790 transitions. Word has length 472 [2021-01-06 13:35:13,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:13,628 INFO L481 AbstractCegarLoop]: Abstraction has 26004 states and 27790 transitions. [2021-01-06 13:35:13,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 13:35:13,629 INFO L276 IsEmpty]: Start isEmpty. Operand 26004 states and 27790 transitions. [2021-01-06 13:35:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2021-01-06 13:35:13,644 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:13,644 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, 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, 3, 3, 3, 3, 3, 3, 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, 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,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-01-06 13:35:13,860 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:13,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:13,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2131901513, now seen corresponding path program 1 times [2021-01-06 13:35:13,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:13,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041103732] [2021-01-06 13:35:13,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 599 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-01-06 13:35:14,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041103732] [2021-01-06 13:35:14,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 13:35:14,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 13:35:14,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283853769] [2021-01-06 13:35:14,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 13:35:14,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:14,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 13:35:14,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 13:35:14,880 INFO L87 Difference]: Start difference. First operand 26004 states and 27790 transitions. Second operand 6 states. [2021-01-06 13:35:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:17,607 INFO L93 Difference]: Finished difference Result 54855 states and 58603 transitions. [2021-01-06 13:35:17,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 13:35:17,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 523 [2021-01-06 13:35:17,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:17,642 INFO L225 Difference]: With dead ends: 54855 [2021-01-06 13:35:17,642 INFO L226 Difference]: Without dead ends: 31431 [2021-01-06 13:35:17,658 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-01-06 13:35:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31431 states. [2021-01-06 13:35:18,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31431 to 26926. [2021-01-06 13:35:18,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26926 states. [2021-01-06 13:35:18,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26926 states to 26926 states and 28791 transitions. [2021-01-06 13:35:18,055 INFO L78 Accepts]: Start accepts. Automaton has 26926 states and 28791 transitions. Word has length 523 [2021-01-06 13:35:18,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:18,056 INFO L481 AbstractCegarLoop]: Abstraction has 26926 states and 28791 transitions. [2021-01-06 13:35:18,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 13:35:18,056 INFO L276 IsEmpty]: Start isEmpty. Operand 26926 states and 28791 transitions. [2021-01-06 13:35:18,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2021-01-06 13:35:18,074 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:18,075 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 13:35:18,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 13:35:18,075 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:18,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:18,076 INFO L82 PathProgramCache]: Analyzing trace with hash 435204898, now seen corresponding path program 1 times [2021-01-06 13:35:18,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:18,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645521239] [2021-01-06 13:35:18,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 606 proven. 8 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-01-06 13:35:19,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645521239] [2021-01-06 13:35:19,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896970699] [2021-01-06 13:35:19,610 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:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:19,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 13:35:19,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:35:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 493 proven. 121 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-01-06 13:35:20,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 13:35:20,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2021-01-06 13:35:20,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872323359] [2021-01-06 13:35:20,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 13:35:20,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 13:35:20,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 13:35:20,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-01-06 13:35:20,779 INFO L87 Difference]: Start difference. First operand 26926 states and 28791 transitions. Second operand 9 states. [2021-01-06 13:35:26,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 13:35:26,837 INFO L93 Difference]: Finished difference Result 59841 states and 63896 transitions. [2021-01-06 13:35:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 13:35:26,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 533 [2021-01-06 13:35:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 13:35:26,877 INFO L225 Difference]: With dead ends: 59841 [2021-01-06 13:35:26,877 INFO L226 Difference]: Without dead ends: 33655 [2021-01-06 13:35:26,894 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2021-01-06 13:35:26,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33655 states. [2021-01-06 13:35:27,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33655 to 30606. [2021-01-06 13:35:27,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30606 states. [2021-01-06 13:35:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30606 states to 30606 states and 32641 transitions. [2021-01-06 13:35:27,225 INFO L78 Accepts]: Start accepts. Automaton has 30606 states and 32641 transitions. Word has length 533 [2021-01-06 13:35:27,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 13:35:27,225 INFO L481 AbstractCegarLoop]: Abstraction has 30606 states and 32641 transitions. [2021-01-06 13:35:27,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 13:35:27,226 INFO L276 IsEmpty]: Start isEmpty. Operand 30606 states and 32641 transitions. [2021-01-06 13:35:27,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2021-01-06 13:35:27,241 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 13:35:27,242 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, 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, 3, 3, 3, 3, 3, 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, 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:27,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-01-06 13:35:27,455 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 13:35:27,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 13:35:27,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1729367067, now seen corresponding path program 1 times [2021-01-06 13:35:27,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 13:35:27,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569756176] [2021-01-06 13:35:27,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 13:35:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:28,152 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 390 proven. 206 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-01-06 13:35:28,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569756176] [2021-01-06 13:35:28,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024238132] [2021-01-06 13:35:28,152 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:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 13:35:28,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-06 13:35:28,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 13:35:28,911 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-01-06 13:35:29,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 13:35:29,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 13:35:29,090 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-06 13:35:29,173 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:29,319 INFO L757 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:29,550 INFO L757 QuantifierPusher]: Run 30 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:29,867 INFO L757 QuantifierPusher]: Run 40 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:30,520 INFO L757 QuantifierPusher]: Run 50 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:31,474 INFO L757 QuantifierPusher]: Run 60 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:32,555 INFO L757 QuantifierPusher]: Run 70 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:33,378 INFO L757 QuantifierPusher]: Run 80 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:34,145 INFO L757 QuantifierPusher]: Run 90 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:35,222 INFO L757 QuantifierPusher]: Run 100 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:35,815 INFO L757 QuantifierPusher]: Run 110 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:36,479 INFO L757 QuantifierPusher]: Run 120 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:37,316 INFO L757 QuantifierPusher]: Run 130 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:38,350 INFO L757 QuantifierPusher]: Run 140 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:39,593 INFO L757 QuantifierPusher]: Run 150 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:40,769 INFO L757 QuantifierPusher]: Run 160 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:42,117 INFO L757 QuantifierPusher]: Run 170 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:44,012 INFO L757 QuantifierPusher]: Run 180 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:45,578 INFO L757 QuantifierPusher]: Run 190 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:47,307 INFO L757 QuantifierPusher]: Run 200 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:49,325 INFO L757 QuantifierPusher]: Run 210 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:51,627 INFO L757 QuantifierPusher]: Run 220 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:53,645 INFO L757 QuantifierPusher]: Run 230 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:55,732 INFO L757 QuantifierPusher]: Run 240 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:35:57,961 INFO L757 QuantifierPusher]: Run 250 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:00,724 INFO L757 QuantifierPusher]: Run 260 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:04,013 INFO L757 QuantifierPusher]: Run 270 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:08,050 INFO L757 QuantifierPusher]: Run 280 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:11,437 INFO L757 QuantifierPusher]: Run 290 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:14,657 INFO L757 QuantifierPusher]: Run 300 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:17,937 INFO L757 QuantifierPusher]: Run 310 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:21,572 INFO L757 QuantifierPusher]: Run 320 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:25,558 INFO L757 QuantifierPusher]: Run 330 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:30,295 INFO L757 QuantifierPusher]: Run 340 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:35,032 INFO L757 QuantifierPusher]: Run 350 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:40,280 INFO L757 QuantifierPusher]: Run 360 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:45,286 INFO L757 QuantifierPusher]: Run 370 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:50,831 INFO L757 QuantifierPusher]: Run 380 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:36:56,178 INFO L757 QuantifierPusher]: Run 390 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:37:01,667 INFO L757 QuantifierPusher]: Run 400 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:37:07,274 INFO L757 QuantifierPusher]: Run 410 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:37:13,656 INFO L757 QuantifierPusher]: Run 420 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:37:19,601 INFO L757 QuantifierPusher]: Run 430 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:37:25,460 INFO L757 QuantifierPusher]: Run 440 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:37:32,254 INFO L757 QuantifierPusher]: Run 450 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:37:38,971 INFO L757 QuantifierPusher]: Run 460 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:37:46,119 INFO L757 QuantifierPusher]: Run 470 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:37:53,573 INFO L757 QuantifierPusher]: Run 480 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:38:01,096 INFO L757 QuantifierPusher]: Run 490 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 13:38:08,953 INFO L757 QuantifierPusher]: Run 500 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug.