/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.4.ufo.BOUNDED-6.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:36:35,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:36:35,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:36:35,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:36:35,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:36:36,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:36:36,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:36:36,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:36:36,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:36:36,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:36:36,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:36:36,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:36:36,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:36:36,042 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:36:36,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:36:36,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:36:36,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:36:36,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:36:36,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:36:36,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:36:36,068 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:36:36,071 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:36:36,072 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:36:36,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:36:36,078 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:36:36,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:36:36,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:36:36,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:36:36,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:36:36,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:36:36,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:36:36,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:36:36,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:36:36,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:36:36,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:36:36,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:36:36,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:36:36,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:36:36,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:36:36,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:36:36,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:36:36,093 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:36:36,138 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:36:36,138 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:36:36,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:36:36,143 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:36:36,143 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:36:36,143 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:36:36,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:36:36,144 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:36:36,144 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:36:36,144 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:36:36,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:36:36,145 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:36:36,145 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:36:36,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:36:36,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:36:36,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:36:36,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:36:36,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:36:36,146 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:36:36,146 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:36:36,147 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:36:36,147 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:36:36,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:36:36,147 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:36:36,147 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:36:36,147 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 19:36:36,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:36:36,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:36:36,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:36:36,588 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:36:36,589 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:36:36,590 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.4.ufo.BOUNDED-6.pals.c [2021-01-06 19:36:36,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/5298dc2b9/6feee4deebfc4613a7c3a4fccb04ff52/FLAGe9fd5c9d3 [2021-01-06 19:36:37,459 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:36:37,460 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2021-01-06 19:36:37,475 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/5298dc2b9/6feee4deebfc4613a7c3a4fccb04ff52/FLAGe9fd5c9d3 [2021-01-06 19:36:37,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/5298dc2b9/6feee4deebfc4613a7c3a4fccb04ff52 [2021-01-06 19:36:37,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:36:37,752 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:36:37,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:36:37,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:36:37,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:36:37,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:36:37" (1/1) ... [2021-01-06 19:36:37,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e6a4fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:37, skipping insertion in model container [2021-01-06 19:36:37,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:36:37" (1/1) ... [2021-01-06 19:36:37,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:36:37,832 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[~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[~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[~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___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,] [2021-01-06 19:36:38,092 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.4.ufo.BOUNDED-6.pals.c[12764,12777] [2021-01-06 19:36:38,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:36:38,108 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[~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[~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[~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___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,] [2021-01-06 19:36:38,228 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.4.ufo.BOUNDED-6.pals.c[12764,12777] [2021-01-06 19:36:38,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:36:38,259 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:36:38,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:38 WrapperNode [2021-01-06 19:36:38,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:36:38,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:36:38,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:36:38,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:36:38,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:38" (1/1) ... [2021-01-06 19:36:38,285 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:38" (1/1) ... [2021-01-06 19:36:38,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:36:38,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:36:38,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:36:38,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:36:38,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:38" (1/1) ... [2021-01-06 19:36:38,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:38" (1/1) ... [2021-01-06 19:36:38,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:38" (1/1) ... [2021-01-06 19:36:38,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:38" (1/1) ... [2021-01-06 19:36:38,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:38" (1/1) ... [2021-01-06 19:36:38,367 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:38" (1/1) ... [2021-01-06 19:36:38,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:38" (1/1) ... [2021-01-06 19:36:38,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:36:38,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:36:38,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:36:38,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:36:38,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36: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 [2021-01-06 19:36:38,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:36:38,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:36:38,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:36:38,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:36:39,582 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:36:39,586 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-01-06 19:36:39,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:36:39 BoogieIcfgContainer [2021-01-06 19:36:39,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:36:39,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:36:39,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:36:39,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:36:39,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:36:37" (1/3) ... [2021-01-06 19:36:39,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f442b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:36:39, skipping insertion in model container [2021-01-06 19:36:39,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:36:38" (2/3) ... [2021-01-06 19:36:39,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f442b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:36:39, skipping insertion in model container [2021-01-06 19:36:39,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:36:39" (3/3) ... [2021-01-06 19:36:39,609 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c [2021-01-06 19:36:39,630 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:36:39,639 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:36:39,671 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:36:39,708 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:36:39,708 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:36:39,709 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:36:39,709 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:36:39,709 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:36:39,709 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:36:39,709 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:36:39,710 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:36:39,732 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2021-01-06 19:36:39,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:36:39,741 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:39,743 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] [2021-01-06 19:36:39,743 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:39,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:39,750 INFO L82 PathProgramCache]: Analyzing trace with hash -306716250, now seen corresponding path program 1 times [2021-01-06 19:36:39,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:39,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541214913] [2021-01-06 19:36:39,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:40,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:40,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541214913] [2021-01-06 19:36:40,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:40,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:36:40,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293456430] [2021-01-06 19:36:40,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 19:36:40,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:40,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 19:36:40,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:36:40,227 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 2 states. [2021-01-06 19:36:40,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:40,278 INFO L93 Difference]: Finished difference Result 206 states and 352 transitions. [2021-01-06 19:36:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 19:36:40,280 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2021-01-06 19:36:40,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:40,294 INFO L225 Difference]: With dead ends: 206 [2021-01-06 19:36:40,295 INFO L226 Difference]: Without dead ends: 127 [2021-01-06 19:36:40,299 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 [2021-01-06 19:36:40,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-01-06 19:36:40,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-01-06 19:36:40,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2021-01-06 19:36:40,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 220 transitions. [2021-01-06 19:36:40,358 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 220 transitions. Word has length 37 [2021-01-06 19:36:40,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:40,359 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 220 transitions. [2021-01-06 19:36:40,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 19:36:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 220 transitions. [2021-01-06 19:36:40,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:36:40,362 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:40,362 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] [2021-01-06 19:36:40,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:36:40,363 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:40,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:40,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1124364700, now seen corresponding path program 1 times [2021-01-06 19:36:40,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:40,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611610794] [2021-01-06 19:36:40,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:40,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611610794] [2021-01-06 19:36:40,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:40,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:36:40,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88427156] [2021-01-06 19:36:40,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:36:40,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:40,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:36:40,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:36:40,609 INFO L87 Difference]: Start difference. First operand 127 states and 220 transitions. Second operand 5 states. [2021-01-06 19:36:40,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:40,836 INFO L93 Difference]: Finished difference Result 271 states and 460 transitions. [2021-01-06 19:36:40,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:36:40,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2021-01-06 19:36:40,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:40,845 INFO L225 Difference]: With dead ends: 271 [2021-01-06 19:36:40,845 INFO L226 Difference]: Without dead ends: 197 [2021-01-06 19:36:40,848 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 [2021-01-06 19:36:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-01-06 19:36:40,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 127. [2021-01-06 19:36:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2021-01-06 19:36:40,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 193 transitions. [2021-01-06 19:36:40,879 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 193 transitions. Word has length 37 [2021-01-06 19:36:40,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:40,880 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 193 transitions. [2021-01-06 19:36:40,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:36:40,880 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 193 transitions. [2021-01-06 19:36:40,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 19:36:40,885 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:40,885 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] [2021-01-06 19:36:40,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:36:40,886 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:40,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:40,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1313145683, now seen corresponding path program 1 times [2021-01-06 19:36:40,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:40,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217859798] [2021-01-06 19:36:40,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:41,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217859798] [2021-01-06 19:36:41,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:41,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:36:41,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090047216] [2021-01-06 19:36:41,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:36:41,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:41,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:36:41,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:41,006 INFO L87 Difference]: Start difference. First operand 127 states and 193 transitions. Second operand 3 states. [2021-01-06 19:36:41,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:41,082 INFO L93 Difference]: Finished difference Result 252 states and 402 transitions. [2021-01-06 19:36:41,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:36:41,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2021-01-06 19:36:41,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:41,086 INFO L225 Difference]: With dead ends: 252 [2021-01-06 19:36:41,086 INFO L226 Difference]: Without dead ends: 182 [2021-01-06 19:36:41,087 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:41,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-01-06 19:36:41,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2021-01-06 19:36:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2021-01-06 19:36:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 278 transitions. [2021-01-06 19:36:41,118 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 278 transitions. Word has length 63 [2021-01-06 19:36:41,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:41,118 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 278 transitions. [2021-01-06 19:36:41,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:36:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 278 transitions. [2021-01-06 19:36:41,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 19:36:41,127 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:41,128 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] [2021-01-06 19:36:41,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:36:41,128 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:41,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:41,131 INFO L82 PathProgramCache]: Analyzing trace with hash -255493166, now seen corresponding path program 1 times [2021-01-06 19:36:41,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:41,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354135155] [2021-01-06 19:36:41,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:41,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354135155] [2021-01-06 19:36:41,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:41,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:36:41,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162153046] [2021-01-06 19:36:41,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:36:41,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:41,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:36:41,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:41,276 INFO L87 Difference]: Start difference. First operand 180 states and 278 transitions. Second operand 3 states. [2021-01-06 19:36:41,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:41,307 INFO L93 Difference]: Finished difference Result 360 states and 576 transitions. [2021-01-06 19:36:41,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:36:41,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2021-01-06 19:36:41,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:41,312 INFO L225 Difference]: With dead ends: 360 [2021-01-06 19:36:41,312 INFO L226 Difference]: Without dead ends: 237 [2021-01-06 19:36:41,316 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:41,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-01-06 19:36:41,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2021-01-06 19:36:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2021-01-06 19:36:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 370 transitions. [2021-01-06 19:36:41,332 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 370 transitions. Word has length 65 [2021-01-06 19:36:41,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:41,333 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 370 transitions. [2021-01-06 19:36:41,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:36:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 370 transitions. [2021-01-06 19:36:41,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 19:36:41,334 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:41,334 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] [2021-01-06 19:36:41,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:36:41,335 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:41,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:41,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1395779292, now seen corresponding path program 1 times [2021-01-06 19:36:41,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:41,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979501789] [2021-01-06 19:36:41,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:41,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979501789] [2021-01-06 19:36:41,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:41,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:36:41,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518586800] [2021-01-06 19:36:41,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:36:41,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:41,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:36:41,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:41,410 INFO L87 Difference]: Start difference. First operand 235 states and 370 transitions. Second operand 3 states. [2021-01-06 19:36:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:41,462 INFO L93 Difference]: Finished difference Result 566 states and 917 transitions. [2021-01-06 19:36:41,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:36:41,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2021-01-06 19:36:41,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:41,467 INFO L225 Difference]: With dead ends: 566 [2021-01-06 19:36:41,467 INFO L226 Difference]: Without dead ends: 390 [2021-01-06 19:36:41,469 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:41,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-01-06 19:36:41,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 388. [2021-01-06 19:36:41,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2021-01-06 19:36:41,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 620 transitions. [2021-01-06 19:36:41,497 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 620 transitions. Word has length 65 [2021-01-06 19:36:41,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:41,499 INFO L481 AbstractCegarLoop]: Abstraction has 388 states and 620 transitions. [2021-01-06 19:36:41,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:36:41,500 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 620 transitions. [2021-01-06 19:36:41,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 19:36:41,501 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:41,501 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] [2021-01-06 19:36:41,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:36:41,502 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:41,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:41,502 INFO L82 PathProgramCache]: Analyzing trace with hash -812427391, now seen corresponding path program 1 times [2021-01-06 19:36:41,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:41,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73420954] [2021-01-06 19:36:41,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:41,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:41,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73420954] [2021-01-06 19:36:41,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:41,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:36:41,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993556401] [2021-01-06 19:36:41,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:36:41,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:41,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:36:41,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:41,601 INFO L87 Difference]: Start difference. First operand 388 states and 620 transitions. Second operand 3 states. [2021-01-06 19:36:41,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:41,649 INFO L93 Difference]: Finished difference Result 705 states and 1143 transitions. [2021-01-06 19:36:41,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:36:41,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2021-01-06 19:36:41,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:41,656 INFO L225 Difference]: With dead ends: 705 [2021-01-06 19:36:41,656 INFO L226 Difference]: Without dead ends: 529 [2021-01-06 19:36:41,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:41,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-01-06 19:36:41,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 527. [2021-01-06 19:36:41,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2021-01-06 19:36:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 845 transitions. [2021-01-06 19:36:41,705 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 845 transitions. Word has length 67 [2021-01-06 19:36:41,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:41,706 INFO L481 AbstractCegarLoop]: Abstraction has 527 states and 845 transitions. [2021-01-06 19:36:41,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:36:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 845 transitions. [2021-01-06 19:36:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 19:36:41,707 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:41,707 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] [2021-01-06 19:36:41,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:36:41,708 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:41,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:41,709 INFO L82 PathProgramCache]: Analyzing trace with hash 221435787, now seen corresponding path program 1 times [2021-01-06 19:36:41,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:41,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452462963] [2021-01-06 19:36:41,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:41,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452462963] [2021-01-06 19:36:41,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:41,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:36:41,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675652688] [2021-01-06 19:36:41,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:36:41,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:41,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:36:41,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:41,836 INFO L87 Difference]: Start difference. First operand 527 states and 845 transitions. Second operand 3 states. [2021-01-06 19:36:41,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:41,890 INFO L93 Difference]: Finished difference Result 1380 states and 2236 transitions. [2021-01-06 19:36:41,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:36:41,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2021-01-06 19:36:41,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:41,896 INFO L225 Difference]: With dead ends: 1380 [2021-01-06 19:36:41,897 INFO L226 Difference]: Without dead ends: 922 [2021-01-06 19:36:41,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:41,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2021-01-06 19:36:41,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 920. [2021-01-06 19:36:41,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2021-01-06 19:36:41,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1472 transitions. [2021-01-06 19:36:41,936 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1472 transitions. Word has length 67 [2021-01-06 19:36:41,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:41,938 INFO L481 AbstractCegarLoop]: Abstraction has 920 states and 1472 transitions. [2021-01-06 19:36:41,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:36:41,938 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1472 transitions. [2021-01-06 19:36:41,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 19:36:41,939 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:41,939 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] [2021-01-06 19:36:41,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:36:41,940 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:41,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:41,940 INFO L82 PathProgramCache]: Analyzing trace with hash 664156592, now seen corresponding path program 1 times [2021-01-06 19:36:41,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:41,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237136426] [2021-01-06 19:36:41,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:42,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237136426] [2021-01-06 19:36:42,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:42,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:36:42,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797697459] [2021-01-06 19:36:42,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:36:42,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:42,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:36:42,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:42,028 INFO L87 Difference]: Start difference. First operand 920 states and 1472 transitions. Second operand 3 states. [2021-01-06 19:36:42,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:42,074 INFO L93 Difference]: Finished difference Result 1711 states and 2761 transitions. [2021-01-06 19:36:42,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:36:42,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2021-01-06 19:36:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:42,082 INFO L225 Difference]: With dead ends: 1711 [2021-01-06 19:36:42,082 INFO L226 Difference]: Without dead ends: 1253 [2021-01-06 19:36:42,084 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:42,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2021-01-06 19:36:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1251. [2021-01-06 19:36:42,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1251 states. [2021-01-06 19:36:42,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1996 transitions. [2021-01-06 19:36:42,135 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1996 transitions. Word has length 69 [2021-01-06 19:36:42,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:42,136 INFO L481 AbstractCegarLoop]: Abstraction has 1251 states and 1996 transitions. [2021-01-06 19:36:42,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:36:42,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1996 transitions. [2021-01-06 19:36:42,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 19:36:42,143 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:42,143 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] [2021-01-06 19:36:42,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:36:42,143 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:42,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:42,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1757720902, now seen corresponding path program 1 times [2021-01-06 19:36:42,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:42,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416447350] [2021-01-06 19:36:42,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:42,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416447350] [2021-01-06 19:36:42,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:42,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:36:42,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379626269] [2021-01-06 19:36:42,306 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:36:42,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:42,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:36:42,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:36:42,309 INFO L87 Difference]: Start difference. First operand 1251 states and 1996 transitions. Second operand 5 states. [2021-01-06 19:36:42,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:42,657 INFO L93 Difference]: Finished difference Result 7020 states and 11356 transitions. [2021-01-06 19:36:42,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:36:42,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2021-01-06 19:36:42,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:42,691 INFO L225 Difference]: With dead ends: 7020 [2021-01-06 19:36:42,692 INFO L226 Difference]: Without dead ends: 5848 [2021-01-06 19:36:42,697 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:36:42,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5848 states. [2021-01-06 19:36:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5848 to 2385. [2021-01-06 19:36:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2385 states. [2021-01-06 19:36:42,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 3796 transitions. [2021-01-06 19:36:42,835 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 3796 transitions. Word has length 69 [2021-01-06 19:36:42,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:42,835 INFO L481 AbstractCegarLoop]: Abstraction has 2385 states and 3796 transitions. [2021-01-06 19:36:42,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:36:42,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 3796 transitions. [2021-01-06 19:36:42,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 19:36:42,836 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:42,837 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] [2021-01-06 19:36:42,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:36:42,837 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:42,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:42,838 INFO L82 PathProgramCache]: Analyzing trace with hash -577605759, now seen corresponding path program 1 times [2021-01-06 19:36:42,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:42,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429767565] [2021-01-06 19:36:42,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:42,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:42,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429767565] [2021-01-06 19:36:42,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:42,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:36:42,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565460261] [2021-01-06 19:36:42,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:36:42,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:42,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:36:42,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:36:42,904 INFO L87 Difference]: Start difference. First operand 2385 states and 3796 transitions. Second operand 4 states. [2021-01-06 19:36:43,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:43,246 INFO L93 Difference]: Finished difference Result 9047 states and 14463 transitions. [2021-01-06 19:36:43,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:36:43,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2021-01-06 19:36:43,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:43,288 INFO L225 Difference]: With dead ends: 9047 [2021-01-06 19:36:43,288 INFO L226 Difference]: Without dead ends: 6741 [2021-01-06 19:36:43,296 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 [2021-01-06 19:36:43,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6741 states. [2021-01-06 19:36:43,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6741 to 4544. [2021-01-06 19:36:43,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4544 states. [2021-01-06 19:36:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4544 states to 4544 states and 7198 transitions. [2021-01-06 19:36:43,599 INFO L78 Accepts]: Start accepts. Automaton has 4544 states and 7198 transitions. Word has length 70 [2021-01-06 19:36:43,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:43,599 INFO L481 AbstractCegarLoop]: Abstraction has 4544 states and 7198 transitions. [2021-01-06 19:36:43,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:36:43,599 INFO L276 IsEmpty]: Start isEmpty. Operand 4544 states and 7198 transitions. [2021-01-06 19:36:43,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 19:36:43,600 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:43,600 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] [2021-01-06 19:36:43,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:36:43,601 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:43,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:43,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1815229649, now seen corresponding path program 1 times [2021-01-06 19:36:43,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:43,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394207813] [2021-01-06 19:36:43,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:43,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:43,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394207813] [2021-01-06 19:36:43,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:43,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:36:43,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478469674] [2021-01-06 19:36:43,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:36:43,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:43,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:36:43,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:36:43,703 INFO L87 Difference]: Start difference. First operand 4544 states and 7198 transitions. Second operand 4 states. [2021-01-06 19:36:44,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:44,217 INFO L93 Difference]: Finished difference Result 14858 states and 23638 transitions. [2021-01-06 19:36:44,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:36:44,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2021-01-06 19:36:44,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:44,273 INFO L225 Difference]: With dead ends: 14858 [2021-01-06 19:36:44,273 INFO L226 Difference]: Without dead ends: 10393 [2021-01-06 19:36:44,282 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:36:44,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10393 states. [2021-01-06 19:36:44,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10393 to 7308. [2021-01-06 19:36:44,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7308 states. [2021-01-06 19:36:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7308 states to 7308 states and 11506 transitions. [2021-01-06 19:36:44,752 INFO L78 Accepts]: Start accepts. Automaton has 7308 states and 11506 transitions. Word has length 71 [2021-01-06 19:36:44,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:44,752 INFO L481 AbstractCegarLoop]: Abstraction has 7308 states and 11506 transitions. [2021-01-06 19:36:44,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:36:44,753 INFO L276 IsEmpty]: Start isEmpty. Operand 7308 states and 11506 transitions. [2021-01-06 19:36:44,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:36:44,753 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:36:44,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:36:44,754 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:44,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:44,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1147279688, now seen corresponding path program 1 times [2021-01-06 19:36:44,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:44,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709016372] [2021-01-06 19:36:44,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:44,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:44,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709016372] [2021-01-06 19:36:44,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:44,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:36:44,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182993226] [2021-01-06 19:36:44,817 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:36:44,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:44,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:36:44,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:36:44,819 INFO L87 Difference]: Start difference. First operand 7308 states and 11506 transitions. Second operand 4 states. [2021-01-06 19:36:45,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:45,515 INFO L93 Difference]: Finished difference Result 23155 states and 36579 transitions. [2021-01-06 19:36:45,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:36:45,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-01-06 19:36:45,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:45,566 INFO L225 Difference]: With dead ends: 23155 [2021-01-06 19:36:45,567 INFO L226 Difference]: Without dead ends: 15926 [2021-01-06 19:36:45,585 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 [2021-01-06 19:36:45,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15926 states. [2021-01-06 19:36:46,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15926 to 11564. [2021-01-06 19:36:46,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11564 states. [2021-01-06 19:36:46,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11564 states to 11564 states and 18086 transitions. [2021-01-06 19:36:46,328 INFO L78 Accepts]: Start accepts. Automaton has 11564 states and 18086 transitions. Word has length 72 [2021-01-06 19:36:46,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:46,328 INFO L481 AbstractCegarLoop]: Abstraction has 11564 states and 18086 transitions. [2021-01-06 19:36:46,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:36:46,329 INFO L276 IsEmpty]: Start isEmpty. Operand 11564 states and 18086 transitions. [2021-01-06 19:36:46,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 19:36:46,330 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:46,330 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, 1, 1] [2021-01-06 19:36:46,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:36:46,330 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:46,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:46,331 INFO L82 PathProgramCache]: Analyzing trace with hash -856706640, now seen corresponding path program 1 times [2021-01-06 19:36:46,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:46,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105832864] [2021-01-06 19:36:46,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:46,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105832864] [2021-01-06 19:36:46,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:46,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:36:46,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339773328] [2021-01-06 19:36:46,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:36:46,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:46,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:36:46,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:36:46,493 INFO L87 Difference]: Start difference. First operand 11564 states and 18086 transitions. Second operand 4 states. [2021-01-06 19:36:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:47,474 INFO L93 Difference]: Finished difference Result 34382 states and 53735 transitions. [2021-01-06 19:36:47,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:36:47,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 19:36:47,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:47,531 INFO L225 Difference]: With dead ends: 34382 [2021-01-06 19:36:47,531 INFO L226 Difference]: Without dead ends: 22827 [2021-01-06 19:36:47,546 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:36:47,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22827 states. [2021-01-06 19:36:48,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22827 to 22825. [2021-01-06 19:36:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22825 states. [2021-01-06 19:36:48,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22825 states to 22825 states and 35458 transitions. [2021-01-06 19:36:48,863 INFO L78 Accepts]: Start accepts. Automaton has 22825 states and 35458 transitions. Word has length 74 [2021-01-06 19:36:48,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:48,863 INFO L481 AbstractCegarLoop]: Abstraction has 22825 states and 35458 transitions. [2021-01-06 19:36:48,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:36:48,864 INFO L276 IsEmpty]: Start isEmpty. Operand 22825 states and 35458 transitions. [2021-01-06 19:36:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 19:36:48,866 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:48,867 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, 1, 1, 1] [2021-01-06 19:36:48,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:36:48,867 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:48,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:48,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1857988380, now seen corresponding path program 1 times [2021-01-06 19:36:48,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:48,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513785814] [2021-01-06 19:36:48,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:48,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513785814] [2021-01-06 19:36:48,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:48,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:36:48,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543830005] [2021-01-06 19:36:48,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:36:48,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:48,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:36:48,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:48,915 INFO L87 Difference]: Start difference. First operand 22825 states and 35458 transitions. Second operand 3 states. [2021-01-06 19:36:50,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:50,394 INFO L93 Difference]: Finished difference Result 68437 states and 106312 transitions. [2021-01-06 19:36:50,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:36:50,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2021-01-06 19:36:50,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:50,564 INFO L225 Difference]: With dead ends: 68437 [2021-01-06 19:36:50,564 INFO L226 Difference]: Without dead ends: 45640 [2021-01-06 19:36:50,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:50,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45640 states. [2021-01-06 19:36:52,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45640 to 22827. [2021-01-06 19:36:52,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22827 states. [2021-01-06 19:36:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22827 states to 22827 states and 35460 transitions. [2021-01-06 19:36:52,209 INFO L78 Accepts]: Start accepts. Automaton has 22827 states and 35460 transitions. Word has length 75 [2021-01-06 19:36:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:52,209 INFO L481 AbstractCegarLoop]: Abstraction has 22827 states and 35460 transitions. [2021-01-06 19:36:52,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:36:52,209 INFO L276 IsEmpty]: Start isEmpty. Operand 22827 states and 35460 transitions. [2021-01-06 19:36:52,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:36:52,211 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:52,211 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, 1, 1, 1, 1] [2021-01-06 19:36:52,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:36:52,211 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:52,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:52,212 INFO L82 PathProgramCache]: Analyzing trace with hash 424514133, now seen corresponding path program 1 times [2021-01-06 19:36:52,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:52,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071794180] [2021-01-06 19:36:52,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:52,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:52,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071794180] [2021-01-06 19:36:52,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:52,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:36:52,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840140810] [2021-01-06 19:36:52,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:36:52,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:52,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:36:52,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:36:52,346 INFO L87 Difference]: Start difference. First operand 22827 states and 35460 transitions. Second operand 4 states. [2021-01-06 19:36:53,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:53,714 INFO L93 Difference]: Finished difference Result 67865 states and 105346 transitions. [2021-01-06 19:36:53,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:36:53,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2021-01-06 19:36:53,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:53,816 INFO L225 Difference]: With dead ends: 67865 [2021-01-06 19:36:53,816 INFO L226 Difference]: Without dead ends: 45050 [2021-01-06 19:36:53,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:36:53,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45050 states. [2021-01-06 19:36:55,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45050 to 45048. [2021-01-06 19:36:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45048 states. [2021-01-06 19:36:55,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45048 states to 45048 states and 69493 transitions. [2021-01-06 19:36:55,936 INFO L78 Accepts]: Start accepts. Automaton has 45048 states and 69493 transitions. Word has length 76 [2021-01-06 19:36:55,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:55,936 INFO L481 AbstractCegarLoop]: Abstraction has 45048 states and 69493 transitions. [2021-01-06 19:36:55,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:36:55,937 INFO L276 IsEmpty]: Start isEmpty. Operand 45048 states and 69493 transitions. [2021-01-06 19:36:55,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:36:55,943 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:55,943 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, 1, 1, 1, 1] [2021-01-06 19:36:55,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:36:55,943 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:55,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:55,944 INFO L82 PathProgramCache]: Analyzing trace with hash 551656516, now seen corresponding path program 1 times [2021-01-06 19:36:55,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:55,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111845524] [2021-01-06 19:36:55,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:56,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:56,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111845524] [2021-01-06 19:36:56,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:56,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:36:56,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314386820] [2021-01-06 19:36:56,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:36:56,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:56,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:36:56,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:36:56,066 INFO L87 Difference]: Start difference. First operand 45048 states and 69493 transitions. Second operand 4 states. [2021-01-06 19:36:59,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:59,547 INFO L93 Difference]: Finished difference Result 133396 states and 205667 transitions. [2021-01-06 19:36:59,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:36:59,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2021-01-06 19:36:59,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:59,750 INFO L225 Difference]: With dead ends: 133396 [2021-01-06 19:36:59,750 INFO L226 Difference]: Without dead ends: 88394 [2021-01-06 19:36:59,861 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:36:59,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88394 states. [2021-01-06 19:37:03,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88394 to 88392. [2021-01-06 19:37:03,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88392 states. [2021-01-06 19:37:03,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88392 states to 88392 states and 135223 transitions. [2021-01-06 19:37:03,822 INFO L78 Accepts]: Start accepts. Automaton has 88392 states and 135223 transitions. Word has length 76 [2021-01-06 19:37:03,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:03,823 INFO L481 AbstractCegarLoop]: Abstraction has 88392 states and 135223 transitions. [2021-01-06 19:37:03,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:37:03,823 INFO L276 IsEmpty]: Start isEmpty. Operand 88392 states and 135223 transitions. [2021-01-06 19:37:03,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 19:37:03,825 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:03,825 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, 1, 1, 1, 1, 1] [2021-01-06 19:37:03,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:37:03,826 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:03,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:03,826 INFO L82 PathProgramCache]: Analyzing trace with hash -656359944, now seen corresponding path program 1 times [2021-01-06 19:37:03,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:03,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570457275] [2021-01-06 19:37:03,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:03,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:03,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570457275] [2021-01-06 19:37:03,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:03,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:37:03,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905548301] [2021-01-06 19:37:03,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:37:03,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:03,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:37:03,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:03,862 INFO L87 Difference]: Start difference. First operand 88392 states and 135223 transitions. Second operand 3 states. [2021-01-06 19:37:10,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:10,047 INFO L93 Difference]: Finished difference Result 265052 states and 405477 transitions. [2021-01-06 19:37:10,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:37:10,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2021-01-06 19:37:10,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:10,433 INFO L225 Difference]: With dead ends: 265052 [2021-01-06 19:37:10,433 INFO L226 Difference]: Without dead ends: 176734 [2021-01-06 19:37:10,547 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:10,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176734 states. [2021-01-06 19:37:15,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176734 to 88400. [2021-01-06 19:37:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88400 states. [2021-01-06 19:37:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88400 states to 88400 states and 135231 transitions. [2021-01-06 19:37:15,629 INFO L78 Accepts]: Start accepts. Automaton has 88400 states and 135231 transitions. Word has length 77 [2021-01-06 19:37:15,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:15,629 INFO L481 AbstractCegarLoop]: Abstraction has 88400 states and 135231 transitions. [2021-01-06 19:37:15,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:37:15,629 INFO L276 IsEmpty]: Start isEmpty. Operand 88400 states and 135231 transitions. [2021-01-06 19:37:15,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:37:15,631 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:15,631 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, 1, 1, 1, 1, 1, 1] [2021-01-06 19:37:15,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:37:15,631 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:15,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:15,632 INFO L82 PathProgramCache]: Analyzing trace with hash 834408617, now seen corresponding path program 1 times [2021-01-06 19:37:15,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:15,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242170371] [2021-01-06 19:37:15,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:15,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242170371] [2021-01-06 19:37:15,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:15,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:37:15,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051510288] [2021-01-06 19:37:15,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:37:15,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:15,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:37:15,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:37:15,727 INFO L87 Difference]: Start difference. First operand 88400 states and 135231 transitions. Second operand 4 states. [2021-01-06 19:37:22,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:22,622 INFO L93 Difference]: Finished difference Result 261588 states and 399834 transitions. [2021-01-06 19:37:22,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:37:22,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2021-01-06 19:37:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:23,204 INFO L225 Difference]: With dead ends: 261588 [2021-01-06 19:37:23,205 INFO L226 Difference]: Without dead ends: 173243 [2021-01-06 19:37:23,284 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:37:23,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173243 states. [2021-01-06 19:37:30,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173243 to 173241. [2021-01-06 19:37:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173241 states. [2021-01-06 19:37:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173241 states to 173241 states and 262485 transitions. [2021-01-06 19:37:30,980 INFO L78 Accepts]: Start accepts. Automaton has 173241 states and 262485 transitions. Word has length 78 [2021-01-06 19:37:30,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:30,980 INFO L481 AbstractCegarLoop]: Abstraction has 173241 states and 262485 transitions. [2021-01-06 19:37:30,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:37:30,980 INFO L276 IsEmpty]: Start isEmpty. Operand 173241 states and 262485 transitions. [2021-01-06 19:37:30,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:37:30,984 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:30,984 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, 1, 1, 1, 1, 1, 1] [2021-01-06 19:37:30,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:37:30,984 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:30,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:30,985 INFO L82 PathProgramCache]: Analyzing trace with hash 640680152, now seen corresponding path program 1 times [2021-01-06 19:37:30,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:30,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647082333] [2021-01-06 19:37:30,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:31,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:31,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647082333] [2021-01-06 19:37:31,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:31,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:37:31,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642802502] [2021-01-06 19:37:31,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:37:31,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:31,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:37:31,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:37:31,078 INFO L87 Difference]: Start difference. First operand 173241 states and 262485 transitions. Second operand 4 states. [2021-01-06 19:37:45,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:45,717 INFO L93 Difference]: Finished difference Result 512789 states and 776319 transitions. [2021-01-06 19:37:45,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:37:45,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2021-01-06 19:37:45,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:46,487 INFO L225 Difference]: With dead ends: 512789 [2021-01-06 19:37:46,487 INFO L226 Difference]: Without dead ends: 339707 [2021-01-06 19:37:46,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:37:46,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339707 states. [2021-01-06 19:38:03,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339707 to 339705. [2021-01-06 19:38:03,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339705 states. [2021-01-06 19:38:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339705 states to 339705 states and 510005 transitions. [2021-01-06 19:38:04,726 INFO L78 Accepts]: Start accepts. Automaton has 339705 states and 510005 transitions. Word has length 78 [2021-01-06 19:38:04,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:38:04,726 INFO L481 AbstractCegarLoop]: Abstraction has 339705 states and 510005 transitions. [2021-01-06 19:38:04,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:38:04,726 INFO L276 IsEmpty]: Start isEmpty. Operand 339705 states and 510005 transitions. [2021-01-06 19:38:04,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-06 19:38:04,750 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:38:04,750 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, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:38:04,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:38:04,753 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:38:04,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:38:04,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1890599668, now seen corresponding path program 1 times [2021-01-06 19:38:04,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:38:04,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872670332] [2021-01-06 19:38:04,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:38:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:38:04,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:38:04,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872670332] [2021-01-06 19:38:04,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:38:04,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:38:04,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583198430] [2021-01-06 19:38:04,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:38:04,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:38:04,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:38:04,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:38:04,833 INFO L87 Difference]: Start difference. First operand 339705 states and 510005 transitions. Second operand 3 states. [2021-01-06 19:38:34,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:38:34,179 INFO L93 Difference]: Finished difference Result 1017821 states and 1528423 transitions. [2021-01-06 19:38:34,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:38:34,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2021-01-06 19:38:34,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:38:36,163 INFO L225 Difference]: With dead ends: 1017821 [2021-01-06 19:38:36,163 INFO L226 Difference]: Without dead ends: 679179 [2021-01-06 19:38:36,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:38:37,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679179 states.