/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/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:40:35,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:40:35,926 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:40:35,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:40:35,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:40:35,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:40:35,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:40:36,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:40:36,007 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:40:36,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:40:36,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:40:36,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:40:36,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:40:36,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:40:36,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:40:36,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:40:36,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:40:36,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:40:36,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:40:36,075 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:40:36,078 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:40:36,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:40:36,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:40:36,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:40:36,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:40:36,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:40:36,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:40:36,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:40:36,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:40:36,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:40:36,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:40:36,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:40:36,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:40:36,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:40:36,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:40:36,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:40:36,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:40:36,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:40:36,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:40:36,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:40:36,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:40:36,126 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 09:40:36,176 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:40:36,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:40:36,181 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:40:36,182 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:40:36,182 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:40:36,182 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:40:36,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:40:36,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:40:36,183 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:40:36,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:40:36,185 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:40:36,186 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:40:36,186 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:40:36,187 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:40:36,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:40:36,187 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:40:36,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:40:36,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:40:36,188 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:40:36,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:40:36,189 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:40:36,189 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:40:36,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:40:36,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:40:36,190 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:40:36,191 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 [2020-12-23 09:40:36,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:40:36,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:40:36,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:40:36,670 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:40:36,676 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:40:36,677 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2020-12-23 09:40:36,778 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/70460a772/4bc27c2cbfff4429ba920ffff61c2050/FLAG4a6c44339 [2020-12-23 09:40:37,471 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:40:37,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2020-12-23 09:40:37,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/70460a772/4bc27c2cbfff4429ba920ffff61c2050/FLAG4a6c44339 [2020-12-23 09:40:37,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/70460a772/4bc27c2cbfff4429ba920ffff61c2050 [2020-12-23 09:40:37,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:40:37,726 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:40:37,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:40:37,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:40:37,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:40:37,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:40:37" (1/1) ... [2020-12-23 09:40:37,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2547927b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:40:37, skipping insertion in model container [2020-12-23 09:40:37,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:40:37" (1/1) ... [2020-12-23 09:40:37,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:40:37,816 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r121~0,] left hand side expression in assignment: lhs: VariableLHS[~r131~0,] left hand side expression in assignment: lhs: VariableLHS[~r211~0,] left hand side expression in assignment: lhs: VariableLHS[~r231~0,] left hand side expression in assignment: lhs: VariableLHS[~r311~0,] left hand side expression in assignment: lhs: VariableLHS[~r321~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~r122~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~r132~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~r212~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~r232~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~r312~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~r322~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2020-12-23 09:40:38,157 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/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c[11552,11565] [2020-12-23 09:40:38,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:40:38,176 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r121~0,] left hand side expression in assignment: lhs: VariableLHS[~r131~0,] left hand side expression in assignment: lhs: VariableLHS[~r211~0,] left hand side expression in assignment: lhs: VariableLHS[~r231~0,] left hand side expression in assignment: lhs: VariableLHS[~r311~0,] left hand side expression in assignment: lhs: VariableLHS[~r321~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~r122~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~r132~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~r212~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~r232~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~r312~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~r322~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2020-12-23 09:40:38,260 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/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c[11552,11565] [2020-12-23 09:40:38,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:40:38,298 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:40:38,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:40:38 WrapperNode [2020-12-23 09:40:38,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:40:38,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:40:38,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:40:38,302 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:40:38,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:40:38" (1/1) ... [2020-12-23 09:40:38,348 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:40:38" (1/1) ... [2020-12-23 09:40:38,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:40:38,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:40:38,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:40:38,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:40:38,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:40:38" (1/1) ... [2020-12-23 09:40:38,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:40:38" (1/1) ... [2020-12-23 09:40:38,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:40:38" (1/1) ... [2020-12-23 09:40:38,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:40:38" (1/1) ... [2020-12-23 09:40:38,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:40:38" (1/1) ... [2020-12-23 09:40:38,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:40:38" (1/1) ... [2020-12-23 09:40:38,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:40:38" (1/1) ... [2020-12-23 09:40:38,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:40:38,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:40:38,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:40:38,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:40:38,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:40:38" (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 [2020-12-23 09:40:38,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:40:38,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:40:38,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:40:38,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:40:39,638 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:40:39,639 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2020-12-23 09:40:39,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:40:39 BoogieIcfgContainer [2020-12-23 09:40:39,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:40:39,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:40:39,644 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:40:39,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:40:39,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:40:37" (1/3) ... [2020-12-23 09:40:39,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522e7ed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:40:39, skipping insertion in model container [2020-12-23 09:40:39,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:40:38" (2/3) ... [2020-12-23 09:40:39,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522e7ed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:40:39, skipping insertion in model container [2020-12-23 09:40:39,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:40:39" (3/3) ... [2020-12-23 09:40:39,652 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2020-12-23 09:40:39,660 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:40:39,666 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 09:40:39,687 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 09:40:39,719 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:40:39,720 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:40:39,720 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:40:39,720 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:40:39,720 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:40:39,720 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:40:39,721 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:40:39,721 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:40:39,742 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2020-12-23 09:40:39,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 09:40:39,753 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:40:39,754 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] [2020-12-23 09:40:39,755 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:40:39,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:40:39,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1238377303, now seen corresponding path program 1 times [2020-12-23 09:40:39,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:40:39,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271598984] [2020-12-23 09:40:39,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:40:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:40:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:40:40,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271598984] [2020-12-23 09:40:40,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:40:40,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:40:40,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545390902] [2020-12-23 09:40:40,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 09:40:40,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:40:40,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 09:40:40,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 09:40:40,134 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 2 states. [2020-12-23 09:40:40,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:40:40,171 INFO L93 Difference]: Finished difference Result 206 states and 353 transitions. [2020-12-23 09:40:40,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 09:40:40,172 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2020-12-23 09:40:40,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:40:40,187 INFO L225 Difference]: With dead ends: 206 [2020-12-23 09:40:40,187 INFO L226 Difference]: Without dead ends: 126 [2020-12-23 09:40:40,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 09:40:40,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-12-23 09:40:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2020-12-23 09:40:40,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-12-23 09:40:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 216 transitions. [2020-12-23 09:40:40,249 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 216 transitions. Word has length 37 [2020-12-23 09:40:40,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:40:40,250 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 216 transitions. [2020-12-23 09:40:40,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 09:40:40,250 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 216 transitions. [2020-12-23 09:40:40,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 09:40:40,253 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:40:40,253 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] [2020-12-23 09:40:40,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:40:40,254 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:40:40,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:40:40,255 INFO L82 PathProgramCache]: Analyzing trace with hash 420728853, now seen corresponding path program 1 times [2020-12-23 09:40:40,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:40:40,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500978526] [2020-12-23 09:40:40,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:40:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:40:40,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:40:40,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500978526] [2020-12-23 09:40:40,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:40:40,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:40:40,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602869827] [2020-12-23 09:40:40,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:40:40,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:40:40,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:40:40,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:40:40,424 INFO L87 Difference]: Start difference. First operand 126 states and 216 transitions. Second operand 5 states. [2020-12-23 09:40:40,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:40:40,608 INFO L93 Difference]: Finished difference Result 205 states and 346 transitions. [2020-12-23 09:40:40,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:40:40,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-12-23 09:40:40,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:40:40,611 INFO L225 Difference]: With dead ends: 205 [2020-12-23 09:40:40,612 INFO L226 Difference]: Without dead ends: 126 [2020-12-23 09:40:40,616 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:40:40,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-12-23 09:40:40,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2020-12-23 09:40:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-12-23 09:40:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 195 transitions. [2020-12-23 09:40:40,637 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 195 transitions. Word has length 37 [2020-12-23 09:40:40,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:40:40,637 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 195 transitions. [2020-12-23 09:40:40,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:40:40,638 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 195 transitions. [2020-12-23 09:40:40,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-23 09:40:40,657 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:40:40,657 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, 1, 1, 1, 1, 1, 1] [2020-12-23 09:40:40,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:40:40,658 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:40:40,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:40:40,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1846122567, now seen corresponding path program 1 times [2020-12-23 09:40:40,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:40:40,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39200689] [2020-12-23 09:40:40,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:40:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:40:40,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:40:40,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39200689] [2020-12-23 09:40:40,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:40:40,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:40:40,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219884268] [2020-12-23 09:40:40,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:40:40,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:40:40,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:40:40,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:40:40,824 INFO L87 Difference]: Start difference. First operand 126 states and 195 transitions. Second operand 3 states. [2020-12-23 09:40:40,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:40:40,926 INFO L93 Difference]: Finished difference Result 267 states and 430 transitions. [2020-12-23 09:40:40,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:40:40,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-12-23 09:40:40,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:40:40,929 INFO L225 Difference]: With dead ends: 267 [2020-12-23 09:40:40,930 INFO L226 Difference]: Without dead ends: 192 [2020-12-23 09:40:40,931 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 [2020-12-23 09:40:40,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-12-23 09:40:40,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2020-12-23 09:40:40,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-12-23 09:40:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 296 transitions. [2020-12-23 09:40:40,953 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 296 transitions. Word has length 57 [2020-12-23 09:40:40,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:40:40,953 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 296 transitions. [2020-12-23 09:40:40,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:40:40,954 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 296 transitions. [2020-12-23 09:40:40,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 09:40:40,957 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:40:40,957 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:40:40,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:40:40,957 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:40:40,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:40:40,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1343531320, now seen corresponding path program 1 times [2020-12-23 09:40:40,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:40:40,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564066069] [2020-12-23 09:40:40,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:40:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:40:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:40:41,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564066069] [2020-12-23 09:40:41,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:40:41,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:40:41,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138337423] [2020-12-23 09:40:41,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:40:41,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:40:41,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:40:41,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:40:41,084 INFO L87 Difference]: Start difference. First operand 189 states and 296 transitions. Second operand 3 states. [2020-12-23 09:40:41,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:40:41,128 INFO L93 Difference]: Finished difference Result 451 states and 724 transitions. [2020-12-23 09:40:41,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:40:41,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-12-23 09:40:41,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:40:41,132 INFO L225 Difference]: With dead ends: 451 [2020-12-23 09:40:41,132 INFO L226 Difference]: Without dead ends: 313 [2020-12-23 09:40:41,133 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 [2020-12-23 09:40:41,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-12-23 09:40:41,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 309. [2020-12-23 09:40:41,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2020-12-23 09:40:41,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 490 transitions. [2020-12-23 09:40:41,168 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 490 transitions. Word has length 59 [2020-12-23 09:40:41,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:40:41,168 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 490 transitions. [2020-12-23 09:40:41,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:40:41,169 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 490 transitions. [2020-12-23 09:40:41,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:40:41,172 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:40:41,172 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:40:41,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:40:41,173 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:40:41,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:40:41,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1628241783, now seen corresponding path program 1 times [2020-12-23 09:40:41,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:40:41,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073264490] [2020-12-23 09:40:41,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:40:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:40:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:40:41,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073264490] [2020-12-23 09:40:41,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:40:41,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:40:41,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936798013] [2020-12-23 09:40:41,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:40:41,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:40:41,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:40:41,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:40:41,334 INFO L87 Difference]: Start difference. First operand 309 states and 490 transitions. Second operand 3 states. [2020-12-23 09:40:41,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:40:41,391 INFO L93 Difference]: Finished difference Result 797 states and 1280 transitions. [2020-12-23 09:40:41,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:40:41,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-23 09:40:41,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:40:41,396 INFO L225 Difference]: With dead ends: 797 [2020-12-23 09:40:41,396 INFO L226 Difference]: Without dead ends: 539 [2020-12-23 09:40:41,399 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 [2020-12-23 09:40:41,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-12-23 09:40:41,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 533. [2020-12-23 09:40:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2020-12-23 09:40:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 846 transitions. [2020-12-23 09:40:41,467 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 846 transitions. Word has length 61 [2020-12-23 09:40:41,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:40:41,467 INFO L481 AbstractCegarLoop]: Abstraction has 533 states and 846 transitions. [2020-12-23 09:40:41,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:40:41,468 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 846 transitions. [2020-12-23 09:40:41,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-23 09:40:41,471 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:40:41,472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:40:41,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:40:41,478 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:40:41,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:40:41,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1563109830, now seen corresponding path program 1 times [2020-12-23 09:40:41,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:40:41,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936528670] [2020-12-23 09:40:41,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:40:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:40:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:40:41,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936528670] [2020-12-23 09:40:41,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:40:41,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:40:41,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203534103] [2020-12-23 09:40:41,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:40:41,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:40:41,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:40:41,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:40:41,677 INFO L87 Difference]: Start difference. First operand 533 states and 846 transitions. Second operand 5 states. [2020-12-23 09:40:41,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:40:41,982 INFO L93 Difference]: Finished difference Result 2297 states and 3740 transitions. [2020-12-23 09:40:41,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 09:40:41,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2020-12-23 09:40:41,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:40:41,995 INFO L225 Difference]: With dead ends: 2297 [2020-12-23 09:40:41,995 INFO L226 Difference]: Without dead ends: 1815 [2020-12-23 09:40:41,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:40:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2020-12-23 09:40:42,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 954. [2020-12-23 09:40:42,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 954 states. [2020-12-23 09:40:42,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1526 transitions. [2020-12-23 09:40:42,059 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1526 transitions. Word has length 63 [2020-12-23 09:40:42,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:40:42,059 INFO L481 AbstractCegarLoop]: Abstraction has 954 states and 1526 transitions. [2020-12-23 09:40:42,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:40:42,060 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1526 transitions. [2020-12-23 09:40:42,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-23 09:40:42,065 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:40:42,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:40:42,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:40:42,066 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:40:42,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:40:42,068 INFO L82 PathProgramCache]: Analyzing trace with hash -711068186, now seen corresponding path program 1 times [2020-12-23 09:40:42,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:40:42,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535967138] [2020-12-23 09:40:42,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:40:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:40:42,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:40:42,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535967138] [2020-12-23 09:40:42,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:40:42,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:40:42,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223230004] [2020-12-23 09:40:42,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:40:42,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:40:42,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:40:42,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:40:42,209 INFO L87 Difference]: Start difference. First operand 954 states and 1526 transitions. Second operand 4 states. [2020-12-23 09:40:42,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:40:42,354 INFO L93 Difference]: Finished difference Result 2787 states and 4527 transitions. [2020-12-23 09:40:42,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:40:42,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-12-23 09:40:42,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:40:42,370 INFO L225 Difference]: With dead ends: 2787 [2020-12-23 09:40:42,370 INFO L226 Difference]: Without dead ends: 1884 [2020-12-23 09:40:42,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:40:42,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2020-12-23 09:40:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1410. [2020-12-23 09:40:42,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1410 states. [2020-12-23 09:40:42,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2269 transitions. [2020-12-23 09:40:42,450 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2269 transitions. Word has length 64 [2020-12-23 09:40:42,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:40:42,452 INFO L481 AbstractCegarLoop]: Abstraction has 1410 states and 2269 transitions. [2020-12-23 09:40:42,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:40:42,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2269 transitions. [2020-12-23 09:40:42,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-12-23 09:40:42,455 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:40:42,456 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:40:42,456 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:40:42,456 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:40:42,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:40:42,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1972861693, now seen corresponding path program 1 times [2020-12-23 09:40:42,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:40:42,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863291328] [2020-12-23 09:40:42,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:40:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:40:42,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:40:42,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863291328] [2020-12-23 09:40:42,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:40:42,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:40:42,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720756590] [2020-12-23 09:40:42,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:40:42,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:40:42,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:40:42,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:40:42,576 INFO L87 Difference]: Start difference. First operand 1410 states and 2269 transitions. Second operand 4 states. [2020-12-23 09:40:42,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:40:42,777 INFO L93 Difference]: Finished difference Result 4210 states and 6830 transitions. [2020-12-23 09:40:42,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:40:42,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2020-12-23 09:40:42,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:40:42,794 INFO L225 Difference]: With dead ends: 4210 [2020-12-23 09:40:42,794 INFO L226 Difference]: Without dead ends: 2851 [2020-12-23 09:40:42,798 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 [2020-12-23 09:40:42,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2020-12-23 09:40:42,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2061. [2020-12-23 09:40:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2061 states. [2020-12-23 09:40:42,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 3316 transitions. [2020-12-23 09:40:42,921 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 3316 transitions. Word has length 65 [2020-12-23 09:40:42,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:40:42,922 INFO L481 AbstractCegarLoop]: Abstraction has 2061 states and 3316 transitions. [2020-12-23 09:40:42,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:40:42,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 3316 transitions. [2020-12-23 09:40:42,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 09:40:42,925 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:40:42,925 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:40:42,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:40:42,926 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:40:42,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:40:42,926 INFO L82 PathProgramCache]: Analyzing trace with hash -555653635, now seen corresponding path program 1 times [2020-12-23 09:40:42,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:40:42,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111135816] [2020-12-23 09:40:42,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:40:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:40:43,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:40:43,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111135816] [2020-12-23 09:40:43,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:40:43,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:40:43,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854648270] [2020-12-23 09:40:43,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:40:43,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:40:43,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:40:43,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:40:43,059 INFO L87 Difference]: Start difference. First operand 2061 states and 3316 transitions. Second operand 4 states. [2020-12-23 09:40:43,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:40:43,268 INFO L93 Difference]: Finished difference Result 5951 states and 9641 transitions. [2020-12-23 09:40:43,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:40:43,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2020-12-23 09:40:43,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:40:43,289 INFO L225 Difference]: With dead ends: 5951 [2020-12-23 09:40:43,290 INFO L226 Difference]: Without dead ends: 3941 [2020-12-23 09:40:43,294 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:40:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states. [2020-12-23 09:40:43,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 2985. [2020-12-23 09:40:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2985 states. [2020-12-23 09:40:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2985 states and 4798 transitions. [2020-12-23 09:40:43,431 INFO L78 Accepts]: Start accepts. Automaton has 2985 states and 4798 transitions. Word has length 66 [2020-12-23 09:40:43,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:40:43,431 INFO L481 AbstractCegarLoop]: Abstraction has 2985 states and 4798 transitions. [2020-12-23 09:40:43,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:40:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2985 states and 4798 transitions. [2020-12-23 09:40:43,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 09:40:43,434 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:40:43,434 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:40:43,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:40:43,434 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:40:43,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:40:43,435 INFO L82 PathProgramCache]: Analyzing trace with hash -378063148, now seen corresponding path program 1 times [2020-12-23 09:40:43,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:40:43,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539406294] [2020-12-23 09:40:43,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:40:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:40:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:40:43,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539406294] [2020-12-23 09:40:43,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:40:43,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:40:43,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257310968] [2020-12-23 09:40:43,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:40:43,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:40:43,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:40:43,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:40:43,521 INFO L87 Difference]: Start difference. First operand 2985 states and 4798 transitions. Second operand 3 states. [2020-12-23 09:40:43,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:40:43,689 INFO L93 Difference]: Finished difference Result 6816 states and 10970 transitions. [2020-12-23 09:40:43,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:40:43,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-12-23 09:40:43,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:40:43,713 INFO L225 Difference]: With dead ends: 6816 [2020-12-23 09:40:43,714 INFO L226 Difference]: Without dead ends: 4694 [2020-12-23 09:40:43,720 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 [2020-12-23 09:40:43,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4694 states. [2020-12-23 09:40:43,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4694 to 4692. [2020-12-23 09:40:43,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4692 states. [2020-12-23 09:40:44,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4692 states to 4692 states and 7480 transitions. [2020-12-23 09:40:44,008 INFO L78 Accepts]: Start accepts. Automaton has 4692 states and 7480 transitions. Word has length 66 [2020-12-23 09:40:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:40:44,009 INFO L481 AbstractCegarLoop]: Abstraction has 4692 states and 7480 transitions. [2020-12-23 09:40:44,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:40:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 4692 states and 7480 transitions. [2020-12-23 09:40:44,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 09:40:44,018 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:40:44,018 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:40:44,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:40:44,019 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:40:44,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:40:44,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1715532573, now seen corresponding path program 1 times [2020-12-23 09:40:44,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:40:44,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998898397] [2020-12-23 09:40:44,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:40:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:40:44,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:40:44,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998898397] [2020-12-23 09:40:44,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:40:44,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:40:44,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75530324] [2020-12-23 09:40:44,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:40:44,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:40:44,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:40:44,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:40:44,105 INFO L87 Difference]: Start difference. First operand 4692 states and 7480 transitions. Second operand 3 states. [2020-12-23 09:40:44,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:40:44,360 INFO L93 Difference]: Finished difference Result 10280 states and 16458 transitions. [2020-12-23 09:40:44,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:40:44,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-12-23 09:40:44,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:40:44,424 INFO L225 Difference]: With dead ends: 10280 [2020-12-23 09:40:44,424 INFO L226 Difference]: Without dead ends: 6977 [2020-12-23 09:40:44,433 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 [2020-12-23 09:40:44,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6977 states. [2020-12-23 09:40:44,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6977 to 6975. [2020-12-23 09:40:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6975 states. [2020-12-23 09:40:44,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6975 states to 6975 states and 11065 transitions. [2020-12-23 09:40:44,827 INFO L78 Accepts]: Start accepts. Automaton has 6975 states and 11065 transitions. Word has length 66 [2020-12-23 09:40:44,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:40:44,828 INFO L481 AbstractCegarLoop]: Abstraction has 6975 states and 11065 transitions. [2020-12-23 09:40:44,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:40:44,828 INFO L276 IsEmpty]: Start isEmpty. Operand 6975 states and 11065 transitions. [2020-12-23 09:40:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 09:40:44,829 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:40:44,830 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:40:44,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:40:44,830 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:40:44,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:40:44,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1204542386, now seen corresponding path program 1 times [2020-12-23 09:40:44,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:40:44,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192086381] [2020-12-23 09:40:44,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:40:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:40:44,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:40:44,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192086381] [2020-12-23 09:40:44,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:40:44,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:40:44,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681999742] [2020-12-23 09:40:44,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:40:44,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:40:44,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:40:44,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:40:44,899 INFO L87 Difference]: Start difference. First operand 6975 states and 11065 transitions. Second operand 3 states. [2020-12-23 09:40:45,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:40:45,313 INFO L93 Difference]: Finished difference Result 15549 states and 24946 transitions. [2020-12-23 09:40:45,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:40:45,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-12-23 09:40:45,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:40:45,342 INFO L225 Difference]: With dead ends: 15549 [2020-12-23 09:40:45,342 INFO L226 Difference]: Without dead ends: 10462 [2020-12-23 09:40:45,352 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 [2020-12-23 09:40:45,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10462 states. [2020-12-23 09:40:45,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10462 to 10460. [2020-12-23 09:40:45,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10460 states. [2020-12-23 09:40:45,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10460 states to 10460 states and 16569 transitions. [2020-12-23 09:40:45,914 INFO L78 Accepts]: Start accepts. Automaton has 10460 states and 16569 transitions. Word has length 66 [2020-12-23 09:40:45,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:40:45,914 INFO L481 AbstractCegarLoop]: Abstraction has 10460 states and 16569 transitions. [2020-12-23 09:40:45,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:40:45,914 INFO L276 IsEmpty]: Start isEmpty. Operand 10460 states and 16569 transitions. [2020-12-23 09:40:45,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-23 09:40:45,915 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:40:45,915 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:40:45,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:40:45,916 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:40:45,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:40:45,917 INFO L82 PathProgramCache]: Analyzing trace with hash 760246741, now seen corresponding path program 1 times [2020-12-23 09:40:45,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:40:45,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404233408] [2020-12-23 09:40:45,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:40:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:40:46,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:40:46,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404233408] [2020-12-23 09:40:46,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:40:46,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:40:46,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012787850] [2020-12-23 09:40:46,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:40:46,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:40:46,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:40:46,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:40:46,080 INFO L87 Difference]: Start difference. First operand 10460 states and 16569 transitions. Second operand 5 states. [2020-12-23 09:40:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:40:46,699 INFO L93 Difference]: Finished difference Result 20849 states and 33040 transitions. [2020-12-23 09:40:46,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:40:46,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2020-12-23 09:40:46,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:40:46,724 INFO L225 Difference]: With dead ends: 20849 [2020-12-23 09:40:46,724 INFO L226 Difference]: Without dead ends: 10462 [2020-12-23 09:40:46,742 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:40:46,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10462 states. [2020-12-23 09:40:47,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10462 to 10460. [2020-12-23 09:40:47,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10460 states. [2020-12-23 09:40:47,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10460 states to 10460 states and 16444 transitions. [2020-12-23 09:40:47,357 INFO L78 Accepts]: Start accepts. Automaton has 10460 states and 16444 transitions. Word has length 68 [2020-12-23 09:40:47,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:40:47,358 INFO L481 AbstractCegarLoop]: Abstraction has 10460 states and 16444 transitions. [2020-12-23 09:40:47,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:40:47,358 INFO L276 IsEmpty]: Start isEmpty. Operand 10460 states and 16444 transitions. [2020-12-23 09:40:47,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-12-23 09:40:47,359 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:40:47,359 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:40:47,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:40:47,359 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:40:47,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:40:47,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1443931136, now seen corresponding path program 1 times [2020-12-23 09:40:47,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:40:47,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169273055] [2020-12-23 09:40:47,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:40:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:40:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:40:47,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169273055] [2020-12-23 09:40:47,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:40:47,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:40:47,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355307163] [2020-12-23 09:40:47,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:40:47,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:40:47,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:40:47,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:40:47,511 INFO L87 Difference]: Start difference. First operand 10460 states and 16444 transitions. Second operand 5 states. [2020-12-23 09:40:48,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:40:48,682 INFO L93 Difference]: Finished difference Result 37459 states and 59199 transitions. [2020-12-23 09:40:48,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:40:48,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2020-12-23 09:40:48,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:40:48,769 INFO L225 Difference]: With dead ends: 37459 [2020-12-23 09:40:48,769 INFO L226 Difference]: Without dead ends: 27072 [2020-12-23 09:40:48,795 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:40:48,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27072 states. [2020-12-23 09:40:49,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27072 to 19594. [2020-12-23 09:40:49,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19594 states. [2020-12-23 09:40:49,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19594 states to 19594 states and 30545 transitions. [2020-12-23 09:40:49,978 INFO L78 Accepts]: Start accepts. Automaton has 19594 states and 30545 transitions. Word has length 71 [2020-12-23 09:40:49,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:40:49,979 INFO L481 AbstractCegarLoop]: Abstraction has 19594 states and 30545 transitions. [2020-12-23 09:40:49,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:40:49,979 INFO L276 IsEmpty]: Start isEmpty. Operand 19594 states and 30545 transitions. [2020-12-23 09:40:49,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 09:40:49,980 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:40:49,980 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:40:49,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:40:49,981 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:40:49,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:40:49,982 INFO L82 PathProgramCache]: Analyzing trace with hash 2054199358, now seen corresponding path program 1 times [2020-12-23 09:40:49,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:40:49,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775528554] [2020-12-23 09:40:49,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:40:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:40:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:40:50,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775528554] [2020-12-23 09:40:50,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:40:50,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:40:50,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76204707] [2020-12-23 09:40:50,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:40:50,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:40:50,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:40:50,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:40:50,153 INFO L87 Difference]: Start difference. First operand 19594 states and 30545 transitions. Second operand 8 states. [2020-12-23 09:40:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:40:51,782 INFO L93 Difference]: Finished difference Result 39181 states and 60333 transitions. [2020-12-23 09:40:51,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 09:40:51,783 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2020-12-23 09:40:51,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:40:51,877 INFO L225 Difference]: With dead ends: 39181 [2020-12-23 09:40:51,877 INFO L226 Difference]: Without dead ends: 39179 [2020-12-23 09:40:51,888 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2020-12-23 09:40:51,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39179 states. [2020-12-23 09:40:53,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39179 to 20728. [2020-12-23 09:40:53,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20728 states. [2020-12-23 09:40:53,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20728 states to 20728 states and 31670 transitions. [2020-12-23 09:40:53,173 INFO L78 Accepts]: Start accepts. Automaton has 20728 states and 31670 transitions. Word has length 72 [2020-12-23 09:40:53,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:40:53,174 INFO L481 AbstractCegarLoop]: Abstraction has 20728 states and 31670 transitions. [2020-12-23 09:40:53,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:40:53,174 INFO L276 IsEmpty]: Start isEmpty. Operand 20728 states and 31670 transitions. [2020-12-23 09:40:53,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 09:40:53,177 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:40:53,178 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:40:53,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:40:53,178 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:40:53,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:40:53,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1822275862, now seen corresponding path program 1 times [2020-12-23 09:40:53,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:40:53,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636292718] [2020-12-23 09:40:53,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:40:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:40:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-23 09:40:53,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636292718] [2020-12-23 09:40:53,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:40:53,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:40:53,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116812141] [2020-12-23 09:40:53,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:40:53,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:40:53,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:40:53,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:40:53,291 INFO L87 Difference]: Start difference. First operand 20728 states and 31670 transitions. Second operand 5 states. [2020-12-23 09:40:54,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:40:54,517 INFO L93 Difference]: Finished difference Result 40736 states and 62686 transitions. [2020-12-23 09:40:54,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:40:54,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-12-23 09:40:54,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:40:54,604 INFO L225 Difference]: With dead ends: 40736 [2020-12-23 09:40:54,604 INFO L226 Difference]: Without dead ends: 30894 [2020-12-23 09:40:54,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:40:54,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30894 states. [2020-12-23 09:40:55,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30894 to 26348. [2020-12-23 09:40:55,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26348 states. [2020-12-23 09:40:55,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26348 states to 26348 states and 40344 transitions. [2020-12-23 09:40:55,939 INFO L78 Accepts]: Start accepts. Automaton has 26348 states and 40344 transitions. Word has length 98 [2020-12-23 09:40:55,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:40:55,940 INFO L481 AbstractCegarLoop]: Abstraction has 26348 states and 40344 transitions. [2020-12-23 09:40:55,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:40:55,940 INFO L276 IsEmpty]: Start isEmpty. Operand 26348 states and 40344 transitions. [2020-12-23 09:40:55,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 09:40:55,943 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:40:55,943 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:40:55,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 09:40:55,944 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:40:55,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:40:55,944 INFO L82 PathProgramCache]: Analyzing trace with hash 484806437, now seen corresponding path program 1 times [2020-12-23 09:40:55,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:40:55,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271320015] [2020-12-23 09:40:55,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:40:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:40:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-23 09:40:56,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271320015] [2020-12-23 09:40:56,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:40:56,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:40:56,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640794382] [2020-12-23 09:40:56,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:40:56,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:40:56,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:40:56,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:40:56,047 INFO L87 Difference]: Start difference. First operand 26348 states and 40344 transitions. Second operand 5 states. [2020-12-23 09:40:57,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:40:57,854 INFO L93 Difference]: Finished difference Result 42720 states and 65762 transitions. [2020-12-23 09:40:57,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:40:57,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-12-23 09:40:57,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:40:57,914 INFO L225 Difference]: With dead ends: 42720 [2020-12-23 09:40:57,915 INFO L226 Difference]: Without dead ends: 32878 [2020-12-23 09:40:57,938 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:40:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32878 states. [2020-12-23 09:40:59,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32878 to 32056. [2020-12-23 09:40:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32056 states. [2020-12-23 09:40:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32056 states to 32056 states and 49180 transitions. [2020-12-23 09:40:59,506 INFO L78 Accepts]: Start accepts. Automaton has 32056 states and 49180 transitions. Word has length 98 [2020-12-23 09:40:59,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:40:59,506 INFO L481 AbstractCegarLoop]: Abstraction has 32056 states and 49180 transitions. [2020-12-23 09:40:59,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:40:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand 32056 states and 49180 transitions. [2020-12-23 09:40:59,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 09:40:59,509 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:40:59,510 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:40:59,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 09:40:59,510 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:40:59,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:40:59,510 INFO L82 PathProgramCache]: Analyzing trace with hash -890085900, now seen corresponding path program 1 times [2020-12-23 09:40:59,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:40:59,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539694998] [2020-12-23 09:40:59,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:40:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:40:59,597 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 09:40:59,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539694998] [2020-12-23 09:40:59,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:40:59,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:40:59,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881829982] [2020-12-23 09:40:59,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:40:59,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:40:59,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:40:59,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:40:59,600 INFO L87 Difference]: Start difference. First operand 32056 states and 49180 transitions. Second operand 5 states. [2020-12-23 09:41:01,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:41:01,296 INFO L93 Difference]: Finished difference Result 46188 states and 71292 transitions. [2020-12-23 09:41:01,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:41:01,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-12-23 09:41:01,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:41:01,347 INFO L225 Difference]: With dead ends: 46188 [2020-12-23 09:41:01,347 INFO L226 Difference]: Without dead ends: 36126 [2020-12-23 09:41:01,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:41:01,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36126 states. [2020-12-23 09:41:03,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36126 to 35304. [2020-12-23 09:41:03,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35304 states. [2020-12-23 09:41:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35304 states to 35304 states and 54280 transitions. [2020-12-23 09:41:03,144 INFO L78 Accepts]: Start accepts. Automaton has 35304 states and 54280 transitions. Word has length 98 [2020-12-23 09:41:03,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:41:03,144 INFO L481 AbstractCegarLoop]: Abstraction has 35304 states and 54280 transitions. [2020-12-23 09:41:03,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:41:03,144 INFO L276 IsEmpty]: Start isEmpty. Operand 35304 states and 54280 transitions. [2020-12-23 09:41:03,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-23 09:41:03,147 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:41:03,148 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:41:03,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 09:41:03,148 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:41:03,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:41:03,149 INFO L82 PathProgramCache]: Analyzing trace with hash 549275512, now seen corresponding path program 1 times [2020-12-23 09:41:03,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:41:03,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075651998] [2020-12-23 09:41:03,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:41:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:41:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 09:41:03,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075651998] [2020-12-23 09:41:03,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:41:03,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:41:03,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432080298] [2020-12-23 09:41:03,229 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:41:03,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:41:03,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:41:03,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:41:03,230 INFO L87 Difference]: Start difference. First operand 35304 states and 54280 transitions. Second operand 4 states. [2020-12-23 09:41:04,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:41:04,997 INFO L93 Difference]: Finished difference Result 55138 states and 85355 transitions. [2020-12-23 09:41:04,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:41:04,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2020-12-23 09:41:04,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:41:05,056 INFO L225 Difference]: With dead ends: 55138 [2020-12-23 09:41:05,056 INFO L226 Difference]: Without dead ends: 41828 [2020-12-23 09:41:05,067 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 [2020-12-23 09:41:05,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41828 states. [2020-12-23 09:41:06,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41828 to 40208. [2020-12-23 09:41:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40208 states. [2020-12-23 09:41:07,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40208 states to 40208 states and 61860 transitions. [2020-12-23 09:41:07,041 INFO L78 Accepts]: Start accepts. Automaton has 40208 states and 61860 transitions. Word has length 99 [2020-12-23 09:41:07,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:41:07,042 INFO L481 AbstractCegarLoop]: Abstraction has 40208 states and 61860 transitions. [2020-12-23 09:41:07,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:41:07,042 INFO L276 IsEmpty]: Start isEmpty. Operand 40208 states and 61860 transitions. [2020-12-23 09:41:07,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-23 09:41:07,045 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:41:07,045 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:41:07,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 09:41:07,045 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:41:07,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:41:07,046 INFO L82 PathProgramCache]: Analyzing trace with hash 971977338, now seen corresponding path program 1 times [2020-12-23 09:41:07,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:41:07,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620060666] [2020-12-23 09:41:07,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:41:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:41:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 09:41:07,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620060666] [2020-12-23 09:41:07,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:41:07,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:41:07,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373096930] [2020-12-23 09:41:07,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:41:07,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:41:07,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:41:07,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:41:07,110 INFO L87 Difference]: Start difference. First operand 40208 states and 61860 transitions. Second operand 3 states. [2020-12-23 09:41:09,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:41:09,879 INFO L93 Difference]: Finished difference Result 83760 states and 129608 transitions. [2020-12-23 09:41:09,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:41:09,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2020-12-23 09:41:09,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:41:09,983 INFO L225 Difference]: With dead ends: 83760 [2020-12-23 09:41:09,983 INFO L226 Difference]: Without dead ends: 68957 [2020-12-23 09:41:10,002 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 [2020-12-23 09:41:10,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68957 states. [2020-12-23 09:41:12,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68957 to 68768. [2020-12-23 09:41:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68768 states. [2020-12-23 09:41:13,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68768 states to 68768 states and 105890 transitions. [2020-12-23 09:41:13,010 INFO L78 Accepts]: Start accepts. Automaton has 68768 states and 105890 transitions. Word has length 99 [2020-12-23 09:41:13,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:41:13,011 INFO L481 AbstractCegarLoop]: Abstraction has 68768 states and 105890 transitions. [2020-12-23 09:41:13,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:41:13,011 INFO L276 IsEmpty]: Start isEmpty. Operand 68768 states and 105890 transitions. [2020-12-23 09:41:13,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 09:41:13,015 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:41:13,015 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:41:13,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 09:41:13,015 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:41:13,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:41:13,016 INFO L82 PathProgramCache]: Analyzing trace with hash 810419356, now seen corresponding path program 1 times [2020-12-23 09:41:13,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:41:13,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026992775] [2020-12-23 09:41:13,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:41:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:41:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-23 09:41:13,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026992775] [2020-12-23 09:41:13,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:41:13,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:41:13,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158376190] [2020-12-23 09:41:13,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:41:13,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:41:13,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:41:13,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:41:13,113 INFO L87 Difference]: Start difference. First operand 68768 states and 105890 transitions. Second operand 4 states. [2020-12-23 09:41:16,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:41:16,230 INFO L93 Difference]: Finished difference Result 101592 states and 157123 transitions. [2020-12-23 09:41:16,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:41:16,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2020-12-23 09:41:16,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:41:16,358 INFO L225 Difference]: With dead ends: 101592 [2020-12-23 09:41:16,358 INFO L226 Difference]: Without dead ends: 78892 [2020-12-23 09:41:16,389 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 [2020-12-23 09:41:16,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78892 states. [2020-12-23 09:41:19,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78892 to 74052. [2020-12-23 09:41:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74052 states. [2020-12-23 09:41:19,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74052 states to 74052 states and 114036 transitions. [2020-12-23 09:41:19,889 INFO L78 Accepts]: Start accepts. Automaton has 74052 states and 114036 transitions. Word has length 100 [2020-12-23 09:41:19,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:41:19,890 INFO L481 AbstractCegarLoop]: Abstraction has 74052 states and 114036 transitions. [2020-12-23 09:41:19,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:41:19,890 INFO L276 IsEmpty]: Start isEmpty. Operand 74052 states and 114036 transitions. [2020-12-23 09:41:19,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 09:41:19,893 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:41:19,893 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:41:19,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 09:41:19,894 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:41:19,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:41:19,894 INFO L82 PathProgramCache]: Analyzing trace with hash -210648998, now seen corresponding path program 1 times [2020-12-23 09:41:19,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:41:19,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014176760] [2020-12-23 09:41:19,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:41:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:41:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-23 09:41:19,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014176760] [2020-12-23 09:41:19,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:41:19,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:41:19,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401923618] [2020-12-23 09:41:19,957 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:41:19,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:41:19,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:41:19,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:41:19,958 INFO L87 Difference]: Start difference. First operand 74052 states and 114036 transitions. Second operand 3 states. [2020-12-23 09:41:24,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:41:24,837 INFO L93 Difference]: Finished difference Result 152700 states and 235966 transitions. [2020-12-23 09:41:24,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:41:24,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-12-23 09:41:24,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:41:25,195 INFO L225 Difference]: With dead ends: 152700 [2020-12-23 09:41:25,195 INFO L226 Difference]: Without dead ends: 123027 [2020-12-23 09:41:25,243 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 [2020-12-23 09:41:25,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123027 states. [2020-12-23 09:41:30,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123027 to 122698. [2020-12-23 09:41:30,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122698 states. [2020-12-23 09:41:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122698 states to 122698 states and 188738 transitions. [2020-12-23 09:41:31,170 INFO L78 Accepts]: Start accepts. Automaton has 122698 states and 188738 transitions. Word has length 100 [2020-12-23 09:41:31,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:41:31,171 INFO L481 AbstractCegarLoop]: Abstraction has 122698 states and 188738 transitions. [2020-12-23 09:41:31,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:41:31,171 INFO L276 IsEmpty]: Start isEmpty. Operand 122698 states and 188738 transitions. [2020-12-23 09:41:31,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 09:41:31,179 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:41:31,179 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:41:31,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 09:41:31,179 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:41:31,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:41:31,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1372371469, now seen corresponding path program 1 times [2020-12-23 09:41:31,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:41:31,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534459990] [2020-12-23 09:41:31,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:41:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:41:31,296 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:41:31,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534459990] [2020-12-23 09:41:31,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:41:31,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:41:31,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339695299] [2020-12-23 09:41:31,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:41:31,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:41:31,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:41:31,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:41:31,298 INFO L87 Difference]: Start difference. First operand 122698 states and 188738 transitions. Second operand 3 states. [2020-12-23 09:41:40,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:41:40,942 INFO L93 Difference]: Finished difference Result 364021 states and 559550 transitions. [2020-12-23 09:41:40,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:41:40,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-12-23 09:41:40,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:41:41,514 INFO L225 Difference]: With dead ends: 364021 [2020-12-23 09:41:41,515 INFO L226 Difference]: Without dead ends: 241396 [2020-12-23 09:41:41,629 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 [2020-12-23 09:41:41,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241396 states. [2020-12-23 09:41:52,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241396 to 241394. [2020-12-23 09:41:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241394 states. [2020-12-23 09:41:53,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241394 states to 241394 states and 368354 transitions. [2020-12-23 09:41:53,751 INFO L78 Accepts]: Start accepts. Automaton has 241394 states and 368354 transitions. Word has length 100 [2020-12-23 09:41:53,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:41:53,751 INFO L481 AbstractCegarLoop]: Abstraction has 241394 states and 368354 transitions. [2020-12-23 09:41:53,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:41:53,751 INFO L276 IsEmpty]: Start isEmpty. Operand 241394 states and 368354 transitions. [2020-12-23 09:41:53,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 09:41:53,765 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:41:53,765 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:41:53,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 09:41:53,765 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:41:53,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:41:53,767 INFO L82 PathProgramCache]: Analyzing trace with hash 597349977, now seen corresponding path program 1 times [2020-12-23 09:41:53,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:41:53,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141498663] [2020-12-23 09:41:53,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:41:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:41:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:41:53,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141498663] [2020-12-23 09:41:53,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:41:53,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:41:53,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245163844] [2020-12-23 09:41:53,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:41:53,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:41:53,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:41:53,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:41:53,839 INFO L87 Difference]: Start difference. First operand 241394 states and 368354 transitions. Second operand 3 states. [2020-12-23 09:42:14,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:42:14,348 INFO L93 Difference]: Finished difference Result 716438 states and 1092336 transitions. [2020-12-23 09:42:14,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:42:14,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-12-23 09:42:14,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:42:15,911 INFO L225 Difference]: With dead ends: 716438 [2020-12-23 09:42:15,912 INFO L226 Difference]: Without dead ends: 475161 [2020-12-23 09:42:16,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:42:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475161 states.