/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:37:07,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:37:07,654 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:37:07,710 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:37:07,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:37:07,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:37:07,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:37:07,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:37:07,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:37:07,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:37:07,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:37:07,743 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:37:07,743 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:37:07,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:37:07,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:37:07,751 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:37:07,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:37:07,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:37:07,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:37:07,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:37:07,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:37:07,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:37:07,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:37:07,784 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:37:07,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:37:07,793 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:37:07,794 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:37:07,796 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:37:07,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:37:07,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:37:07,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:37:07,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:37:07,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:37:07,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:37:07,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:37:07,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:37:07,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:37:07,812 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:37:07,813 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:37:07,814 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:37:07,814 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:37:07,815 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:37:07,862 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:37:07,862 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:37:07,864 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:37:07,864 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:37:07,868 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:37:07,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:37:07,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:37:07,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:37:07,869 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:37:07,869 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:37:07,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:37:07,870 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:37:07,870 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:37:07,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:37:07,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:37:07,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:37:07,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:37:07,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:37:07,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:37:07,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:37:07,873 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:37:07,873 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:37:07,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:37:07,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:37:07,874 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:37:07,874 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:37:08,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:37:08,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:37:08,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:37:08,320 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:37:08,320 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:37:08,321 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c [2021-01-06 19:37:08,407 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cdff25fea/48dc390008794afa9b17e685259d4eb6/FLAG03471c9d1 [2021-01-06 19:37:09,054 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:37:09,055 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c [2021-01-06 19:37:09,067 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cdff25fea/48dc390008794afa9b17e685259d4eb6/FLAG03471c9d1 [2021-01-06 19:37:09,396 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cdff25fea/48dc390008794afa9b17e685259d4eb6 [2021-01-06 19:37:09,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:37:09,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:37:09,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:37:09,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:37:09,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:37:09,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:37:09" (1/1) ... [2021-01-06 19:37:09,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@555b07dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:37:09, skipping insertion in model container [2021-01-06 19:37:09,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:37:09" (1/1) ... [2021-01-06 19:37:09,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:37:09,506 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r121~0,] left hand side expression in assignment: lhs: VariableLHS[~r131~0,] left hand side expression in assignment: lhs: VariableLHS[~r211~0,] left hand side expression in assignment: lhs: VariableLHS[~r231~0,] left hand side expression in assignment: lhs: VariableLHS[~r311~0,] left hand side expression in assignment: lhs: VariableLHS[~r321~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~r122~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~r132~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~r212~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~r232~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~r312~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~r322~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2021-01-06 19:37:09,848 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c[12966,12979] [2021-01-06 19:37:09,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:37:09,864 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r121~0,] left hand side expression in assignment: lhs: VariableLHS[~r131~0,] left hand side expression in assignment: lhs: VariableLHS[~r211~0,] left hand side expression in assignment: lhs: VariableLHS[~r231~0,] left hand side expression in assignment: lhs: VariableLHS[~r311~0,] left hand side expression in assignment: lhs: VariableLHS[~r321~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~r122~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~r132~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~r212~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~r232~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~r312~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~r322~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2021-01-06 19:37:09,942 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.ufo.UNBOUNDED.pals.c[12966,12979] [2021-01-06 19:37:09,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:37:09,975 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:37:09,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:37:09 WrapperNode [2021-01-06 19:37:09,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:37:09,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:37:09,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:37:09,978 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:37:09,990 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:37:09" (1/1) ... [2021-01-06 19:37:10,005 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:37:09" (1/1) ... [2021-01-06 19:37:10,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:37:10,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:37:10,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:37:10,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:37:10,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:37:09" (1/1) ... [2021-01-06 19:37:10,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:37:09" (1/1) ... [2021-01-06 19:37:10,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:37:09" (1/1) ... [2021-01-06 19:37:10,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:37:09" (1/1) ... [2021-01-06 19:37:10,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:37:09" (1/1) ... [2021-01-06 19:37:10,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:37:09" (1/1) ... [2021-01-06 19:37:10,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:37:09" (1/1) ... [2021-01-06 19:37:10,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:37:10,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:37:10,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:37:10,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:37:10,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:37:09" (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:37:10,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:37:10,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:37:10,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:37:10,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:37:11,015 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:37:11,016 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-01-06 19:37:11,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:37:11 BoogieIcfgContainer [2021-01-06 19:37:11,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:37:11,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:37:11,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:37:11,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:37:11,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:37:09" (1/3) ... [2021-01-06 19:37:11,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9925cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:37:11, skipping insertion in model container [2021-01-06 19:37:11,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:37:09" (2/3) ... [2021-01-06 19:37:11,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9925cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:37:11, skipping insertion in model container [2021-01-06 19:37:11,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:37:11" (3/3) ... [2021-01-06 19:37:11,030 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.UNBOUNDED.pals.c [2021-01-06 19:37:11,038 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:37:11,045 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:37:11,069 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:37:11,103 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:37:11,104 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:37:11,104 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:37:11,104 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:37:11,104 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:37:11,105 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:37:11,105 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:37:11,105 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:37:11,128 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2021-01-06 19:37:11,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:37:11,139 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:11,140 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:37:11,141 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:11,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:11,148 INFO L82 PathProgramCache]: Analyzing trace with hash 298975739, now seen corresponding path program 1 times [2021-01-06 19:37:11,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:11,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584545661] [2021-01-06 19:37:11,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:11,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:11,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584545661] [2021-01-06 19:37:11,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:11,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:37:11,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504440632] [2021-01-06 19:37:11,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 19:37:11,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:11,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 19:37:11,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:37:11,545 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 2 states. [2021-01-06 19:37:11,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:11,584 INFO L93 Difference]: Finished difference Result 212 states and 365 transitions. [2021-01-06 19:37:11,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 19:37:11,586 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2021-01-06 19:37:11,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:11,600 INFO L225 Difference]: With dead ends: 212 [2021-01-06 19:37:11,601 INFO L226 Difference]: Without dead ends: 132 [2021-01-06 19:37:11,604 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:37:11,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-01-06 19:37:11,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-01-06 19:37:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2021-01-06 19:37:11,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 228 transitions. [2021-01-06 19:37:11,665 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 228 transitions. Word has length 37 [2021-01-06 19:37:11,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:11,666 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 228 transitions. [2021-01-06 19:37:11,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 19:37:11,667 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 228 transitions. [2021-01-06 19:37:11,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:37:11,670 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:11,670 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:37:11,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:37:11,671 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:11,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:11,673 INFO L82 PathProgramCache]: Analyzing trace with hash -518672711, now seen corresponding path program 1 times [2021-01-06 19:37:11,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:11,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110546841] [2021-01-06 19:37:11,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:11,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110546841] [2021-01-06 19:37:11,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:11,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:37:11,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912133062] [2021-01-06 19:37:11,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:37:11,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:11,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:37:11,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:37:11,917 INFO L87 Difference]: Start difference. First operand 132 states and 228 transitions. Second operand 5 states. [2021-01-06 19:37:12,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:12,077 INFO L93 Difference]: Finished difference Result 211 states and 358 transitions. [2021-01-06 19:37:12,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:37:12,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2021-01-06 19:37:12,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:12,080 INFO L225 Difference]: With dead ends: 211 [2021-01-06 19:37:12,081 INFO L226 Difference]: Without dead ends: 132 [2021-01-06 19:37:12,082 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:37:12,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-01-06 19:37:12,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-01-06 19:37:12,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2021-01-06 19:37:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 201 transitions. [2021-01-06 19:37:12,096 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 201 transitions. Word has length 37 [2021-01-06 19:37:12,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:12,096 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 201 transitions. [2021-01-06 19:37:12,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:37:12,097 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 201 transitions. [2021-01-06 19:37:12,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 19:37:12,099 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:12,100 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:37:12,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:37:12,100 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:12,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:12,101 INFO L82 PathProgramCache]: Analyzing trace with hash -707453694, now seen corresponding path program 1 times [2021-01-06 19:37:12,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:12,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063341065] [2021-01-06 19:37:12,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:12,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063341065] [2021-01-06 19:37:12,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:12,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:37:12,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304981660] [2021-01-06 19:37:12,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:37:12,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:12,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:37:12,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:12,263 INFO L87 Difference]: Start difference. First operand 132 states and 201 transitions. Second operand 3 states. [2021-01-06 19:37:12,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:12,336 INFO L93 Difference]: Finished difference Result 273 states and 436 transitions. [2021-01-06 19:37:12,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:37:12,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2021-01-06 19:37:12,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:12,339 INFO L225 Difference]: With dead ends: 273 [2021-01-06 19:37:12,339 INFO L226 Difference]: Without dead ends: 198 [2021-01-06 19:37:12,340 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:12,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-01-06 19:37:12,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2021-01-06 19:37:12,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2021-01-06 19:37:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 302 transitions. [2021-01-06 19:37:12,377 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 302 transitions. Word has length 63 [2021-01-06 19:37:12,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:12,378 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 302 transitions. [2021-01-06 19:37:12,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:37:12,381 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 302 transitions. [2021-01-06 19:37:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 19:37:12,389 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37: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] [2021-01-06 19:37:12,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:37:12,390 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:12,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:12,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1995563601, now seen corresponding path program 1 times [2021-01-06 19:37:12,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:12,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287127578] [2021-01-06 19:37:12,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:12,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287127578] [2021-01-06 19:37:12,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:12,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:37:12,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646353470] [2021-01-06 19:37:12,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:37:12,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:12,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:37:12,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:12,591 INFO L87 Difference]: Start difference. First operand 195 states and 302 transitions. Second operand 3 states. [2021-01-06 19:37:12,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:12,651 INFO L93 Difference]: Finished difference Result 457 states and 730 transitions. [2021-01-06 19:37:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:37:12,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2021-01-06 19:37:12,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:12,662 INFO L225 Difference]: With dead ends: 457 [2021-01-06 19:37:12,663 INFO L226 Difference]: Without dead ends: 319 [2021-01-06 19:37:12,666 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:12,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-01-06 19:37:12,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2021-01-06 19:37:12,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2021-01-06 19:37:12,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 496 transitions. [2021-01-06 19:37:12,723 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 496 transitions. Word has length 65 [2021-01-06 19:37:12,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:12,723 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 496 transitions. [2021-01-06 19:37:12,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:37:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 496 transitions. [2021-01-06 19:37:12,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 19:37:12,732 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:12,733 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:37:12,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:37:12,733 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:12,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:12,738 INFO L82 PathProgramCache]: Analyzing trace with hash -2137075392, now seen corresponding path program 1 times [2021-01-06 19:37:12,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:12,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762399993] [2021-01-06 19:37:12,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:12,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762399993] [2021-01-06 19:37:12,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:12,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:37:12,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88761588] [2021-01-06 19:37:12,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:37:12,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:12,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:37:12,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:12,922 INFO L87 Difference]: Start difference. First operand 315 states and 496 transitions. Second operand 3 states. [2021-01-06 19:37:13,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:13,006 INFO L93 Difference]: Finished difference Result 803 states and 1286 transitions. [2021-01-06 19:37:13,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:37:13,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2021-01-06 19:37:13,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:13,014 INFO L225 Difference]: With dead ends: 803 [2021-01-06 19:37:13,015 INFO L226 Difference]: Without dead ends: 545 [2021-01-06 19:37:13,017 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:13,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-01-06 19:37:13,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 539. [2021-01-06 19:37:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2021-01-06 19:37:13,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 852 transitions. [2021-01-06 19:37:13,082 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 852 transitions. Word has length 67 [2021-01-06 19:37:13,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:13,083 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 852 transitions. [2021-01-06 19:37:13,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:37:13,083 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 852 transitions. [2021-01-06 19:37:13,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 19:37:13,085 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:13,085 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:37:13,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:37:13,085 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:13,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:13,086 INFO L82 PathProgramCache]: Analyzing trace with hash -544230961, now seen corresponding path program 1 times [2021-01-06 19:37:13,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:13,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488800479] [2021-01-06 19:37:13,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:13,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:13,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488800479] [2021-01-06 19:37:13,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:13,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:37:13,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620123288] [2021-01-06 19:37:13,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:37:13,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:13,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:37:13,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:37:13,349 INFO L87 Difference]: Start difference. First operand 539 states and 852 transitions. Second operand 5 states. [2021-01-06 19:37:13,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:13,640 INFO L93 Difference]: Finished difference Result 2303 states and 3746 transitions. [2021-01-06 19:37:13,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:37:13,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2021-01-06 19:37:13,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:13,653 INFO L225 Difference]: With dead ends: 2303 [2021-01-06 19:37:13,653 INFO L226 Difference]: Without dead ends: 1821 [2021-01-06 19:37:13,655 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:37:13,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2021-01-06 19:37:13,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 960. [2021-01-06 19:37:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2021-01-06 19:37:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1532 transitions. [2021-01-06 19:37:13,708 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1532 transitions. Word has length 69 [2021-01-06 19:37:13,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:13,708 INFO L481 AbstractCegarLoop]: Abstraction has 960 states and 1532 transitions. [2021-01-06 19:37:13,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:37:13,709 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1532 transitions. [2021-01-06 19:37:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 19:37:13,710 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:13,710 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:37:13,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:37:13,711 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:13,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:13,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1614123231, now seen corresponding path program 1 times [2021-01-06 19:37:13,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:13,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471265170] [2021-01-06 19:37:13,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:13,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471265170] [2021-01-06 19:37:13,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:13,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:37:13,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544193160] [2021-01-06 19:37:13,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:37:13,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:13,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:37:13,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:37:13,828 INFO L87 Difference]: Start difference. First operand 960 states and 1532 transitions. Second operand 4 states. [2021-01-06 19:37:13,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:13,960 INFO L93 Difference]: Finished difference Result 2793 states and 4533 transitions. [2021-01-06 19:37:13,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:37:13,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2021-01-06 19:37:13,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:13,974 INFO L225 Difference]: With dead ends: 2793 [2021-01-06 19:37:13,974 INFO L226 Difference]: Without dead ends: 1890 [2021-01-06 19:37:13,977 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:37:13,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2021-01-06 19:37:14,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1416. [2021-01-06 19:37:14,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2021-01-06 19:37:14,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2275 transitions. [2021-01-06 19:37:14,063 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2275 transitions. Word has length 70 [2021-01-06 19:37:14,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:14,064 INFO L481 AbstractCegarLoop]: Abstraction has 1416 states and 2275 transitions. [2021-01-06 19:37:14,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:37:14,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2275 transitions. [2021-01-06 19:37:14,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 19:37:14,067 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:14,067 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:37:14,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:37:14,067 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:14,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:14,068 INFO L82 PathProgramCache]: Analyzing trace with hash -252040890, now seen corresponding path program 1 times [2021-01-06 19:37:14,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:14,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810082480] [2021-01-06 19:37:14,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:14,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810082480] [2021-01-06 19:37:14,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:14,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:37:14,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270373711] [2021-01-06 19:37:14,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:37:14,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:14,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:37:14,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:37:14,205 INFO L87 Difference]: Start difference. First operand 1416 states and 2275 transitions. Second operand 4 states. [2021-01-06 19:37:14,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:14,370 INFO L93 Difference]: Finished difference Result 4216 states and 6836 transitions. [2021-01-06 19:37:14,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:37:14,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2021-01-06 19:37:14,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:14,386 INFO L225 Difference]: With dead ends: 4216 [2021-01-06 19:37:14,386 INFO L226 Difference]: Without dead ends: 2857 [2021-01-06 19:37:14,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:37:14,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2021-01-06 19:37:14,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2067. [2021-01-06 19:37:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2067 states. [2021-01-06 19:37:14,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 3322 transitions. [2021-01-06 19:37:14,531 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 3322 transitions. Word has length 71 [2021-01-06 19:37:14,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:14,532 INFO L481 AbstractCegarLoop]: Abstraction has 2067 states and 3322 transitions. [2021-01-06 19:37:14,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:37:14,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 3322 transitions. [2021-01-06 19:37:14,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:37:14,542 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:14,542 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:37:14,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:37:14,543 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:14,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:14,543 INFO L82 PathProgramCache]: Analyzing trace with hash -630566449, now seen corresponding path program 1 times [2021-01-06 19:37:14,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:14,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039970993] [2021-01-06 19:37:14,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:14,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:14,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039970993] [2021-01-06 19:37:14,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:14,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:37:14,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491671211] [2021-01-06 19:37:14,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:37:14,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:14,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:37:14,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:14,639 INFO L87 Difference]: Start difference. First operand 2067 states and 3322 transitions. Second operand 3 states. [2021-01-06 19:37:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:14,764 INFO L93 Difference]: Finished difference Result 4274 states and 6880 transitions. [2021-01-06 19:37:14,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:37:14,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 19:37:14,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:14,782 INFO L225 Difference]: With dead ends: 4274 [2021-01-06 19:37:14,782 INFO L226 Difference]: Without dead ends: 3076 [2021-01-06 19:37:14,787 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:14,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3076 states. [2021-01-06 19:37:14,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3076 to 3074. [2021-01-06 19:37:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3074 states. [2021-01-06 19:37:14,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 4900 transitions. [2021-01-06 19:37:14,956 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 4900 transitions. Word has length 72 [2021-01-06 19:37:14,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:14,957 INFO L481 AbstractCegarLoop]: Abstraction has 3074 states and 4900 transitions. [2021-01-06 19:37:14,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:37:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 4900 transitions. [2021-01-06 19:37:14,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:37:14,959 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:14,959 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:37:14,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:37:14,960 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:14,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:14,960 INFO L82 PathProgramCache]: Analyzing trace with hash -808156936, now seen corresponding path program 1 times [2021-01-06 19:37:14,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:14,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266531805] [2021-01-06 19:37:14,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:15,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:15,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266531805] [2021-01-06 19:37:15,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:15,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:37:15,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195796997] [2021-01-06 19:37:15,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:37:15,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:15,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:37:15,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:37:15,024 INFO L87 Difference]: Start difference. First operand 3074 states and 4900 transitions. Second operand 4 states. [2021-01-06 19:37:15,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:15,345 INFO L93 Difference]: Finished difference Result 9240 states and 14853 transitions. [2021-01-06 19:37:15,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:37:15,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-01-06 19:37:15,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:15,383 INFO L225 Difference]: With dead ends: 9240 [2021-01-06 19:37:15,383 INFO L226 Difference]: Without dead ends: 6354 [2021-01-06 19:37:15,391 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:37:15,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6354 states. [2021-01-06 19:37:15,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6354 to 4698. [2021-01-06 19:37:15,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4698 states. [2021-01-06 19:37:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4698 states to 4698 states and 7486 transitions. [2021-01-06 19:37:15,656 INFO L78 Accepts]: Start accepts. Automaton has 4698 states and 7486 transitions. Word has length 72 [2021-01-06 19:37:15,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:15,657 INFO L481 AbstractCegarLoop]: Abstraction has 4698 states and 7486 transitions. [2021-01-06 19:37:15,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:37:15,657 INFO L276 IsEmpty]: Start isEmpty. Operand 4698 states and 7486 transitions. [2021-01-06 19:37:15,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:37:15,658 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:15,658 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:37:15,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:37:15,659 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:15,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:15,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1968035874, now seen corresponding path program 1 times [2021-01-06 19:37:15,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:15,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523533478] [2021-01-06 19:37:15,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:15,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:15,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523533478] [2021-01-06 19:37:15,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:15,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:37:15,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489177476] [2021-01-06 19:37:15,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:37:15,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:15,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:37:15,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:15,753 INFO L87 Difference]: Start difference. First operand 4698 states and 7486 transitions. Second operand 3 states. [2021-01-06 19:37:15,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:15,993 INFO L93 Difference]: Finished difference Result 10286 states and 16464 transitions. [2021-01-06 19:37:15,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:37:15,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 19:37:15,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:16,071 INFO L225 Difference]: With dead ends: 10286 [2021-01-06 19:37:16,071 INFO L226 Difference]: Without dead ends: 6983 [2021-01-06 19:37:16,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:16,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6983 states. [2021-01-06 19:37:16,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6983 to 6981. [2021-01-06 19:37:16,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6981 states. [2021-01-06 19:37:16,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6981 states to 6981 states and 11071 transitions. [2021-01-06 19:37:16,539 INFO L78 Accepts]: Start accepts. Automaton has 6981 states and 11071 transitions. Word has length 72 [2021-01-06 19:37:16,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:16,539 INFO L481 AbstractCegarLoop]: Abstraction has 6981 states and 11071 transitions. [2021-01-06 19:37:16,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:37:16,539 INFO L276 IsEmpty]: Start isEmpty. Operand 6981 states and 11071 transitions. [2021-01-06 19:37:16,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:37:16,541 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:16,541 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:37:16,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:37:16,542 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:16,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:16,544 INFO L82 PathProgramCache]: Analyzing trace with hash 952039085, now seen corresponding path program 1 times [2021-01-06 19:37:16,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:16,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823098218] [2021-01-06 19:37:16,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:16,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:16,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823098218] [2021-01-06 19:37:16,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:16,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:37:16,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031881726] [2021-01-06 19:37:16,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:37:16,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:16,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:37:16,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:16,599 INFO L87 Difference]: Start difference. First operand 6981 states and 11071 transitions. Second operand 3 states. [2021-01-06 19:37:17,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:17,001 INFO L93 Difference]: Finished difference Result 15555 states and 24952 transitions. [2021-01-06 19:37:17,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:37:17,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 19:37:17,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:17,028 INFO L225 Difference]: With dead ends: 15555 [2021-01-06 19:37:17,028 INFO L226 Difference]: Without dead ends: 10468 [2021-01-06 19:37:17,040 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:17,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10468 states. [2021-01-06 19:37:17,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10468 to 10466. [2021-01-06 19:37:17,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10466 states. [2021-01-06 19:37:17,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10466 states to 10466 states and 16575 transitions. [2021-01-06 19:37:17,603 INFO L78 Accepts]: Start accepts. Automaton has 10466 states and 16575 transitions. Word has length 72 [2021-01-06 19:37:17,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:17,603 INFO L481 AbstractCegarLoop]: Abstraction has 10466 states and 16575 transitions. [2021-01-06 19:37:17,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:37:17,603 INFO L276 IsEmpty]: Start isEmpty. Operand 10466 states and 16575 transitions. [2021-01-06 19:37:17,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 19:37:17,604 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:17,604 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:37:17,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:37:17,604 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:17,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:17,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1377255792, now seen corresponding path program 1 times [2021-01-06 19:37:17,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:17,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655413474] [2021-01-06 19:37:17,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:17,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:17,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655413474] [2021-01-06 19:37:17,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:17,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:37:17,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467086995] [2021-01-06 19:37:17,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:37:17,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:17,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:37:17,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:37:17,778 INFO L87 Difference]: Start difference. First operand 10466 states and 16575 transitions. Second operand 4 states. [2021-01-06 19:37:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:18,732 INFO L93 Difference]: Finished difference Result 31026 states and 49119 transitions. [2021-01-06 19:37:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:37:18,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 19:37:18,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:18,803 INFO L225 Difference]: With dead ends: 31026 [2021-01-06 19:37:18,804 INFO L226 Difference]: Without dead ends: 20569 [2021-01-06 19:37:18,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:37:18,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20569 states. [2021-01-06 19:37:19,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20569 to 20567. [2021-01-06 19:37:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20567 states. [2021-01-06 19:37:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20567 states to 20567 states and 32332 transitions. [2021-01-06 19:37:20,006 INFO L78 Accepts]: Start accepts. Automaton has 20567 states and 32332 transitions. Word has length 74 [2021-01-06 19:37:20,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:20,006 INFO L481 AbstractCegarLoop]: Abstraction has 20567 states and 32332 transitions. [2021-01-06 19:37:20,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:37:20,006 INFO L276 IsEmpty]: Start isEmpty. Operand 20567 states and 32332 transitions. [2021-01-06 19:37:20,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 19:37:20,007 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:20,008 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:37:20,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:37:20,008 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:20,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:20,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1916429764, now seen corresponding path program 1 times [2021-01-06 19:37:20,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:20,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360602304] [2021-01-06 19:37:20,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:20,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360602304] [2021-01-06 19:37:20,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:20,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:37:20,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578839088] [2021-01-06 19:37:20,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:37:20,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:20,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:37:20,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:20,057 INFO L87 Difference]: Start difference. First operand 20567 states and 32332 transitions. Second operand 3 states. [2021-01-06 19:37:21,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:21,616 INFO L93 Difference]: Finished difference Result 61663 states and 96934 transitions. [2021-01-06 19:37:21,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:37:21,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2021-01-06 19:37:21,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:21,733 INFO L225 Difference]: With dead ends: 61663 [2021-01-06 19:37:21,734 INFO L226 Difference]: Without dead ends: 41124 [2021-01-06 19:37:21,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:21,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41124 states. [2021-01-06 19:37:23,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41124 to 20569. [2021-01-06 19:37:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20569 states. [2021-01-06 19:37:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20569 states to 20569 states and 32334 transitions. [2021-01-06 19:37:23,152 INFO L78 Accepts]: Start accepts. Automaton has 20569 states and 32334 transitions. Word has length 75 [2021-01-06 19:37:23,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:23,153 INFO L481 AbstractCegarLoop]: Abstraction has 20569 states and 32334 transitions. [2021-01-06 19:37:23,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:37:23,153 INFO L276 IsEmpty]: Start isEmpty. Operand 20569 states and 32334 transitions. [2021-01-06 19:37:23,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:37:23,154 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:23,154 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:37:23,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:37:23,155 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:23,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:23,156 INFO L82 PathProgramCache]: Analyzing trace with hash 539922453, now seen corresponding path program 1 times [2021-01-06 19:37:23,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:23,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084881352] [2021-01-06 19:37:23,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:23,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084881352] [2021-01-06 19:37:23,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:23,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:37:23,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937340604] [2021-01-06 19:37:23,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:37:23,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:23,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:37:23,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:37:23,316 INFO L87 Difference]: Start difference. First operand 20569 states and 32334 transitions. Second operand 4 states. [2021-01-06 19:37:24,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:24,946 INFO L93 Difference]: Finished difference Result 60967 states and 95802 transitions. [2021-01-06 19:37:24,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:37:24,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2021-01-06 19:37:24,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:25,037 INFO L225 Difference]: With dead ends: 60967 [2021-01-06 19:37:25,037 INFO L226 Difference]: Without dead ends: 40410 [2021-01-06 19:37:25,069 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:37:25,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40410 states. [2021-01-06 19:37:26,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40410 to 40408. [2021-01-06 19:37:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40408 states. [2021-01-06 19:37:26,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40408 states to 40408 states and 63033 transitions. [2021-01-06 19:37:26,888 INFO L78 Accepts]: Start accepts. Automaton has 40408 states and 63033 transitions. Word has length 76 [2021-01-06 19:37:26,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:26,888 INFO L481 AbstractCegarLoop]: Abstraction has 40408 states and 63033 transitions. [2021-01-06 19:37:26,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:37:26,888 INFO L276 IsEmpty]: Start isEmpty. Operand 40408 states and 63033 transitions. [2021-01-06 19:37:26,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:37:26,890 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:26,890 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:37:26,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:37:26,890 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:26,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:26,891 INFO L82 PathProgramCache]: Analyzing trace with hash 31107364, now seen corresponding path program 1 times [2021-01-06 19:37:26,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:26,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202940313] [2021-01-06 19:37:26,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:27,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202940313] [2021-01-06 19:37:27,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:27,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:37:27,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262702419] [2021-01-06 19:37:27,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:37:27,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:27,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:37:27,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:37:27,122 INFO L87 Difference]: Start difference. First operand 40408 states and 63033 transitions. Second operand 4 states. [2021-01-06 19:37:29,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:29,669 INFO L93 Difference]: Finished difference Result 119716 states and 186647 transitions. [2021-01-06 19:37:29,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:37:29,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2021-01-06 19:37:29,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:29,853 INFO L225 Difference]: With dead ends: 119716 [2021-01-06 19:37:29,853 INFO L226 Difference]: Without dead ends: 79354 [2021-01-06 19:37:29,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:37:30,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79354 states. [2021-01-06 19:37:33,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79354 to 79352. [2021-01-06 19:37:33,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79352 states. [2021-01-06 19:37:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79352 states to 79352 states and 122783 transitions. [2021-01-06 19:37:33,344 INFO L78 Accepts]: Start accepts. Automaton has 79352 states and 122783 transitions. Word has length 76 [2021-01-06 19:37:33,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:33,344 INFO L481 AbstractCegarLoop]: Abstraction has 79352 states and 122783 transitions. [2021-01-06 19:37:33,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:37:33,344 INFO L276 IsEmpty]: Start isEmpty. Operand 79352 states and 122783 transitions. [2021-01-06 19:37:33,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 19:37:33,347 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:33,348 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:37:33,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:37:33,348 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:33,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:33,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1176909096, now seen corresponding path program 1 times [2021-01-06 19:37:33,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:33,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075437171] [2021-01-06 19:37:33,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:33,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:33,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075437171] [2021-01-06 19:37:33,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:33,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:37:33,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691576178] [2021-01-06 19:37:33,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:37:33,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:33,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:37:33,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:33,390 INFO L87 Difference]: Start difference. First operand 79352 states and 122783 transitions. Second operand 3 states. [2021-01-06 19:37:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:38,482 INFO L93 Difference]: Finished difference Result 237932 states and 368157 transitions. [2021-01-06 19:37:38,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:37:38,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2021-01-06 19:37:38,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:38,762 INFO L225 Difference]: With dead ends: 237932 [2021-01-06 19:37:38,762 INFO L226 Difference]: Without dead ends: 158654 [2021-01-06 19:37:38,826 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158654 states. [2021-01-06 19:37:42,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158654 to 79360. [2021-01-06 19:37:42,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79360 states. [2021-01-06 19:37:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79360 states to 79360 states and 122791 transitions. [2021-01-06 19:37:42,905 INFO L78 Accepts]: Start accepts. Automaton has 79360 states and 122791 transitions. Word has length 77 [2021-01-06 19:37:42,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:42,905 INFO L481 AbstractCegarLoop]: Abstraction has 79360 states and 122791 transitions. [2021-01-06 19:37:42,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:37:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 79360 states and 122791 transitions. [2021-01-06 19:37:42,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:37:42,907 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:37:42,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:37:42,908 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:42,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:42,909 INFO L82 PathProgramCache]: Analyzing trace with hash 604186441, now seen corresponding path program 1 times [2021-01-06 19:37:42,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:42,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636984905] [2021-01-06 19:37:42,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:43,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:43,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636984905] [2021-01-06 19:37:43,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:43,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:37:43,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741284943] [2021-01-06 19:37:43,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:37:43,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:43,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:37:43,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:37:43,007 INFO L87 Difference]: Start difference. First operand 79360 states and 122791 transitions. Second operand 4 states. [2021-01-06 19:37:48,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:48,488 INFO L93 Difference]: Finished difference Result 235108 states and 363554 transitions. [2021-01-06 19:37:48,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:37:48,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2021-01-06 19:37:48,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:48,903 INFO L225 Difference]: With dead ends: 235108 [2021-01-06 19:37:48,903 INFO L226 Difference]: Without dead ends: 155803 [2021-01-06 19:37:48,960 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:37:49,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155803 states. [2021-01-06 19:37:55,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155803 to 155801. [2021-01-06 19:37:55,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155801 states. [2021-01-06 19:37:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155801 states to 155801 states and 239045 transitions. [2021-01-06 19:37:55,532 INFO L78 Accepts]: Start accepts. Automaton has 155801 states and 239045 transitions. Word has length 78 [2021-01-06 19:37:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:55,532 INFO L481 AbstractCegarLoop]: Abstraction has 155801 states and 239045 transitions. [2021-01-06 19:37:55,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:37:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 155801 states and 239045 transitions. [2021-01-06 19:37:55,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:37:55,535 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:55,536 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:37:55,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:37:55,536 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:55,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:55,537 INFO L82 PathProgramCache]: Analyzing trace with hash 120131000, now seen corresponding path program 1 times [2021-01-06 19:37:55,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:55,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323940892] [2021-01-06 19:37:55,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:55,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323940892] [2021-01-06 19:37:55,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:55,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:37:55,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676107812] [2021-01-06 19:37:55,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:37:55,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:55,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:37:55,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:37:55,675 INFO L87 Difference]: Start difference. First operand 155801 states and 239045 transitions. Second operand 4 states. [2021-01-06 19:38:07,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:38:07,342 INFO L93 Difference]: Finished difference Result 461429 states and 707439 transitions. [2021-01-06 19:38:07,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:38:07,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2021-01-06 19:38:07,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:38:08,150 INFO L225 Difference]: With dead ends: 461429 [2021-01-06 19:38:08,151 INFO L226 Difference]: Without dead ends: 305787 [2021-01-06 19:38:08,306 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:38:08,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305787 states. [2021-01-06 19:38:20,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305787 to 305785. [2021-01-06 19:38:20,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305785 states. [2021-01-06 19:38:21,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305785 states to 305785 states and 465045 transitions. [2021-01-06 19:38:21,677 INFO L78 Accepts]: Start accepts. Automaton has 305785 states and 465045 transitions. Word has length 78 [2021-01-06 19:38:21,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:38:21,677 INFO L481 AbstractCegarLoop]: Abstraction has 305785 states and 465045 transitions. [2021-01-06 19:38:21,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:38:21,677 INFO L276 IsEmpty]: Start isEmpty. Operand 305785 states and 465045 transitions. [2021-01-06 19:38:21,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-06 19:38:21,681 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:38:21,681 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:38:21,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:38:21,682 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:38:21,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:38:21,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1883818476, now seen corresponding path program 1 times [2021-01-06 19:38:21,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:38:21,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167128757] [2021-01-06 19:38:21,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:38:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:38:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:38:22,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167128757] [2021-01-06 19:38:22,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:38:22,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:38:22,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872837784] [2021-01-06 19:38:22,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:38:22,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:38:22,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:38:22,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:38:22,212 INFO L87 Difference]: Start difference. First operand 305785 states and 465045 transitions. Second operand 3 states. [2021-01-06 19:38:45,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:38:45,044 INFO L93 Difference]: Finished difference Result 916061 states and 1393543 transitions. [2021-01-06 19:38:45,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:38:45,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2021-01-06 19:38:45,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:38:46,369 INFO L225 Difference]: With dead ends: 916061 [2021-01-06 19:38:46,369 INFO L226 Difference]: Without dead ends: 611339 [2021-01-06 19:38:46,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:38:47,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611339 states. [2021-01-06 19:39:06,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611339 to 305817. [2021-01-06 19:39:06,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305817 states. [2021-01-06 19:39:08,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305817 states to 305817 states and 465077 transitions. [2021-01-06 19:39:08,073 INFO L78 Accepts]: Start accepts. Automaton has 305817 states and 465077 transitions. Word has length 79 [2021-01-06 19:39:08,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:39:08,074 INFO L481 AbstractCegarLoop]: Abstraction has 305817 states and 465077 transitions. [2021-01-06 19:39:08,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:39:08,074 INFO L276 IsEmpty]: Start isEmpty. Operand 305817 states and 465077 transitions. [2021-01-06 19:39:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 19:39:08,106 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:39:08,106 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:39:08,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:39:08,106 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:39:08,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:39:08,107 INFO L82 PathProgramCache]: Analyzing trace with hash 809988221, now seen corresponding path program 1 times [2021-01-06 19:39:08,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:39:08,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690966065] [2021-01-06 19:39:08,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:39:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:39:08,389 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:39:08,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690966065] [2021-01-06 19:39:08,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:39:08,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:39:08,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763043022] [2021-01-06 19:39:08,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:39:08,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:39:08,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:39:08,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:39:08,395 INFO L87 Difference]: Start difference. First operand 305817 states and 465077 transitions. Second operand 4 states. [2021-01-06 19:39:34,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:39:34,117 INFO L93 Difference]: Finished difference Result 905584 states and 1376019 transitions. [2021-01-06 19:39:34,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:39:34,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2021-01-06 19:39:34,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:39:35,659 INFO L225 Difference]: With dead ends: 905584 [2021-01-06 19:39:35,659 INFO L226 Difference]: Without dead ends: 600018 [2021-01-06 19:39:35,974 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:39:36,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600018 states. [2021-01-06 19:40:08,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600018 to 600016. [2021-01-06 19:40:08,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600016 states. [2021-01-06 19:40:10,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600016 states to 600016 states and 904133 transitions. [2021-01-06 19:40:10,600 INFO L78 Accepts]: Start accepts. Automaton has 600016 states and 904133 transitions. Word has length 80 [2021-01-06 19:40:10,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:40:10,600 INFO L481 AbstractCegarLoop]: Abstraction has 600016 states and 904133 transitions. [2021-01-06 19:40:10,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:40:10,600 INFO L276 IsEmpty]: Start isEmpty. Operand 600016 states and 904133 transitions. [2021-01-06 19:40:10,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 19:40:10,608 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:40:10,609 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:40:10,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:40:10,609 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:40:10,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:40:10,610 INFO L82 PathProgramCache]: Analyzing trace with hash -715330484, now seen corresponding path program 1 times [2021-01-06 19:40:10,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:40:10,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858042955] [2021-01-06 19:40:10,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:40:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:40:10,759 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:40:10,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858042955] [2021-01-06 19:40:10,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:40:10,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:40:10,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27045547] [2021-01-06 19:40:10,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:40:10,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:40:10,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:40:10,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:40:10,765 INFO L87 Difference]: Start difference. First operand 600016 states and 904133 transitions. Second operand 4 states. [2021-01-06 19:40:30,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:40:30,942 INFO L93 Difference]: Finished difference Result 981726 states and 1475874 transitions. [2021-01-06 19:40:30,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:40:30,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2021-01-06 19:40:30,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:40:31,917 INFO L225 Difference]: With dead ends: 981726 [2021-01-06 19:40:31,917 INFO L226 Difference]: Without dead ends: 382137 [2021-01-06 19:40:32,296 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:40:32,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382137 states.