/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_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:57:39,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:57:39,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:57:39,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:57:39,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:57:39,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:57:39,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:57:39,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:57:39,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:57:39,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:57:39,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:57:39,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:57:39,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:57:39,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:57:39,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:57:39,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:57:39,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:57:39,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:57:39,997 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:57:39,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:57:40,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:57:40,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:57:40,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:57:40,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:57:40,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:57:40,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:57:40,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:57:40,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:57:40,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:57:40,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:57:40,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:57:40,036 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:57:40,037 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:57:40,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:57:40,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:57:40,039 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:57:40,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:57:40,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:57:40,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:57:40,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:57:40,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:57:40,044 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:57:40,070 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:57:40,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:57:40,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:57:40,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:57:40,073 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:57:40,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:57:40,073 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:57:40,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:57:40,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:57:40,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:57:40,074 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:57:40,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:57:40,075 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:57:40,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:57:40,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:57:40,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:57:40,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:57:40,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:57:40,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:57:40,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:57:40,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:57:40,077 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:57:40,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:57:40,078 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:57:40,078 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:57:40,079 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:57:40,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:57:40,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:57:40,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:57:40,573 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:57:40,574 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:57:40,575 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c [2021-01-06 19:57:40,669 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1d02ddddd/5f970f81bd5b442284e8eaea6717c988/FLAGad50dfb2b [2021-01-06 19:57:41,379 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:57:41,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c [2021-01-06 19:57:41,392 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1d02ddddd/5f970f81bd5b442284e8eaea6717c988/FLAGad50dfb2b [2021-01-06 19:57:41,702 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/1d02ddddd/5f970f81bd5b442284e8eaea6717c988 [2021-01-06 19:57:41,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:57:41,710 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:57:41,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:57:41,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:57:41,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:57:41,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:57:41" (1/1) ... [2021-01-06 19:57:41,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25db8a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:57:41, skipping insertion in model container [2021-01-06 19:57:41,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:57:41" (1/1) ... [2021-01-06 19:57:41,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:57:41,768 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] 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[~newmax~0,] 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[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~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[~newmax~1,] 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[~newmax~1,] 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[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~newmax2~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[~newmax~2,] 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[~newmax~2,] 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[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~newmax3~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___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[~newmax1~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[~newmax2~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[~newmax3~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:57:42,055 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_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c[14467,14480] [2021-01-06 19:57:42,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:57:42,081 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] 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[~newmax~0,] 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[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~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[~newmax~1,] 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[~newmax~1,] 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[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~newmax2~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[~newmax~2,] 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[~newmax~2,] 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[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~newmax3~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___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[~newmax1~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[~newmax2~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[~newmax3~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:57:42,251 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_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c[14467,14480] [2021-01-06 19:57:42,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:57:42,295 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:57:42,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:57:42 WrapperNode [2021-01-06 19:57:42,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:57:42,298 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:57:42,298 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:57:42,298 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:57:42,308 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:57:42" (1/1) ... [2021-01-06 19:57:42,345 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:57:42" (1/1) ... [2021-01-06 19:57:42,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:57:42,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:57:42,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:57:42,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:57:42,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:57:42" (1/1) ... [2021-01-06 19:57:42,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:57:42" (1/1) ... [2021-01-06 19:57:42,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:57:42" (1/1) ... [2021-01-06 19:57:42,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:57:42" (1/1) ... [2021-01-06 19:57:42,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:57:42" (1/1) ... [2021-01-06 19:57:42,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:57:42" (1/1) ... [2021-01-06 19:57:42,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:57:42" (1/1) ... [2021-01-06 19:57:42,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:57:42,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:57:42,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:57:42,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:57:42,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:57:42" (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:57:42,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:57:42,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:57:42,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:57:42,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:57:43,621 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:57:43,621 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-01-06 19:57:43,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:57:43 BoogieIcfgContainer [2021-01-06 19:57:43,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:57:43,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:57:43,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:57:43,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:57:43,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:57:41" (1/3) ... [2021-01-06 19:57:43,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7481b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:57:43, skipping insertion in model container [2021-01-06 19:57:43,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:57:42" (2/3) ... [2021-01-06 19:57:43,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7481b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:57:43, skipping insertion in model container [2021-01-06 19:57:43,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:57:43" (3/3) ... [2021-01-06 19:57:43,634 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c [2021-01-06 19:57:43,641 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:57:43,647 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:57:43,666 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:57:43,696 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:57:43,697 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:57:43,697 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:57:43,697 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:57:43,697 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:57:43,697 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:57:43,697 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:57:43,698 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:57:43,717 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2021-01-06 19:57:43,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:57:43,727 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:43,728 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:57:43,729 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:43,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:43,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1418405445, now seen corresponding path program 1 times [2021-01-06 19:57:43,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:43,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027064076] [2021-01-06 19:57:43,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:44,031 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:57:44,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027064076] [2021-01-06 19:57:44,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:44,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:57:44,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087921783] [2021-01-06 19:57:44,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 19:57:44,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:44,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 19:57:44,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:57:44,067 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 2 states. [2021-01-06 19:57:44,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:44,102 INFO L93 Difference]: Finished difference Result 221 states and 383 transitions. [2021-01-06 19:57:44,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 19:57:44,103 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2021-01-06 19:57:44,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:44,117 INFO L225 Difference]: With dead ends: 221 [2021-01-06 19:57:44,118 INFO L226 Difference]: Without dead ends: 138 [2021-01-06 19:57:44,121 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:57:44,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-01-06 19:57:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2021-01-06 19:57:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2021-01-06 19:57:44,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 240 transitions. [2021-01-06 19:57:44,175 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 240 transitions. Word has length 37 [2021-01-06 19:57:44,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:44,176 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 240 transitions. [2021-01-06 19:57:44,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 19:57:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 240 transitions. [2021-01-06 19:57:44,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:57:44,178 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:44,179 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:57:44,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:57:44,179 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:44,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:44,180 INFO L82 PathProgramCache]: Analyzing trace with hash 2058913401, now seen corresponding path program 1 times [2021-01-06 19:57:44,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:44,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129409540] [2021-01-06 19:57:44,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:44,371 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:57:44,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129409540] [2021-01-06 19:57:44,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:44,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:57:44,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510054679] [2021-01-06 19:57:44,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:57:44,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:44,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:57:44,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:57:44,377 INFO L87 Difference]: Start difference. First operand 138 states and 240 transitions. Second operand 5 states. [2021-01-06 19:57:44,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:44,565 INFO L93 Difference]: Finished difference Result 220 states and 376 transitions. [2021-01-06 19:57:44,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:57:44,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2021-01-06 19:57:44,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:44,568 INFO L225 Difference]: With dead ends: 220 [2021-01-06 19:57:44,568 INFO L226 Difference]: Without dead ends: 138 [2021-01-06 19:57:44,570 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:57:44,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-01-06 19:57:44,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2021-01-06 19:57:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2021-01-06 19:57:44,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 210 transitions. [2021-01-06 19:57:44,584 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 210 transitions. Word has length 37 [2021-01-06 19:57:44,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:44,584 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 210 transitions. [2021-01-06 19:57:44,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:57:44,585 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 210 transitions. [2021-01-06 19:57:44,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 19:57:44,587 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:44,587 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] [2021-01-06 19:57:44,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:57:44,588 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:44,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:44,589 INFO L82 PathProgramCache]: Analyzing trace with hash -415118785, now seen corresponding path program 1 times [2021-01-06 19:57:44,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:44,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517259989] [2021-01-06 19:57:44,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:44,809 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:57:44,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517259989] [2021-01-06 19:57:44,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:44,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:57:44,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467266959] [2021-01-06 19:57:44,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:57:44,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:44,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:57:44,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:57:44,820 INFO L87 Difference]: Start difference. First operand 138 states and 210 transitions. Second operand 3 states. [2021-01-06 19:57:44,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:44,889 INFO L93 Difference]: Finished difference Result 284 states and 456 transitions. [2021-01-06 19:57:44,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:57:44,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2021-01-06 19:57:44,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:44,893 INFO L225 Difference]: With dead ends: 284 [2021-01-06 19:57:44,893 INFO L226 Difference]: Without dead ends: 206 [2021-01-06 19:57:44,894 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:57:44,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-01-06 19:57:44,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2021-01-06 19:57:44,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2021-01-06 19:57:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 318 transitions. [2021-01-06 19:57:44,912 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 318 transitions. Word has length 66 [2021-01-06 19:57:44,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:44,913 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 318 transitions. [2021-01-06 19:57:44,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:57:44,913 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 318 transitions. [2021-01-06 19:57:44,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 19:57:44,916 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:44,917 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] [2021-01-06 19:57:44,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:57:44,917 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:44,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:44,918 INFO L82 PathProgramCache]: Analyzing trace with hash 928134868, now seen corresponding path program 1 times [2021-01-06 19:57:44,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:44,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768602082] [2021-01-06 19:57:44,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:45,027 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:57:45,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768602082] [2021-01-06 19:57:45,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:45,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:57:45,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796844171] [2021-01-06 19:57:45,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:57:45,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:45,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:57:45,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:57:45,031 INFO L87 Difference]: Start difference. First operand 204 states and 318 transitions. Second operand 3 states. [2021-01-06 19:57:45,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:45,075 INFO L93 Difference]: Finished difference Result 476 states and 770 transitions. [2021-01-06 19:57:45,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:57:45,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2021-01-06 19:57:45,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:45,079 INFO L225 Difference]: With dead ends: 476 [2021-01-06 19:57:45,079 INFO L226 Difference]: Without dead ends: 332 [2021-01-06 19:57:45,081 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:57:45,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-01-06 19:57:45,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2021-01-06 19:57:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2021-01-06 19:57:45,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 527 transitions. [2021-01-06 19:57:45,110 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 527 transitions. Word has length 68 [2021-01-06 19:57:45,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:45,110 INFO L481 AbstractCegarLoop]: Abstraction has 330 states and 527 transitions. [2021-01-06 19:57:45,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:57:45,111 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 527 transitions. [2021-01-06 19:57:45,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 19:57:45,114 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:45,115 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:57:45,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:57:45,115 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:45,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:45,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1295175881, now seen corresponding path program 1 times [2021-01-06 19:57:45,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:45,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891452395] [2021-01-06 19:57:45,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:57:45,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891452395] [2021-01-06 19:57:45,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:45,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:57:45,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606343593] [2021-01-06 19:57:45,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:57:45,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:45,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:57:45,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:57:45,303 INFO L87 Difference]: Start difference. First operand 330 states and 527 transitions. Second operand 3 states. [2021-01-06 19:57:45,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:45,384 INFO L93 Difference]: Finished difference Result 838 states and 1369 transitions. [2021-01-06 19:57:45,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:57:45,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2021-01-06 19:57:45,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:45,393 INFO L225 Difference]: With dead ends: 838 [2021-01-06 19:57:45,393 INFO L226 Difference]: Without dead ends: 568 [2021-01-06 19:57:45,396 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:57:45,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-01-06 19:57:45,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 566. [2021-01-06 19:57:45,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2021-01-06 19:57:45,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 915 transitions. [2021-01-06 19:57:45,463 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 915 transitions. Word has length 70 [2021-01-06 19:57:45,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:45,463 INFO L481 AbstractCegarLoop]: Abstraction has 566 states and 915 transitions. [2021-01-06 19:57:45,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:57:45,464 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 915 transitions. [2021-01-06 19:57:45,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:57:45,467 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:45,467 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:57:45,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:57:45,468 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:45,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:45,468 INFO L82 PathProgramCache]: Analyzing trace with hash -367652834, now seen corresponding path program 1 times [2021-01-06 19:57:45,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:45,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042437193] [2021-01-06 19:57:45,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:45,624 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:57:45,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042437193] [2021-01-06 19:57:45,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:45,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:57:45,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005028754] [2021-01-06 19:57:45,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:57:45,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:45,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:57:45,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:57:45,630 INFO L87 Difference]: Start difference. First operand 566 states and 915 transitions. Second operand 5 states. [2021-01-06 19:57:45,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:45,870 INFO L93 Difference]: Finished difference Result 2144 states and 3560 transitions. [2021-01-06 19:57:45,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:57:45,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2021-01-06 19:57:45,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:45,886 INFO L225 Difference]: With dead ends: 2144 [2021-01-06 19:57:45,886 INFO L226 Difference]: Without dead ends: 1638 [2021-01-06 19:57:45,888 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:57:45,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2021-01-06 19:57:45,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1008. [2021-01-06 19:57:45,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1008 states. [2021-01-06 19:57:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1646 transitions. [2021-01-06 19:57:45,941 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1646 transitions. Word has length 72 [2021-01-06 19:57:45,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:45,942 INFO L481 AbstractCegarLoop]: Abstraction has 1008 states and 1646 transitions. [2021-01-06 19:57:45,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:57:45,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1646 transitions. [2021-01-06 19:57:45,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 19:57:45,946 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:45,946 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] [2021-01-06 19:57:45,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:57:45,947 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:45,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:45,948 INFO L82 PathProgramCache]: Analyzing trace with hash -435168554, now seen corresponding path program 1 times [2021-01-06 19:57:45,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:45,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716567781] [2021-01-06 19:57:45,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:46,030 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:57:46,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716567781] [2021-01-06 19:57:46,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:46,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:57:46,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813092820] [2021-01-06 19:57:46,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:57:46,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:46,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:57:46,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:57:46,035 INFO L87 Difference]: Start difference. First operand 1008 states and 1646 transitions. Second operand 4 states. [2021-01-06 19:57:46,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:46,206 INFO L93 Difference]: Finished difference Result 2928 states and 4854 transitions. [2021-01-06 19:57:46,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:57:46,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2021-01-06 19:57:46,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:46,222 INFO L225 Difference]: With dead ends: 2928 [2021-01-06 19:57:46,222 INFO L226 Difference]: Without dead ends: 1980 [2021-01-06 19:57:46,226 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:57:46,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2021-01-06 19:57:46,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1485. [2021-01-06 19:57:46,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2021-01-06 19:57:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 2437 transitions. [2021-01-06 19:57:46,300 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 2437 transitions. Word has length 73 [2021-01-06 19:57:46,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:46,300 INFO L481 AbstractCegarLoop]: Abstraction has 1485 states and 2437 transitions. [2021-01-06 19:57:46,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:57:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 2437 transitions. [2021-01-06 19:57:46,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 19:57:46,304 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:46,305 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:57:46,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:57:46,305 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:46,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:46,306 INFO L82 PathProgramCache]: Analyzing trace with hash 152415701, now seen corresponding path program 1 times [2021-01-06 19:57:46,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:46,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946993686] [2021-01-06 19:57:46,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:46,401 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:57:46,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946993686] [2021-01-06 19:57:46,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:46,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:57:46,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948360454] [2021-01-06 19:57:46,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:57:46,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:46,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:57:46,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:57:46,404 INFO L87 Difference]: Start difference. First operand 1485 states and 2437 transitions. Second operand 3 states. [2021-01-06 19:57:46,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:46,481 INFO L93 Difference]: Finished difference Result 2927 states and 4822 transitions. [2021-01-06 19:57:46,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:57:46,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 19:57:46,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:46,494 INFO L225 Difference]: With dead ends: 2927 [2021-01-06 19:57:46,494 INFO L226 Difference]: Without dead ends: 2113 [2021-01-06 19:57:46,496 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:57:46,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2021-01-06 19:57:46,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 2111. [2021-01-06 19:57:46,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111 states. [2021-01-06 19:57:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3450 transitions. [2021-01-06 19:57:46,595 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3450 transitions. Word has length 74 [2021-01-06 19:57:46,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:46,596 INFO L481 AbstractCegarLoop]: Abstraction has 2111 states and 3450 transitions. [2021-01-06 19:57:46,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:57:46,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3450 transitions. [2021-01-06 19:57:46,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 19:57:46,597 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:46,598 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:57:46,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:57:46,598 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:46,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:46,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1935815765, now seen corresponding path program 1 times [2021-01-06 19:57:46,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:46,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577565281] [2021-01-06 19:57:46,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:46,699 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:57:46,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577565281] [2021-01-06 19:57:46,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:46,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:57:46,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774031430] [2021-01-06 19:57:46,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:57:46,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:46,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:57:46,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:57:46,702 INFO L87 Difference]: Start difference. First operand 2111 states and 3450 transitions. Second operand 4 states. [2021-01-06 19:57:46,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:46,923 INFO L93 Difference]: Finished difference Result 6540 states and 10757 transitions. [2021-01-06 19:57:46,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:57:46,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 19:57:46,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:46,950 INFO L225 Difference]: With dead ends: 6540 [2021-01-06 19:57:46,950 INFO L226 Difference]: Without dead ends: 4519 [2021-01-06 19:57:46,958 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:57:46,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2021-01-06 19:57:47,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 3303. [2021-01-06 19:57:47,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3303 states. [2021-01-06 19:57:47,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 3303 states and 5388 transitions. [2021-01-06 19:57:47,164 INFO L78 Accepts]: Start accepts. Automaton has 3303 states and 5388 transitions. Word has length 74 [2021-01-06 19:57:47,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:47,168 INFO L481 AbstractCegarLoop]: Abstraction has 3303 states and 5388 transitions. [2021-01-06 19:57:47,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:57:47,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 5388 transitions. [2021-01-06 19:57:47,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 19:57:47,170 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:47,170 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:57:47,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:57:47,170 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:47,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:47,171 INFO L82 PathProgramCache]: Analyzing trace with hash -2130170379, now seen corresponding path program 1 times [2021-01-06 19:57:47,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:47,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128932384] [2021-01-06 19:57:47,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:47,232 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:57:47,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128932384] [2021-01-06 19:57:47,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:47,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:57:47,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436324903] [2021-01-06 19:57:47,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:57:47,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:47,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:57:47,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:57:47,235 INFO L87 Difference]: Start difference. First operand 3303 states and 5388 transitions. Second operand 3 states. [2021-01-06 19:57:47,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:47,404 INFO L93 Difference]: Finished difference Result 6575 states and 10748 transitions. [2021-01-06 19:57:47,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:57:47,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 19:57:47,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:47,434 INFO L225 Difference]: With dead ends: 6575 [2021-01-06 19:57:47,435 INFO L226 Difference]: Without dead ends: 4693 [2021-01-06 19:57:47,440 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:57:47,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4693 states. [2021-01-06 19:57:47,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4693 to 4691. [2021-01-06 19:57:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4691 states. [2021-01-06 19:57:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4691 states to 4691 states and 7606 transitions. [2021-01-06 19:57:47,767 INFO L78 Accepts]: Start accepts. Automaton has 4691 states and 7606 transitions. Word has length 74 [2021-01-06 19:57:47,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:47,767 INFO L481 AbstractCegarLoop]: Abstraction has 4691 states and 7606 transitions. [2021-01-06 19:57:47,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:57:47,767 INFO L276 IsEmpty]: Start isEmpty. Operand 4691 states and 7606 transitions. [2021-01-06 19:57:47,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 19:57:47,769 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:47,769 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:57:47,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:57:47,770 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:47,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:47,770 INFO L82 PathProgramCache]: Analyzing trace with hash 339461557, now seen corresponding path program 1 times [2021-01-06 19:57:47,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:47,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597027217] [2021-01-06 19:57:47,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:47,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:57:47,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597027217] [2021-01-06 19:57:47,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:47,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:57:47,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309030172] [2021-01-06 19:57:47,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:57:47,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:47,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:57:47,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:57:47,845 INFO L87 Difference]: Start difference. First operand 4691 states and 7606 transitions. Second operand 3 states. [2021-01-06 19:57:48,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:48,107 INFO L93 Difference]: Finished difference Result 10288 states and 16845 transitions. [2021-01-06 19:57:48,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:57:48,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 19:57:48,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:48,175 INFO L225 Difference]: With dead ends: 10288 [2021-01-06 19:57:48,175 INFO L226 Difference]: Without dead ends: 6938 [2021-01-06 19:57:48,183 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:57:48,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6938 states. [2021-01-06 19:57:48,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6938 to 6936. [2021-01-06 19:57:48,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6936 states. [2021-01-06 19:57:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6936 states to 6936 states and 11234 transitions. [2021-01-06 19:57:48,556 INFO L78 Accepts]: Start accepts. Automaton has 6936 states and 11234 transitions. Word has length 74 [2021-01-06 19:57:48,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:48,557 INFO L481 AbstractCegarLoop]: Abstraction has 6936 states and 11234 transitions. [2021-01-06 19:57:48,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:57:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 6936 states and 11234 transitions. [2021-01-06 19:57:48,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 19:57:48,558 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:48,558 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:57:48,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:57:48,558 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:48,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:48,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1704077331, now seen corresponding path program 1 times [2021-01-06 19:57:48,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:48,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775420928] [2021-01-06 19:57:48,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:48,651 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:57:48,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775420928] [2021-01-06 19:57:48,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:48,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:57:48,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969127968] [2021-01-06 19:57:48,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:57:48,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:48,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:57:48,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:57:48,654 INFO L87 Difference]: Start difference. First operand 6936 states and 11234 transitions. Second operand 4 states. [2021-01-06 19:57:49,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:49,242 INFO L93 Difference]: Finished difference Result 21738 states and 35298 transitions. [2021-01-06 19:57:49,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:57:49,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-06 19:57:49,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:49,285 INFO L225 Difference]: With dead ends: 21738 [2021-01-06 19:57:49,285 INFO L226 Difference]: Without dead ends: 14888 [2021-01-06 19:57:49,299 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:57:49,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14888 states. [2021-01-06 19:57:49,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14888 to 10869. [2021-01-06 19:57:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10869 states. [2021-01-06 19:57:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10869 states to 10869 states and 17501 transitions. [2021-01-06 19:57:49,957 INFO L78 Accepts]: Start accepts. Automaton has 10869 states and 17501 transitions. Word has length 75 [2021-01-06 19:57:49,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:49,958 INFO L481 AbstractCegarLoop]: Abstraction has 10869 states and 17501 transitions. [2021-01-06 19:57:49,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:57:49,958 INFO L276 IsEmpty]: Start isEmpty. Operand 10869 states and 17501 transitions. [2021-01-06 19:57:49,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 19:57:49,959 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:49,959 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:57:49,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:57:49,960 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:49,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:49,960 INFO L82 PathProgramCache]: Analyzing trace with hash 931672261, now seen corresponding path program 1 times [2021-01-06 19:57:49,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:49,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398427690] [2021-01-06 19:57:49,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:50,181 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:57:50,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398427690] [2021-01-06 19:57:50,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:50,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:57:50,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260485315] [2021-01-06 19:57:50,182 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:57:50,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:50,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:57:50,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:57:50,184 INFO L87 Difference]: Start difference. First operand 10869 states and 17501 transitions. Second operand 4 states. [2021-01-06 19:57:51,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:51,182 INFO L93 Difference]: Finished difference Result 32102 states and 51631 transitions. [2021-01-06 19:57:51,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:57:51,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2021-01-06 19:57:51,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:51,246 INFO L225 Difference]: With dead ends: 32102 [2021-01-06 19:57:51,246 INFO L226 Difference]: Without dead ends: 21242 [2021-01-06 19:57:51,269 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:57:51,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21242 states. [2021-01-06 19:57:52,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21242 to 21240. [2021-01-06 19:57:52,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21240 states. [2021-01-06 19:57:52,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21240 states to 21240 states and 33918 transitions. [2021-01-06 19:57:52,313 INFO L78 Accepts]: Start accepts. Automaton has 21240 states and 33918 transitions. Word has length 77 [2021-01-06 19:57:52,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:52,314 INFO L481 AbstractCegarLoop]: Abstraction has 21240 states and 33918 transitions. [2021-01-06 19:57:52,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:57:52,314 INFO L276 IsEmpty]: Start isEmpty. Operand 21240 states and 33918 transitions. [2021-01-06 19:57:52,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:57:52,315 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:52,316 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:57:52,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:57:52,317 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:52,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:52,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1466579386, now seen corresponding path program 1 times [2021-01-06 19:57:52,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:52,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124547085] [2021-01-06 19:57:52,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:52,371 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:57:52,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124547085] [2021-01-06 19:57:52,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:52,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:57:52,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503782825] [2021-01-06 19:57:52,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:57:52,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:52,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:57:52,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:57:52,374 INFO L87 Difference]: Start difference. First operand 21240 states and 33918 transitions. Second operand 3 states. [2021-01-06 19:57:53,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:53,640 INFO L93 Difference]: Finished difference Result 51507 states and 82750 transitions. [2021-01-06 19:57:53,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:57:53,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2021-01-06 19:57:53,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:53,744 INFO L225 Difference]: With dead ends: 51507 [2021-01-06 19:57:53,745 INFO L226 Difference]: Without dead ends: 30396 [2021-01-06 19:57:53,783 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:57:53,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30396 states. [2021-01-06 19:57:55,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30396 to 29484. [2021-01-06 19:57:55,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29484 states. [2021-01-06 19:57:55,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29484 states to 29484 states and 46959 transitions. [2021-01-06 19:57:55,252 INFO L78 Accepts]: Start accepts. Automaton has 29484 states and 46959 transitions. Word has length 78 [2021-01-06 19:57:55,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:55,253 INFO L481 AbstractCegarLoop]: Abstraction has 29484 states and 46959 transitions. [2021-01-06 19:57:55,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:57:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 29484 states and 46959 transitions. [2021-01-06 19:57:55,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:57:55,254 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:55,254 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:57:55,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:57:55,255 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:55,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:55,256 INFO L82 PathProgramCache]: Analyzing trace with hash 295226641, now seen corresponding path program 1 times [2021-01-06 19:57:55,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:55,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007557342] [2021-01-06 19:57:55,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:55,294 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:57:55,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007557342] [2021-01-06 19:57:55,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:55,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:57:55,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699849783] [2021-01-06 19:57:55,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:57:55,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:55,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:57:55,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:57:55,296 INFO L87 Difference]: Start difference. First operand 29484 states and 46959 transitions. Second operand 3 states. [2021-01-06 19:57:57,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:57,447 INFO L93 Difference]: Finished difference Result 88414 states and 140815 transitions. [2021-01-06 19:57:57,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:57:57,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2021-01-06 19:57:57,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:57,625 INFO L225 Difference]: With dead ends: 88414 [2021-01-06 19:57:57,626 INFO L226 Difference]: Without dead ends: 58958 [2021-01-06 19:57:57,666 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:57:57,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58958 states. [2021-01-06 19:57:59,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58958 to 29486. [2021-01-06 19:57:59,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29486 states. [2021-01-06 19:57:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29486 states to 29486 states and 46961 transitions. [2021-01-06 19:57:59,301 INFO L78 Accepts]: Start accepts. Automaton has 29486 states and 46961 transitions. Word has length 78 [2021-01-06 19:57:59,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:59,301 INFO L481 AbstractCegarLoop]: Abstraction has 29486 states and 46961 transitions. [2021-01-06 19:57:59,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:57:59,302 INFO L276 IsEmpty]: Start isEmpty. Operand 29486 states and 46961 transitions. [2021-01-06 19:57:59,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-06 19:57:59,303 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:59,303 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:57:59,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:57:59,303 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:59,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:59,304 INFO L82 PathProgramCache]: Analyzing trace with hash -57061967, now seen corresponding path program 1 times [2021-01-06 19:57:59,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:59,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440527319] [2021-01-06 19:57:59,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:59,398 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:57:59,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440527319] [2021-01-06 19:57:59,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:59,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:57:59,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100044069] [2021-01-06 19:57:59,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:57:59,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:59,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:57:59,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:57:59,400 INFO L87 Difference]: Start difference. First operand 29486 states and 46961 transitions. Second operand 4 states. [2021-01-06 19:58:01,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:58:01,054 INFO L93 Difference]: Finished difference Result 87100 states and 138561 transitions. [2021-01-06 19:58:01,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:58:01,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2021-01-06 19:58:01,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:58:01,174 INFO L225 Difference]: With dead ends: 87100 [2021-01-06 19:58:01,174 INFO L226 Difference]: Without dead ends: 57644 [2021-01-06 19:58:01,207 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:58:01,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57644 states. [2021-01-06 19:58:03,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57644 to 57642. [2021-01-06 19:58:03,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57642 states. [2021-01-06 19:58:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57642 states to 57642 states and 91088 transitions. [2021-01-06 19:58:03,794 INFO L78 Accepts]: Start accepts. Automaton has 57642 states and 91088 transitions. Word has length 79 [2021-01-06 19:58:03,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:58:03,795 INFO L481 AbstractCegarLoop]: Abstraction has 57642 states and 91088 transitions. [2021-01-06 19:58:03,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:58:03,795 INFO L276 IsEmpty]: Start isEmpty. Operand 57642 states and 91088 transitions. [2021-01-06 19:58:03,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 19:58:03,796 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:58:03,796 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, 1] [2021-01-06 19:58:03,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:58:03,797 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:58:03,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:58:03,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1163177193, now seen corresponding path program 1 times [2021-01-06 19:58:03,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:58:03,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907905024] [2021-01-06 19:58:03,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:58:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:58:03,846 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:58:03,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907905024] [2021-01-06 19:58:03,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:58:03,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:58:03,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045590621] [2021-01-06 19:58:03,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:58:03,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:58:03,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:58:03,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:58:03,849 INFO L87 Difference]: Start difference. First operand 57642 states and 91088 transitions. Second operand 3 states. [2021-01-06 19:58:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:58:07,150 INFO L93 Difference]: Finished difference Result 139442 states and 221184 transitions. [2021-01-06 19:58:07,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:58:07,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2021-01-06 19:58:07,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:58:07,294 INFO L225 Difference]: With dead ends: 139442 [2021-01-06 19:58:07,294 INFO L226 Difference]: Without dead ends: 82080 [2021-01-06 19:58:07,339 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:58:07,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82080 states. [2021-01-06 19:58:10,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82080 to 79774. [2021-01-06 19:58:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79774 states. [2021-01-06 19:58:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79774 states to 79774 states and 125478 transitions. [2021-01-06 19:58:10,744 INFO L78 Accepts]: Start accepts. Automaton has 79774 states and 125478 transitions. Word has length 80 [2021-01-06 19:58:10,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:58:10,745 INFO L481 AbstractCegarLoop]: Abstraction has 79774 states and 125478 transitions. [2021-01-06 19:58:10,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:58:10,745 INFO L276 IsEmpty]: Start isEmpty. Operand 79774 states and 125478 transitions. [2021-01-06 19:58:10,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 19:58:10,746 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:58:10,746 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, 1] [2021-01-06 19:58:10,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:58:10,747 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:58:10,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:58:10,747 INFO L82 PathProgramCache]: Analyzing trace with hash -544448643, now seen corresponding path program 1 times [2021-01-06 19:58:10,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:58:10,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162130793] [2021-01-06 19:58:10,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:58:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:58:10,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:58:10,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162130793] [2021-01-06 19:58:10,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:58:10,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:58:10,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013761015] [2021-01-06 19:58:10,789 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:58:10,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:58:10,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:58:10,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:58:10,790 INFO L87 Difference]: Start difference. First operand 79774 states and 125478 transitions. Second operand 3 states. [2021-01-06 19:58:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:58:16,068 INFO L93 Difference]: Finished difference Result 239246 states and 376314 transitions. [2021-01-06 19:58:16,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:58:16,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2021-01-06 19:58:16,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:58:16,396 INFO L225 Difference]: With dead ends: 239246 [2021-01-06 19:58:16,397 INFO L226 Difference]: Without dead ends: 159516 [2021-01-06 19:58:16,457 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:58:16,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159516 states. [2021-01-06 19:58:20,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159516 to 79778. [2021-01-06 19:58:20,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79778 states. [2021-01-06 19:58:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79778 states to 79778 states and 125482 transitions. [2021-01-06 19:58:20,480 INFO L78 Accepts]: Start accepts. Automaton has 79778 states and 125482 transitions. Word has length 80 [2021-01-06 19:58:20,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:58:20,481 INFO L481 AbstractCegarLoop]: Abstraction has 79778 states and 125482 transitions. [2021-01-06 19:58:20,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:58:20,481 INFO L276 IsEmpty]: Start isEmpty. Operand 79778 states and 125482 transitions. [2021-01-06 19:58:20,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 19:58:20,482 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:58:20,482 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, 1, 1] [2021-01-06 19:58:20,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:58:20,483 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:58:20,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:58:20,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2051256477, now seen corresponding path program 1 times [2021-01-06 19:58:20,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:58:20,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210865662] [2021-01-06 19:58:20,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:58:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:58:20,574 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:58:20,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210865662] [2021-01-06 19:58:20,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:58:20,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:58:20,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518386774] [2021-01-06 19:58:20,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:58:20,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:58:20,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:58:20,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:58:20,577 INFO L87 Difference]: Start difference. First operand 79778 states and 125482 transitions. Second operand 4 states. [2021-01-06 19:58:25,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:58:25,880 INFO L93 Difference]: Finished difference Result 235586 states and 370042 transitions. [2021-01-06 19:58:25,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:58:25,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2021-01-06 19:58:25,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:58:26,192 INFO L225 Difference]: With dead ends: 235586 [2021-01-06 19:58:26,192 INFO L226 Difference]: Without dead ends: 155856 [2021-01-06 19:58:26,264 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:58:26,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155856 states. [2021-01-06 19:58:32,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155856 to 155854. [2021-01-06 19:58:32,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155854 states. [2021-01-06 19:58:32,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155854 states to 155854 states and 243064 transitions. [2021-01-06 19:58:32,850 INFO L78 Accepts]: Start accepts. Automaton has 155854 states and 243064 transitions. Word has length 81 [2021-01-06 19:58:32,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:58:32,851 INFO L481 AbstractCegarLoop]: Abstraction has 155854 states and 243064 transitions. [2021-01-06 19:58:32,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:58:32,851 INFO L276 IsEmpty]: Start isEmpty. Operand 155854 states and 243064 transitions. [2021-01-06 19:58:32,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 19:58:32,853 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:58:32,853 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, 1, 1, 1] [2021-01-06 19:58:32,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:58:32,853 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:58:32,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:58:32,854 INFO L82 PathProgramCache]: Analyzing trace with hash -2106822348, now seen corresponding path program 1 times [2021-01-06 19:58:32,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:58:32,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566812277] [2021-01-06 19:58:32,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:58:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:58:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:58:32,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566812277] [2021-01-06 19:58:32,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:58:32,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:58:32,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049446185] [2021-01-06 19:58:32,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:58:32,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:58:32,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:58:32,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:58:32,916 INFO L87 Difference]: Start difference. First operand 155854 states and 243064 transitions. Second operand 3 states. [2021-01-06 19:58:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:58:40,928 INFO L93 Difference]: Finished difference Result 377802 states and 592138 transitions. [2021-01-06 19:58:40,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:58:40,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2021-01-06 19:58:40,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:58:41,417 INFO L225 Difference]: With dead ends: 377802 [2021-01-06 19:58:41,417 INFO L226 Difference]: Without dead ends: 222512 [2021-01-06 19:58:41,548 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:58:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222512 states. [2021-01-06 19:58:50,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222512 to 215310. [2021-01-06 19:58:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215310 states. [2021-01-06 19:58:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215310 states to 215310 states and 333632 transitions. [2021-01-06 19:58:51,170 INFO L78 Accepts]: Start accepts. Automaton has 215310 states and 333632 transitions. Word has length 82 [2021-01-06 19:58:51,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:58:51,170 INFO L481 AbstractCegarLoop]: Abstraction has 215310 states and 333632 transitions. [2021-01-06 19:58:51,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:58:51,170 INFO L276 IsEmpty]: Start isEmpty. Operand 215310 states and 333632 transitions. [2021-01-06 19:58:51,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-01-06 19:58:51,172 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:58:51,172 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:51,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:58:51,172 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:58:51,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:58:51,173 INFO L82 PathProgramCache]: Analyzing trace with hash -565045271, now seen corresponding path program 1 times [2021-01-06 19:58:51,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:58:51,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145059937] [2021-01-06 19:58:51,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:58:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:58:51,208 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:58:51,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145059937] [2021-01-06 19:58:51,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:58:51,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:58:51,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194500504] [2021-01-06 19:58:51,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:58:51,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:58:51,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:58:51,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:58:51,210 INFO L87 Difference]: Start difference. First operand 215310 states and 333632 transitions. Second operand 3 states. [2021-01-06 19:59:06,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:59:06,410 INFO L93 Difference]: Finished difference Result 645506 states and 1000350 transitions. [2021-01-06 19:59:06,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:59:06,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2021-01-06 19:59:06,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:59:07,648 INFO L225 Difference]: With dead ends: 645506 [2021-01-06 19:59:07,649 INFO L226 Difference]: Without dead ends: 430528 [2021-01-06 19:59:07,865 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:59:08,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430528 states. [2021-01-06 19:59:19,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430528 to 215318. [2021-01-06 19:59:19,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215318 states. [2021-01-06 19:59:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215318 states to 215318 states and 333640 transitions. [2021-01-06 19:59:19,862 INFO L78 Accepts]: Start accepts. Automaton has 215318 states and 333640 transitions. Word has length 82 [2021-01-06 19:59:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:59:19,862 INFO L481 AbstractCegarLoop]: Abstraction has 215318 states and 333640 transitions. [2021-01-06 19:59:19,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:59:19,862 INFO L276 IsEmpty]: Start isEmpty. Operand 215318 states and 333640 transitions. [2021-01-06 19:59:19,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-06 19:59:19,864 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:59:19,865 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, 1, 1, 1, 1] [2021-01-06 19:59:19,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:59:19,865 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:59:19,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:59:19,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1283476260, now seen corresponding path program 1 times [2021-01-06 19:59:19,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:59:19,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392754660] [2021-01-06 19:59:19,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:59:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:59:20,018 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:59:20,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392754660] [2021-01-06 19:59:20,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:59:20,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:59:20,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182868897] [2021-01-06 19:59:20,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:59:20,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:59:20,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:59:20,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:59:20,023 INFO L87 Difference]: Start difference. First operand 215318 states and 333640 transitions. Second operand 5 states. [2021-01-06 19:59:37,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:59:37,719 INFO L93 Difference]: Finished difference Result 608320 states and 942049 transitions. [2021-01-06 19:59:37,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:59:37,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2021-01-06 19:59:37,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:59:38,658 INFO L225 Difference]: With dead ends: 608320 [2021-01-06 19:59:38,658 INFO L226 Difference]: Without dead ends: 393090 [2021-01-06 19:59:38,881 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:59:39,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393090 states. [2021-01-06 19:59:57,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393090 to 393088. [2021-01-06 19:59:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393088 states. [2021-01-06 19:59:58,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393088 states to 393088 states and 603553 transitions. [2021-01-06 19:59:58,532 INFO L78 Accepts]: Start accepts. Automaton has 393088 states and 603553 transitions. Word has length 83 [2021-01-06 19:59:58,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:59:58,535 INFO L481 AbstractCegarLoop]: Abstraction has 393088 states and 603553 transitions. [2021-01-06 19:59:58,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:59:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 393088 states and 603553 transitions. [2021-01-06 19:59:58,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-06 19:59:58,552 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:59:58,552 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, 1, 1, 1, 1] [2021-01-06 19:59:58,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:59:58,553 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:59:58,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:59:58,553 INFO L82 PathProgramCache]: Analyzing trace with hash -2141300343, now seen corresponding path program 1 times [2021-01-06 19:59:58,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:59:58,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974976860] [2021-01-06 19:59:58,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:59:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:59:58,681 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:59:58,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974976860] [2021-01-06 19:59:58,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:59:58,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:59:58,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136337659] [2021-01-06 19:59:58,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:59:58,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:59:58,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:59:58,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:59:58,684 INFO L87 Difference]: Start difference. First operand 393088 states and 603553 transitions. Second operand 4 states. [2021-01-06 20:00:13,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:00:13,701 INFO L93 Difference]: Finished difference Result 699170 states and 1071499 transitions. [2021-01-06 20:00:13,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:00:13,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2021-01-06 20:00:13,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:00:14,411 INFO L225 Difference]: With dead ends: 699170 [2021-01-06 20:00:14,412 INFO L226 Difference]: Without dead ends: 306156 [2021-01-06 20:00:14,687 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 20:00:14,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306156 states. [2021-01-06 20:00:28,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306156 to 306156. [2021-01-06 20:00:28,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306156 states. [2021-01-06 20:00:29,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306156 states to 306156 states and 468049 transitions. [2021-01-06 20:00:30,000 INFO L78 Accepts]: Start accepts. Automaton has 306156 states and 468049 transitions. Word has length 83 [2021-01-06 20:00:30,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 20:00:30,000 INFO L481 AbstractCegarLoop]: Abstraction has 306156 states and 468049 transitions. [2021-01-06 20:00:30,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 20:00:30,000 INFO L276 IsEmpty]: Start isEmpty. Operand 306156 states and 468049 transitions. [2021-01-06 20:00:30,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-01-06 20:00:30,019 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 20:00:30,019 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, 1, 1, 1, 1, 1] [2021-01-06 20:00:30,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 20:00:30,020 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 20:00:30,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 20:00:30,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1610663161, now seen corresponding path program 1 times [2021-01-06 20:00:30,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 20:00:30,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147168382] [2021-01-06 20:00:30,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 20:00:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 20:00:30,134 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 20:00:30,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147168382] [2021-01-06 20:00:30,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 20:00:30,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 20:00:30,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536069547] [2021-01-06 20:00:30,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 20:00:30,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 20:00:30,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 20:00:30,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 20:00:30,140 INFO L87 Difference]: Start difference. First operand 306156 states and 468049 transitions. Second operand 4 states. [2021-01-06 20:00:55,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 20:00:55,274 INFO L93 Difference]: Finished difference Result 804284 states and 1228518 transitions. [2021-01-06 20:00:55,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 20:00:55,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2021-01-06 20:00:55,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 20:00:56,517 INFO L225 Difference]: With dead ends: 804284 [2021-01-06 20:00:56,519 INFO L226 Difference]: Without dead ends: 498260 [2021-01-06 20:00:56,816 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 20:00:57,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498260 states.