/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.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:56:00,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:56:00,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:56:01,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:56:01,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:56:01,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:56:01,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:56:01,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:56:01,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:56:01,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:56:01,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:56:01,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:56:01,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:56:01,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:56:01,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:56:01,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:56:01,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:56:01,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:56:01,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:56:01,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:56:01,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:56:01,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:56:01,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:56:01,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:56:01,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:56:01,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:56:01,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:56:01,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:56:01,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:56:01,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:56:01,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:56:01,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:56:01,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:56:01,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:56:01,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:56:01,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:56:01,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:56:01,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:56:01,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:56:01,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:56:01,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:56:01,063 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:56:01,094 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:56:01,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:56:01,097 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:56:01,097 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:56:01,097 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:56:01,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:56:01,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:56:01,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:56:01,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:56:01,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:56:01,099 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:56:01,099 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:56:01,100 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:56:01,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:56:01,100 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:56:01,100 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:56:01,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:56:01,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:56:01,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:56:01,101 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:56:01,102 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:56:01,102 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:56:01,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:56:01,102 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:56:01,102 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:56:01,103 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:56:01,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:56:01,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:56:01,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:56:01,512 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:56:01,513 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:56:01,514 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.1.ufo.UNBOUNDED.pals.c [2021-01-06 19:56:01,609 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b66772afc/5c5dabc9cbea477e87d2140e3bdf6b29/FLAG79926b1ed [2021-01-06 19:56:02,391 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:56:02,392 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2021-01-06 19:56:02,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b66772afc/5c5dabc9cbea477e87d2140e3bdf6b29/FLAG79926b1ed [2021-01-06 19:56:02,688 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b66772afc/5c5dabc9cbea477e87d2140e3bdf6b29 [2021-01-06 19:56:02,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:56:02,694 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:56:02,696 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:56:02,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:56:02,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:56:02,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:56:02" (1/1) ... [2021-01-06 19:56:02,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dbe8c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:02, skipping insertion in model container [2021-01-06 19:56:02,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:56:02" (1/1) ... [2021-01-06 19:56:02,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:56:02,752 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[~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[~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[~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~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:56:03,046 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.1.ufo.UNBOUNDED.pals.c[12951,12964] [2021-01-06 19:56:03,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:56:03,063 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[~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[~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[~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~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:56:03,163 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.1.ufo.UNBOUNDED.pals.c[12951,12964] [2021-01-06 19:56:03,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:56:03,200 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:56:03,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:03 WrapperNode [2021-01-06 19:56:03,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:56:03,202 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:56:03,202 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:56:03,202 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:56:03,211 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:56:03" (1/1) ... [2021-01-06 19:56:03,227 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:56:03" (1/1) ... [2021-01-06 19:56:03,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:56:03,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:56:03,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:56:03,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:56:03,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:03" (1/1) ... [2021-01-06 19:56:03,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:03" (1/1) ... [2021-01-06 19:56:03,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:03" (1/1) ... [2021-01-06 19:56:03,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:03" (1/1) ... [2021-01-06 19:56:03,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:03" (1/1) ... [2021-01-06 19:56:03,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:03" (1/1) ... [2021-01-06 19:56:03,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:03" (1/1) ... [2021-01-06 19:56:03,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:56:03,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:56:03,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:56:03,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:56:03,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:03" (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:56:03,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:56:03,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:56:03,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:56:03,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:56:04,394 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:56:04,394 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-01-06 19:56:04,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:56:04 BoogieIcfgContainer [2021-01-06 19:56:04,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:56:04,399 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:56:04,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:56:04,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:56:04,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:56:02" (1/3) ... [2021-01-06 19:56:04,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a066231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:56:04, skipping insertion in model container [2021-01-06 19:56:04,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:56:03" (2/3) ... [2021-01-06 19:56:04,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a066231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:56:04, skipping insertion in model container [2021-01-06 19:56:04,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:56:04" (3/3) ... [2021-01-06 19:56:04,408 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2021-01-06 19:56:04,416 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:56:04,423 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:56:04,448 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:56:04,479 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:56:04,479 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:56:04,479 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:56:04,479 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:56:04,479 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:56:04,480 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:56:04,480 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:56:04,480 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:56:04,502 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2021-01-06 19:56:04,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:56:04,513 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:04,514 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:56:04,514 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:04,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:04,521 INFO L82 PathProgramCache]: Analyzing trace with hash 126688108, now seen corresponding path program 1 times [2021-01-06 19:56:04,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:04,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656488511] [2021-01-06 19:56:04,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:04,791 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:56:04,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656488511] [2021-01-06 19:56:04,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:04,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:56:04,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713559465] [2021-01-06 19:56:04,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 19:56:04,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:04,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 19:56:04,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:56:04,828 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 2 states. [2021-01-06 19:56:04,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:04,871 INFO L93 Difference]: Finished difference Result 227 states and 389 transitions. [2021-01-06 19:56:04,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 19:56:04,873 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2021-01-06 19:56:04,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:04,887 INFO L225 Difference]: With dead ends: 227 [2021-01-06 19:56:04,887 INFO L226 Difference]: Without dead ends: 138 [2021-01-06 19:56:04,891 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:56:04,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-01-06 19:56:04,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2021-01-06 19:56:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2021-01-06 19:56:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 237 transitions. [2021-01-06 19:56:04,948 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 237 transitions. Word has length 37 [2021-01-06 19:56:04,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:04,949 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 237 transitions. [2021-01-06 19:56:04,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 19:56:04,949 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 237 transitions. [2021-01-06 19:56:04,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:56:04,951 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:04,952 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:56:04,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:56:04,952 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:04,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:04,953 INFO L82 PathProgramCache]: Analyzing trace with hash -690960342, now seen corresponding path program 1 times [2021-01-06 19:56:04,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:04,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143858864] [2021-01-06 19:56:04,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:05,145 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:56:05,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143858864] [2021-01-06 19:56:05,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:05,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:56:05,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927937834] [2021-01-06 19:56:05,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:56:05,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:05,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:56:05,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:56:05,153 INFO L87 Difference]: Start difference. First operand 138 states and 237 transitions. Second operand 5 states. [2021-01-06 19:56:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:05,311 INFO L93 Difference]: Finished difference Result 226 states and 382 transitions. [2021-01-06 19:56:05,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:56:05,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2021-01-06 19:56:05,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:05,319 INFO L225 Difference]: With dead ends: 226 [2021-01-06 19:56:05,319 INFO L226 Difference]: Without dead ends: 138 [2021-01-06 19:56:05,321 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:56:05,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-01-06 19:56:05,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2021-01-06 19:56:05,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2021-01-06 19:56:05,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 213 transitions. [2021-01-06 19:56:05,337 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 213 transitions. Word has length 37 [2021-01-06 19:56:05,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:05,338 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 213 transitions. [2021-01-06 19:56:05,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:56:05,338 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 213 transitions. [2021-01-06 19:56:05,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-01-06 19:56:05,340 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:05,341 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] [2021-01-06 19:56:05,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:56:05,341 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:05,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:05,342 INFO L82 PathProgramCache]: Analyzing trace with hash 747585835, now seen corresponding path program 1 times [2021-01-06 19:56:05,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:05,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432398899] [2021-01-06 19:56:05,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:05,520 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:56:05,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432398899] [2021-01-06 19:56:05,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:05,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:05,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658344232] [2021-01-06 19:56:05,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:05,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:05,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:05,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:05,530 INFO L87 Difference]: Start difference. First operand 138 states and 213 transitions. Second operand 3 states. [2021-01-06 19:56:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:05,614 INFO L93 Difference]: Finished difference Result 296 states and 477 transitions. [2021-01-06 19:56:05,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:05,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2021-01-06 19:56:05,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:05,620 INFO L225 Difference]: With dead ends: 296 [2021-01-06 19:56:05,621 INFO L226 Difference]: Without dead ends: 212 [2021-01-06 19:56:05,625 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:56:05,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-01-06 19:56:05,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 209. [2021-01-06 19:56:05,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2021-01-06 19:56:05,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 328 transitions. [2021-01-06 19:56:05,669 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 328 transitions. Word has length 60 [2021-01-06 19:56:05,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:05,670 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 328 transitions. [2021-01-06 19:56:05,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:05,671 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 328 transitions. [2021-01-06 19:56:05,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-06 19:56:05,674 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:05,674 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] [2021-01-06 19:56:05,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:56:05,674 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:05,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:05,679 INFO L82 PathProgramCache]: Analyzing trace with hash -53855584, now seen corresponding path program 1 times [2021-01-06 19:56:05,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:05,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051258049] [2021-01-06 19:56:05,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:05,841 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:56:05,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051258049] [2021-01-06 19:56:05,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:05,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:05,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462327173] [2021-01-06 19:56:05,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:05,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:05,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:05,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:05,845 INFO L87 Difference]: Start difference. First operand 209 states and 328 transitions. Second operand 3 states. [2021-01-06 19:56:05,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:05,879 INFO L93 Difference]: Finished difference Result 503 states and 812 transitions. [2021-01-06 19:56:05,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:05,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2021-01-06 19:56:05,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:05,883 INFO L225 Difference]: With dead ends: 503 [2021-01-06 19:56:05,883 INFO L226 Difference]: Without dead ends: 348 [2021-01-06 19:56:05,884 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:56:05,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-01-06 19:56:05,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 344. [2021-01-06 19:56:05,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2021-01-06 19:56:05,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 549 transitions. [2021-01-06 19:56:05,904 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 549 transitions. Word has length 62 [2021-01-06 19:56:05,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:05,905 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 549 transitions. [2021-01-06 19:56:05,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:05,905 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 549 transitions. [2021-01-06 19:56:05,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 19:56:05,908 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:05,908 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] [2021-01-06 19:56:05,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:56:05,909 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:05,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:05,909 INFO L82 PathProgramCache]: Analyzing trace with hash -730458987, now seen corresponding path program 1 times [2021-01-06 19:56:05,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:05,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087506620] [2021-01-06 19:56:05,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:06,057 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:56:06,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087506620] [2021-01-06 19:56:06,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:06,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:06,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801311199] [2021-01-06 19:56:06,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:06,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:06,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:06,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:06,066 INFO L87 Difference]: Start difference. First operand 344 states and 549 transitions. Second operand 3 states. [2021-01-06 19:56:06,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:06,122 INFO L93 Difference]: Finished difference Result 892 states and 1447 transitions. [2021-01-06 19:56:06,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:06,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2021-01-06 19:56:06,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:06,127 INFO L225 Difference]: With dead ends: 892 [2021-01-06 19:56:06,127 INFO L226 Difference]: Without dead ends: 602 [2021-01-06 19:56:06,128 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:56:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2021-01-06 19:56:06,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 596. [2021-01-06 19:56:06,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2021-01-06 19:56:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 957 transitions. [2021-01-06 19:56:06,160 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 957 transitions. Word has length 64 [2021-01-06 19:56:06,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:06,161 INFO L481 AbstractCegarLoop]: Abstraction has 596 states and 957 transitions. [2021-01-06 19:56:06,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:06,161 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 957 transitions. [2021-01-06 19:56:06,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 19:56:06,163 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:06,164 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:56:06,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:56:06,164 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:06,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:06,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1382576374, now seen corresponding path program 1 times [2021-01-06 19:56:06,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:06,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089185176] [2021-01-06 19:56:06,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:06,372 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:56:06,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089185176] [2021-01-06 19:56:06,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:06,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:56:06,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600177135] [2021-01-06 19:56:06,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:56:06,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:06,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:56:06,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:56:06,375 INFO L87 Difference]: Start difference. First operand 596 states and 957 transitions. Second operand 5 states. [2021-01-06 19:56:06,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:06,570 INFO L93 Difference]: Finished difference Result 2290 states and 3762 transitions. [2021-01-06 19:56:06,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:56:06,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2021-01-06 19:56:06,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:06,581 INFO L225 Difference]: With dead ends: 2290 [2021-01-06 19:56:06,582 INFO L226 Difference]: Without dead ends: 1748 [2021-01-06 19:56:06,584 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:56:06,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2021-01-06 19:56:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1071. [2021-01-06 19:56:06,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1071 states. [2021-01-06 19:56:06,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1733 transitions. [2021-01-06 19:56:06,632 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1733 transitions. Word has length 66 [2021-01-06 19:56:06,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:06,633 INFO L481 AbstractCegarLoop]: Abstraction has 1071 states and 1733 transitions. [2021-01-06 19:56:06,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:56:06,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1733 transitions. [2021-01-06 19:56:06,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 19:56:06,635 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:06,635 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:06,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:56:06,635 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:06,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:06,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1833027237, now seen corresponding path program 1 times [2021-01-06 19:56:06,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:06,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815621821] [2021-01-06 19:56:06,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:06,717 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:56:06,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815621821] [2021-01-06 19:56:06,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:06,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:56:06,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660275221] [2021-01-06 19:56:06,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:56:06,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:06,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:56:06,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:56:06,722 INFO L87 Difference]: Start difference. First operand 1071 states and 1733 transitions. Second operand 4 states. [2021-01-06 19:56:06,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:06,877 INFO L93 Difference]: Finished difference Result 3132 states and 5136 transitions. [2021-01-06 19:56:06,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:56:06,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2021-01-06 19:56:06,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:06,889 INFO L225 Difference]: With dead ends: 3132 [2021-01-06 19:56:06,890 INFO L226 Difference]: Without dead ends: 2115 [2021-01-06 19:56:06,892 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:56:06,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2021-01-06 19:56:06,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 1584. [2021-01-06 19:56:06,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2021-01-06 19:56:06,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2575 transitions. [2021-01-06 19:56:06,972 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2575 transitions. Word has length 67 [2021-01-06 19:56:06,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:06,974 INFO L481 AbstractCegarLoop]: Abstraction has 1584 states and 2575 transitions. [2021-01-06 19:56:06,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:56:06,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2575 transitions. [2021-01-06 19:56:06,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 19:56:06,977 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:06,978 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:56:06,978 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:56:06,978 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:06,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:06,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1551869537, now seen corresponding path program 1 times [2021-01-06 19:56:06,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:06,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322174032] [2021-01-06 19:56:06,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:07,057 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:56:07,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322174032] [2021-01-06 19:56:07,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:07,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:56:07,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197480942] [2021-01-06 19:56:07,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:56:07,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:07,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:56:07,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:56:07,060 INFO L87 Difference]: Start difference. First operand 1584 states and 2575 transitions. Second operand 4 states. [2021-01-06 19:56:07,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:07,234 INFO L93 Difference]: Finished difference Result 4606 states and 7540 transitions. [2021-01-06 19:56:07,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:56:07,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2021-01-06 19:56:07,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:07,253 INFO L225 Difference]: With dead ends: 4606 [2021-01-06 19:56:07,253 INFO L226 Difference]: Without dead ends: 3076 [2021-01-06 19:56:07,256 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:56:07,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3076 states. [2021-01-06 19:56:07,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3076 to 2318. [2021-01-06 19:56:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2021-01-06 19:56:07,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 3765 transitions. [2021-01-06 19:56:07,398 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 3765 transitions. Word has length 68 [2021-01-06 19:56:07,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:07,398 INFO L481 AbstractCegarLoop]: Abstraction has 2318 states and 3765 transitions. [2021-01-06 19:56:07,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:56:07,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 3765 transitions. [2021-01-06 19:56:07,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 19:56:07,400 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:07,400 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:07,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:56:07,401 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:07,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:07,402 INFO L82 PathProgramCache]: Analyzing trace with hash -721508526, now seen corresponding path program 1 times [2021-01-06 19:56:07,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:07,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048510199] [2021-01-06 19:56:07,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:07,484 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:56:07,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048510199] [2021-01-06 19:56:07,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:07,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:56:07,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005829253] [2021-01-06 19:56:07,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:56:07,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:07,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:56:07,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:56:07,488 INFO L87 Difference]: Start difference. First operand 2318 states and 3765 transitions. Second operand 4 states. [2021-01-06 19:56:07,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:07,690 INFO L93 Difference]: Finished difference Result 6698 states and 10940 transitions. [2021-01-06 19:56:07,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:56:07,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-01-06 19:56:07,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:07,714 INFO L225 Difference]: With dead ends: 6698 [2021-01-06 19:56:07,715 INFO L226 Difference]: Without dead ends: 4434 [2021-01-06 19:56:07,724 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:56:07,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4434 states. [2021-01-06 19:56:07,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4434 to 3360. [2021-01-06 19:56:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3360 states. [2021-01-06 19:56:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3360 states to 3360 states and 5449 transitions. [2021-01-06 19:56:07,951 INFO L78 Accepts]: Start accepts. Automaton has 3360 states and 5449 transitions. Word has length 69 [2021-01-06 19:56:07,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:07,952 INFO L481 AbstractCegarLoop]: Abstraction has 3360 states and 5449 transitions. [2021-01-06 19:56:07,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:56:07,952 INFO L276 IsEmpty]: Start isEmpty. Operand 3360 states and 5449 transitions. [2021-01-06 19:56:07,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 19:56:07,959 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:07,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] [2021-01-06 19:56:07,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:56:07,960 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:07,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:07,960 INFO L82 PathProgramCache]: Analyzing trace with hash -612676452, now seen corresponding path program 1 times [2021-01-06 19:56:07,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:07,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749650403] [2021-01-06 19:56:07,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:08,019 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:56:08,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749650403] [2021-01-06 19:56:08,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:08,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:08,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814447132] [2021-01-06 19:56:08,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:08,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:08,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:08,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:08,022 INFO L87 Difference]: Start difference. First operand 3360 states and 5449 transitions. Second operand 3 states. [2021-01-06 19:56:08,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:08,187 INFO L93 Difference]: Finished difference Result 7646 states and 12406 transitions. [2021-01-06 19:56:08,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:08,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2021-01-06 19:56:08,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:08,215 INFO L225 Difference]: With dead ends: 7646 [2021-01-06 19:56:08,215 INFO L226 Difference]: Without dead ends: 5256 [2021-01-06 19:56:08,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:08,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5256 states. [2021-01-06 19:56:08,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5256 to 5254. [2021-01-06 19:56:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5254 states. [2021-01-06 19:56:08,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5254 states to 5254 states and 8456 transitions. [2021-01-06 19:56:08,523 INFO L78 Accepts]: Start accepts. Automaton has 5254 states and 8456 transitions. Word has length 70 [2021-01-06 19:56:08,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:08,523 INFO L481 AbstractCegarLoop]: Abstraction has 5254 states and 8456 transitions. [2021-01-06 19:56:08,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:08,524 INFO L276 IsEmpty]: Start isEmpty. Operand 5254 states and 8456 transitions. [2021-01-06 19:56:08,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 19:56:08,525 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:08,525 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:56:08,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:56:08,526 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:08,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:08,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1846404324, now seen corresponding path program 1 times [2021-01-06 19:56:08,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:08,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909554193] [2021-01-06 19:56:08,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:08,591 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:56:08,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909554193] [2021-01-06 19:56:08,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:08,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:08,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221443673] [2021-01-06 19:56:08,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:08,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:08,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:08,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:08,598 INFO L87 Difference]: Start difference. First operand 5254 states and 8456 transitions. Second operand 3 states. [2021-01-06 19:56:08,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:08,864 INFO L93 Difference]: Finished difference Result 11466 states and 18510 transitions. [2021-01-06 19:56:08,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:08,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2021-01-06 19:56:08,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:08,925 INFO L225 Difference]: With dead ends: 11466 [2021-01-06 19:56:08,925 INFO L226 Difference]: Without dead ends: 7766 [2021-01-06 19:56:08,933 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:56:08,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7766 states. [2021-01-06 19:56:09,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7766 to 7764. [2021-01-06 19:56:09,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7764 states. [2021-01-06 19:56:09,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7764 states to 7764 states and 12440 transitions. [2021-01-06 19:56:09,332 INFO L78 Accepts]: Start accepts. Automaton has 7764 states and 12440 transitions. Word has length 70 [2021-01-06 19:56:09,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:09,332 INFO L481 AbstractCegarLoop]: Abstraction has 7764 states and 12440 transitions. [2021-01-06 19:56:09,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:09,332 INFO L276 IsEmpty]: Start isEmpty. Operand 7764 states and 12440 transitions. [2021-01-06 19:56:09,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 19:56:09,333 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:09,333 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:56:09,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:56:09,334 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:09,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:09,334 INFO L82 PathProgramCache]: Analyzing trace with hash -827061860, now seen corresponding path program 1 times [2021-01-06 19:56:09,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:09,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827473764] [2021-01-06 19:56:09,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:09,380 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:56:09,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827473764] [2021-01-06 19:56:09,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:09,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:09,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453100090] [2021-01-06 19:56:09,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:09,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:09,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:09,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:09,383 INFO L87 Difference]: Start difference. First operand 7764 states and 12440 transitions. Second operand 3 states. [2021-01-06 19:56:09,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:09,808 INFO L93 Difference]: Finished difference Result 17191 states and 27788 transitions. [2021-01-06 19:56:09,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:09,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2021-01-06 19:56:09,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:09,844 INFO L225 Difference]: With dead ends: 17191 [2021-01-06 19:56:09,844 INFO L226 Difference]: Without dead ends: 11534 [2021-01-06 19:56:09,854 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:56:09,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11534 states. [2021-01-06 19:56:10,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11534 to 11532. [2021-01-06 19:56:10,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11532 states. [2021-01-06 19:56:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11532 states to 11532 states and 18437 transitions. [2021-01-06 19:56:10,489 INFO L78 Accepts]: Start accepts. Automaton has 11532 states and 18437 transitions. Word has length 70 [2021-01-06 19:56:10,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:10,489 INFO L481 AbstractCegarLoop]: Abstraction has 11532 states and 18437 transitions. [2021-01-06 19:56:10,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:10,490 INFO L276 IsEmpty]: Start isEmpty. Operand 11532 states and 18437 transitions. [2021-01-06 19:56:10,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 19:56:10,491 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:10,491 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:10,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:56:10,493 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:10,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:10,494 INFO L82 PathProgramCache]: Analyzing trace with hash 287488266, now seen corresponding path program 1 times [2021-01-06 19:56:10,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:10,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818188317] [2021-01-06 19:56:10,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:10,667 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:56:10,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818188317] [2021-01-06 19:56:10,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:10,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:56:10,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978440403] [2021-01-06 19:56:10,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:56:10,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:10,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:56:10,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:56:10,670 INFO L87 Difference]: Start difference. First operand 11532 states and 18437 transitions. Second operand 4 states. [2021-01-06 19:56:11,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:11,628 INFO L93 Difference]: Finished difference Result 34091 states and 54439 transitions. [2021-01-06 19:56:11,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:56:11,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2021-01-06 19:56:11,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:11,684 INFO L225 Difference]: With dead ends: 34091 [2021-01-06 19:56:11,685 INFO L226 Difference]: Without dead ends: 22568 [2021-01-06 19:56:11,708 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:56:11,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22568 states. [2021-01-06 19:56:12,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22568 to 22566. [2021-01-06 19:56:12,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22566 states. [2021-01-06 19:56:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22566 states to 22566 states and 35790 transitions. [2021-01-06 19:56:12,892 INFO L78 Accepts]: Start accepts. Automaton has 22566 states and 35790 transitions. Word has length 71 [2021-01-06 19:56:12,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:12,895 INFO L481 AbstractCegarLoop]: Abstraction has 22566 states and 35790 transitions. [2021-01-06 19:56:12,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:56:12,896 INFO L276 IsEmpty]: Start isEmpty. Operand 22566 states and 35790 transitions. [2021-01-06 19:56:12,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:56:12,898 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:12,898 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:56:12,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:56:12,899 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:12,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:12,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1965061944, now seen corresponding path program 1 times [2021-01-06 19:56:12,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:12,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757053019] [2021-01-06 19:56:12,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:12,965 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:56:12,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757053019] [2021-01-06 19:56:12,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:12,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:12,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591692114] [2021-01-06 19:56:12,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:12,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:12,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:12,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:12,969 INFO L87 Difference]: Start difference. First operand 22566 states and 35790 transitions. Second operand 3 states. [2021-01-06 19:56:14,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:14,186 INFO L93 Difference]: Finished difference Result 54899 states and 87564 transitions. [2021-01-06 19:56:14,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:14,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 19:56:14,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:14,276 INFO L225 Difference]: With dead ends: 54899 [2021-01-06 19:56:14,276 INFO L226 Difference]: Without dead ends: 32450 [2021-01-06 19:56:14,308 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:56:14,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32450 states. [2021-01-06 19:56:15,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32450 to 31174. [2021-01-06 19:56:15,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31174 states. [2021-01-06 19:56:15,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31174 states to 31174 states and 49343 transitions. [2021-01-06 19:56:15,968 INFO L78 Accepts]: Start accepts. Automaton has 31174 states and 49343 transitions. Word has length 72 [2021-01-06 19:56:15,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:15,968 INFO L481 AbstractCegarLoop]: Abstraction has 31174 states and 49343 transitions. [2021-01-06 19:56:15,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:15,969 INFO L276 IsEmpty]: Start isEmpty. Operand 31174 states and 49343 transitions. [2021-01-06 19:56:15,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:56:15,973 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:15,973 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:56:15,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:56:15,973 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:15,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:15,977 INFO L82 PathProgramCache]: Analyzing trace with hash 2042723926, now seen corresponding path program 1 times [2021-01-06 19:56:15,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:15,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328592641] [2021-01-06 19:56:15,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:16,011 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:56:16,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328592641] [2021-01-06 19:56:16,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:16,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:16,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084280635] [2021-01-06 19:56:16,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:16,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:16,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:16,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:16,014 INFO L87 Difference]: Start difference. First operand 31174 states and 49343 transitions. Second operand 3 states. [2021-01-06 19:56:17,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:17,809 INFO L93 Difference]: Finished difference Result 93484 states and 147967 transitions. [2021-01-06 19:56:17,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:17,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 19:56:17,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:17,990 INFO L225 Difference]: With dead ends: 93484 [2021-01-06 19:56:17,991 INFO L226 Difference]: Without dead ends: 62338 [2021-01-06 19:56:18,037 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:56:18,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62338 states. [2021-01-06 19:56:19,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62338 to 31176. [2021-01-06 19:56:19,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31176 states. [2021-01-06 19:56:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31176 states to 31176 states and 49345 transitions. [2021-01-06 19:56:19,613 INFO L78 Accepts]: Start accepts. Automaton has 31176 states and 49345 transitions. Word has length 72 [2021-01-06 19:56:19,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:19,613 INFO L481 AbstractCegarLoop]: Abstraction has 31176 states and 49345 transitions. [2021-01-06 19:56:19,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:19,613 INFO L276 IsEmpty]: Start isEmpty. Operand 31176 states and 49345 transitions. [2021-01-06 19:56:19,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 19:56:19,614 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:19,614 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:56:19,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:56:19,615 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:19,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:19,615 INFO L82 PathProgramCache]: Analyzing trace with hash -858327306, now seen corresponding path program 1 times [2021-01-06 19:56:19,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:19,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801846822] [2021-01-06 19:56:19,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:19,702 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:56:19,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801846822] [2021-01-06 19:56:19,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:19,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:56:19,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997187050] [2021-01-06 19:56:19,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:56:19,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:19,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:56:19,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:56:19,705 INFO L87 Difference]: Start difference. First operand 31176 states and 49345 transitions. Second operand 4 states. [2021-01-06 19:56:21,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:21,709 INFO L93 Difference]: Finished difference Result 92170 states and 145713 transitions. [2021-01-06 19:56:21,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:56:21,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2021-01-06 19:56:21,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:21,820 INFO L225 Difference]: With dead ends: 92170 [2021-01-06 19:56:21,820 INFO L226 Difference]: Without dead ends: 61024 [2021-01-06 19:56:21,853 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:56:21,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61024 states. [2021-01-06 19:56:24,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61024 to 61022. [2021-01-06 19:56:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61022 states. [2021-01-06 19:56:24,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61022 states to 61022 states and 95856 transitions. [2021-01-06 19:56:24,311 INFO L78 Accepts]: Start accepts. Automaton has 61022 states and 95856 transitions. Word has length 73 [2021-01-06 19:56:24,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:24,311 INFO L481 AbstractCegarLoop]: Abstraction has 61022 states and 95856 transitions. [2021-01-06 19:56:24,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:56:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 61022 states and 95856 transitions. [2021-01-06 19:56:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 19:56:24,313 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:24,313 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:56:24,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:56:24,314 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:24,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:24,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1115832228, now seen corresponding path program 1 times [2021-01-06 19:56:24,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:24,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139174537] [2021-01-06 19:56:24,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:24,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:56:24,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139174537] [2021-01-06 19:56:24,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:24,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:24,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859410816] [2021-01-06 19:56:24,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:24,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:24,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:24,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:24,374 INFO L87 Difference]: Start difference. First operand 61022 states and 95856 transitions. Second operand 3 states. [2021-01-06 19:56:27,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:27,542 INFO L93 Difference]: Finished difference Result 148126 states and 233512 transitions. [2021-01-06 19:56:27,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:27,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 19:56:27,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:27,739 INFO L225 Difference]: With dead ends: 148126 [2021-01-06 19:56:27,739 INFO L226 Difference]: Without dead ends: 87360 [2021-01-06 19:56:27,798 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:56:28,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87360 states. [2021-01-06 19:56:30,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87360 to 84030. [2021-01-06 19:56:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84030 states. [2021-01-06 19:56:31,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84030 states to 84030 states and 131478 transitions. [2021-01-06 19:56:31,145 INFO L78 Accepts]: Start accepts. Automaton has 84030 states and 131478 transitions. Word has length 74 [2021-01-06 19:56:31,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:31,145 INFO L481 AbstractCegarLoop]: Abstraction has 84030 states and 131478 transitions. [2021-01-06 19:56:31,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:31,146 INFO L276 IsEmpty]: Start isEmpty. Operand 84030 states and 131478 transitions. [2021-01-06 19:56:31,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 19:56:31,147 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:31,147 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:56:31,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:56:31,148 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:31,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:31,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1623085506, now seen corresponding path program 1 times [2021-01-06 19:56:31,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:31,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86707971] [2021-01-06 19:56:31,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:31,182 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:56:31,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86707971] [2021-01-06 19:56:31,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:31,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:31,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090784438] [2021-01-06 19:56:31,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:31,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:31,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:31,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:31,185 INFO L87 Difference]: Start difference. First operand 84030 states and 131478 transitions. Second operand 3 states. [2021-01-06 19:56:36,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:36,795 INFO L93 Difference]: Finished difference Result 252014 states and 394314 transitions. [2021-01-06 19:56:36,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:56:36,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2021-01-06 19:56:36,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:37,104 INFO L225 Difference]: With dead ends: 252014 [2021-01-06 19:56:37,104 INFO L226 Difference]: Without dead ends: 168028 [2021-01-06 19:56:37,179 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:56:37,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168028 states. [2021-01-06 19:56:40,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168028 to 84034. [2021-01-06 19:56:40,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84034 states. [2021-01-06 19:56:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84034 states to 84034 states and 131482 transitions. [2021-01-06 19:56:41,117 INFO L78 Accepts]: Start accepts. Automaton has 84034 states and 131482 transitions. Word has length 74 [2021-01-06 19:56:41,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:41,117 INFO L481 AbstractCegarLoop]: Abstraction has 84034 states and 131482 transitions. [2021-01-06 19:56:41,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 84034 states and 131482 transitions. [2021-01-06 19:56:41,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 19:56:41,119 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:41,119 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:56:41,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:56:41,119 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:41,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:41,120 INFO L82 PathProgramCache]: Analyzing trace with hash -418317598, now seen corresponding path program 1 times [2021-01-06 19:56:41,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:41,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241773543] [2021-01-06 19:56:41,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:41,357 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:56:41,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241773543] [2021-01-06 19:56:41,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:41,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:56:41,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191334797] [2021-01-06 19:56:41,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:56:41,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:41,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:56:41,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:56:41,366 INFO L87 Difference]: Start difference. First operand 84034 states and 131482 transitions. Second operand 4 states. [2021-01-06 19:56:46,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:46,595 INFO L93 Difference]: Finished difference Result 248354 states and 388042 transitions. [2021-01-06 19:56:46,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:56:46,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-06 19:56:46,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:46,955 INFO L225 Difference]: With dead ends: 248354 [2021-01-06 19:56:46,955 INFO L226 Difference]: Without dead ends: 164368 [2021-01-06 19:56:47,022 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:56:47,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164368 states. [2021-01-06 19:56:53,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164368 to 164366. [2021-01-06 19:56:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164366 states. [2021-01-06 19:56:53,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164366 states to 164366 states and 255064 transitions. [2021-01-06 19:56:53,605 INFO L78 Accepts]: Start accepts. Automaton has 164366 states and 255064 transitions. Word has length 75 [2021-01-06 19:56:53,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:53,605 INFO L481 AbstractCegarLoop]: Abstraction has 164366 states and 255064 transitions. [2021-01-06 19:56:53,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:56:53,605 INFO L276 IsEmpty]: Start isEmpty. Operand 164366 states and 255064 transitions. [2021-01-06 19:56:53,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:56:53,610 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:53,610 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:53,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:56:53,610 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:53,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:53,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1354207360, now seen corresponding path program 1 times [2021-01-06 19:56:53,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:53,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376860818] [2021-01-06 19:56:53,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:53,669 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:56:53,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376860818] [2021-01-06 19:56:53,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:53,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:53,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052684848] [2021-01-06 19:56:53,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:53,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:53,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:53,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:53,672 INFO L87 Difference]: Start difference. First operand 164366 states and 255064 transitions. Second operand 3 states. [2021-01-06 19:57:01,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:01,818 INFO L93 Difference]: Finished difference Result 399802 states and 623386 transitions. [2021-01-06 19:57:01,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:57:01,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2021-01-06 19:57:01,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:02,571 INFO L225 Difference]: With dead ends: 399802 [2021-01-06 19:57:02,571 INFO L226 Difference]: Without dead ends: 235952 [2021-01-06 19:57:02,689 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:02,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235952 states. [2021-01-06 19:57:11,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235952 to 225870. [2021-01-06 19:57:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225870 states. [2021-01-06 19:57:12,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225870 states to 225870 states and 348512 transitions. [2021-01-06 19:57:12,387 INFO L78 Accepts]: Start accepts. Automaton has 225870 states and 348512 transitions. Word has length 76 [2021-01-06 19:57:12,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:12,388 INFO L481 AbstractCegarLoop]: Abstraction has 225870 states and 348512 transitions. [2021-01-06 19:57:12,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:57:12,388 INFO L276 IsEmpty]: Start isEmpty. Operand 225870 states and 348512 transitions. [2021-01-06 19:57:12,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:57:12,390 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:12,390 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:57:12,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:57:12,391 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:12,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:12,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1923205934, now seen corresponding path program 1 times [2021-01-06 19:57:12,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:12,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811221543] [2021-01-06 19:57:12,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:12,439 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:12,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811221543] [2021-01-06 19:57:12,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:12,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:57:12,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137656972] [2021-01-06 19:57:12,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:57:12,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:12,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:57:12,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:57:12,443 INFO L87 Difference]: Start difference. First operand 225870 states and 348512 transitions. Second operand 3 states. [2021-01-06 19:57:27,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:27,721 INFO L93 Difference]: Finished difference Result 677210 states and 1045014 transitions. [2021-01-06 19:57:27,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:57:27,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2021-01-06 19:57:27,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:29,015 INFO L225 Difference]: With dead ends: 677210 [2021-01-06 19:57:29,016 INFO L226 Difference]: Without dead ends: 451648 [2021-01-06 19:57:29,270 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:29,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451648 states. [2021-01-06 19:57:40,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451648 to 225878. [2021-01-06 19:57:40,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225878 states. [2021-01-06 19:57:41,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225878 states to 225878 states and 348520 transitions. [2021-01-06 19:57:41,511 INFO L78 Accepts]: Start accepts. Automaton has 225878 states and 348520 transitions. Word has length 76 [2021-01-06 19:57:41,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:57:41,511 INFO L481 AbstractCegarLoop]: Abstraction has 225878 states and 348520 transitions. [2021-01-06 19:57:41,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:57:41,512 INFO L276 IsEmpty]: Start isEmpty. Operand 225878 states and 348520 transitions. [2021-01-06 19:57:41,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 19:57:41,513 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:57:41,514 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:41,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:57:41,516 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:57:41,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:57:41,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1599719081, now seen corresponding path program 1 times [2021-01-06 19:57:41,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:57:41,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485017535] [2021-01-06 19:57:41,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:57:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:57:41,641 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:41,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485017535] [2021-01-06 19:57:41,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:57:41,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:57:41,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233756912] [2021-01-06 19:57:41,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:57:41,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:57:41,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:57:41,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:57:41,643 INFO L87 Difference]: Start difference. First operand 225878 states and 348520 transitions. Second operand 5 states. [2021-01-06 19:57:58,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:57:58,739 INFO L93 Difference]: Finished difference Result 638976 states and 985249 transitions. [2021-01-06 19:57:58,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:57:58,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2021-01-06 19:57:58,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:57:59,727 INFO L225 Difference]: With dead ends: 638976 [2021-01-06 19:57:59,727 INFO L226 Difference]: Without dead ends: 413186 [2021-01-06 19:57:59,938 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:58:00,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413186 states. [2021-01-06 19:58:18,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413186 to 413184. [2021-01-06 19:58:18,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413184 states. [2021-01-06 19:58:20,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413184 states to 413184 states and 631873 transitions. [2021-01-06 19:58:20,150 INFO L78 Accepts]: Start accepts. Automaton has 413184 states and 631873 transitions. Word has length 77 [2021-01-06 19:58:20,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:58:20,150 INFO L481 AbstractCegarLoop]: Abstraction has 413184 states and 631873 transitions. [2021-01-06 19:58:20,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:58:20,150 INFO L276 IsEmpty]: Start isEmpty. Operand 413184 states and 631873 transitions. [2021-01-06 19:58:20,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 19:58:20,153 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:58:20,153 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:58:20,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:58:20,154 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:58:20,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:58:20,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1662532402, now seen corresponding path program 1 times [2021-01-06 19:58:20,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:58:20,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307368586] [2021-01-06 19:58:20,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:58:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:58:20,322 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,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307368586] [2021-01-06 19:58:20,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:58:20,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:58:20,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685514674] [2021-01-06 19:58:20,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:58:20,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:58:20,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:58:20,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:58:20,328 INFO L87 Difference]: Start difference. First operand 413184 states and 631873 transitions. Second operand 5 states. [2021-01-06 19:58:41,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:58:41,672 INFO L93 Difference]: Finished difference Result 890130 states and 1365616 transitions. [2021-01-06 19:58:41,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:58:41,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2021-01-06 19:58:41,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:58:43,071 INFO L225 Difference]: With dead ends: 890130 [2021-01-06 19:58:43,071 INFO L226 Difference]: Without dead ends: 477952 [2021-01-06 19:58:43,435 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:58:43,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477952 states. [2021-01-06 19:59:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477952 to 413184. [2021-01-06 19:59:03,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413184 states. [2021-01-06 19:59:06,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413184 states to 413184 states and 626777 transitions. [2021-01-06 19:59:06,646 INFO L78 Accepts]: Start accepts. Automaton has 413184 states and 626777 transitions. Word has length 77 [2021-01-06 19:59:06,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:59:06,646 INFO L481 AbstractCegarLoop]: Abstraction has 413184 states and 626777 transitions. [2021-01-06 19:59:06,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:59:06,647 INFO L276 IsEmpty]: Start isEmpty. Operand 413184 states and 626777 transitions. [2021-01-06 19:59:06,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 19:59:06,679 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:59:06,679 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:59:06,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:59:06,680 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:59:06,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:59:06,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1531914368, now seen corresponding path program 1 times [2021-01-06 19:59:06,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:59:06,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918599202] [2021-01-06 19:59:06,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:59:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:59:06,893 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:06,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918599202] [2021-01-06 19:59:06,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:59:06,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:59:06,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759899219] [2021-01-06 19:59:06,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:59:06,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:59:06,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:59:06,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:59:06,899 INFO L87 Difference]: Start difference. First operand 413184 states and 626777 transitions. Second operand 5 states.