/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 10:03:12,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 10:03:12,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 10:03:12,724 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 10:03:12,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 10:03:12,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 10:03:12,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 10:03:12,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 10:03:12,741 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 10:03:12,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 10:03:12,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 10:03:12,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 10:03:12,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 10:03:12,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 10:03:12,759 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 10:03:12,761 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 10:03:12,762 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 10:03:12,766 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 10:03:12,774 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 10:03:12,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 10:03:12,784 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 10:03:12,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 10:03:12,787 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 10:03:12,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 10:03:12,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 10:03:12,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 10:03:12,812 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 10:03:12,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 10:03:12,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 10:03:12,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 10:03:12,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 10:03:12,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 10:03:12,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 10:03:12,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 10:03:12,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 10:03:12,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 10:03:12,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 10:03:12,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 10:03:12,832 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 10:03:12,833 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 10:03:12,834 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 10:03:12,835 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 10:03:12,888 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 10:03:12,889 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 10:03:12,892 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 10:03:12,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 10:03:12,893 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 10:03:12,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 10:03:12,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 10:03:12,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 10:03:12,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 10:03:12,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 10:03:12,895 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 10:03:12,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 10:03:12,896 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 10:03:12,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 10:03:12,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 10:03:12,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 10:03:12,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 10:03:12,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 10:03:12,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 10:03:12,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 10:03:12,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 10:03:12,899 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 10:03:12,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 10:03:12,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 10:03:12,899 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 10:03:12,900 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 10:03:13,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 10:03:13,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 10:03:13,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 10:03:13,371 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 10:03:13,376 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 10:03:13,377 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2020-12-23 10:03:13,462 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8b4787141/86c512335f234f2da1c1070ecf351fc0/FLAGc53ea5838 [2020-12-23 10:03:14,160 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 10:03:14,161 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2020-12-23 10:03:14,183 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8b4787141/86c512335f234f2da1c1070ecf351fc0/FLAGc53ea5838 [2020-12-23 10:03:14,438 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8b4787141/86c512335f234f2da1c1070ecf351fc0 [2020-12-23 10:03:14,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 10:03:14,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 10:03:14,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 10:03:14,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 10:03:14,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 10:03:14,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 10:03:14" (1/1) ... [2020-12-23 10:03:14,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f0a490c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:14, skipping insertion in model container [2020-12-23 10:03:14,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 10:03:14" (1/1) ... [2020-12-23 10:03:14,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 10:03:14,527 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r121~0,] left hand side expression in assignment: lhs: VariableLHS[~r131~0,] left hand side expression in assignment: lhs: VariableLHS[~r211~0,] left hand side expression in assignment: lhs: VariableLHS[~r231~0,] left hand side expression in assignment: lhs: VariableLHS[~r311~0,] left hand side expression in assignment: lhs: VariableLHS[~r321~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~r122~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~r132~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~r212~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~r232~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~r312~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~r322~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2020-12-23 10:03:14,912 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c[14511,14524] [2020-12-23 10:03:14,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 10:03:14,928 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~0,] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~1,] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax~2,] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r121~0,] left hand side expression in assignment: lhs: VariableLHS[~r131~0,] left hand side expression in assignment: lhs: VariableLHS[~r211~0,] left hand side expression in assignment: lhs: VariableLHS[~r231~0,] left hand side expression in assignment: lhs: VariableLHS[~r311~0,] left hand side expression in assignment: lhs: VariableLHS[~r321~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~r122~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~r132~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~r212~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~r232~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~r312~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~r322~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~newmax3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2020-12-23 10:03:15,004 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c[14511,14524] [2020-12-23 10:03:15,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 10:03:15,028 INFO L208 MainTranslator]: Completed translation [2020-12-23 10:03:15,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:15 WrapperNode [2020-12-23 10:03:15,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 10:03:15,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 10:03:15,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 10:03:15,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 10:03:15,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:15" (1/1) ... [2020-12-23 10:03:15,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:15" (1/1) ... [2020-12-23 10:03:15,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 10:03:15,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 10:03:15,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 10:03:15,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 10:03:15,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:15" (1/1) ... [2020-12-23 10:03:15,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:15" (1/1) ... [2020-12-23 10:03:15,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:15" (1/1) ... [2020-12-23 10:03:15,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:15" (1/1) ... [2020-12-23 10:03:15,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:15" (1/1) ... [2020-12-23 10:03:15,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:15" (1/1) ... [2020-12-23 10:03:15,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:15" (1/1) ... [2020-12-23 10:03:15,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 10:03:15,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 10:03:15,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 10:03:15,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 10:03:15,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:15" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 10:03:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 10:03:15,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 10:03:15,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 10:03:15,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 10:03:16,513 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 10:03:16,513 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2020-12-23 10:03:16,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 10:03:16 BoogieIcfgContainer [2020-12-23 10:03:16,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 10:03:16,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 10:03:16,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 10:03:16,524 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 10:03:16,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 10:03:14" (1/3) ... [2020-12-23 10:03:16,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f455e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 10:03:16, skipping insertion in model container [2020-12-23 10:03:16,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 10:03:15" (2/3) ... [2020-12-23 10:03:16,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f455e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 10:03:16, skipping insertion in model container [2020-12-23 10:03:16,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 10:03:16" (3/3) ... [2020-12-23 10:03:16,531 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2020-12-23 10:03:16,538 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 10:03:16,543 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 10:03:16,563 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 10:03:16,590 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 10:03:16,591 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 10:03:16,591 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 10:03:16,591 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 10:03:16,591 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 10:03:16,591 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 10:03:16,592 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 10:03:16,592 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 10:03:16,611 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2020-12-23 10:03:16,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 10:03:16,621 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:16,622 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:03:16,622 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:16,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:16,629 INFO L82 PathProgramCache]: Analyzing trace with hash -812713456, now seen corresponding path program 1 times [2020-12-23 10:03:16,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:16,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636957085] [2020-12-23 10:03:16,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:16,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:03:16,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636957085] [2020-12-23 10:03:16,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:16,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 10:03:16,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313007064] [2020-12-23 10:03:16,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 10:03:16,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:16,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 10:03:16,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 10:03:16,933 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 2 states. [2020-12-23 10:03:16,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:16,969 INFO L93 Difference]: Finished difference Result 233 states and 401 transitions. [2020-12-23 10:03:16,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 10:03:16,970 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2020-12-23 10:03:16,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:16,984 INFO L225 Difference]: With dead ends: 233 [2020-12-23 10:03:16,984 INFO L226 Difference]: Without dead ends: 144 [2020-12-23 10:03:16,988 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 10:03:17,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-12-23 10:03:17,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2020-12-23 10:03:17,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-12-23 10:03:17,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 249 transitions. [2020-12-23 10:03:17,067 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 249 transitions. Word has length 37 [2020-12-23 10:03:17,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:17,068 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 249 transitions. [2020-12-23 10:03:17,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 10:03:17,068 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 249 transitions. [2020-12-23 10:03:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 10:03:17,076 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:17,076 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:03:17,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 10:03:17,078 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:17,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:17,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1630361906, now seen corresponding path program 1 times [2020-12-23 10:03:17,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:17,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363994122] [2020-12-23 10:03:17,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:17,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:03:17,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363994122] [2020-12-23 10:03:17,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:17,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 10:03:17,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326558364] [2020-12-23 10:03:17,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 10:03:17,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:17,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 10:03:17,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:03:17,343 INFO L87 Difference]: Start difference. First operand 144 states and 249 transitions. Second operand 5 states. [2020-12-23 10:03:17,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:17,462 INFO L93 Difference]: Finished difference Result 232 states and 394 transitions. [2020-12-23 10:03:17,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 10:03:17,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-12-23 10:03:17,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:17,465 INFO L225 Difference]: With dead ends: 232 [2020-12-23 10:03:17,465 INFO L226 Difference]: Without dead ends: 144 [2020-12-23 10:03:17,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 10:03:17,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-12-23 10:03:17,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2020-12-23 10:03:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-12-23 10:03:17,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 219 transitions. [2020-12-23 10:03:17,480 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 219 transitions. Word has length 37 [2020-12-23 10:03:17,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:17,480 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 219 transitions. [2020-12-23 10:03:17,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 10:03:17,481 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 219 transitions. [2020-12-23 10:03:17,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 10:03:17,483 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:17,483 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:03:17,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 10:03:17,483 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:17,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:17,485 INFO L82 PathProgramCache]: Analyzing trace with hash 190573204, now seen corresponding path program 1 times [2020-12-23 10:03:17,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:17,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161173741] [2020-12-23 10:03:17,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:17,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:03:17,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161173741] [2020-12-23 10:03:17,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:17,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:17,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046243474] [2020-12-23 10:03:17,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:17,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:17,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:17,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:17,648 INFO L87 Difference]: Start difference. First operand 144 states and 219 transitions. Second operand 3 states. [2020-12-23 10:03:17,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:17,728 INFO L93 Difference]: Finished difference Result 294 states and 469 transitions. [2020-12-23 10:03:17,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:17,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-12-23 10:03:17,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:17,732 INFO L225 Difference]: With dead ends: 294 [2020-12-23 10:03:17,732 INFO L226 Difference]: Without dead ends: 210 [2020-12-23 10:03:17,734 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:17,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-12-23 10:03:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2020-12-23 10:03:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-12-23 10:03:17,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 320 transitions. [2020-12-23 10:03:17,767 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 320 transitions. Word has length 66 [2020-12-23 10:03:17,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:17,768 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 320 transitions. [2020-12-23 10:03:17,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:17,768 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 320 transitions. [2020-12-23 10:03:17,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-23 10:03:17,771 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:17,772 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:03:17,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 10:03:17,775 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:17,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:17,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1527919177, now seen corresponding path program 1 times [2020-12-23 10:03:17,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:17,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551116687] [2020-12-23 10:03:17,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:03:17,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551116687] [2020-12-23 10:03:17,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:17,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:17,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193492482] [2020-12-23 10:03:17,921 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:17,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:17,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:17,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:17,922 INFO L87 Difference]: Start difference. First operand 207 states and 320 transitions. Second operand 3 states. [2020-12-23 10:03:17,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:17,984 INFO L93 Difference]: Finished difference Result 485 states and 776 transitions. [2020-12-23 10:03:17,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:17,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-12-23 10:03:17,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:17,987 INFO L225 Difference]: With dead ends: 485 [2020-12-23 10:03:17,987 INFO L226 Difference]: Without dead ends: 338 [2020-12-23 10:03:17,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:17,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-12-23 10:03:18,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 334. [2020-12-23 10:03:18,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-12-23 10:03:18,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 527 transitions. [2020-12-23 10:03:18,015 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 527 transitions. Word has length 68 [2020-12-23 10:03:18,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:18,015 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 527 transitions. [2020-12-23 10:03:18,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:18,016 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 527 transitions. [2020-12-23 10:03:18,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-23 10:03:18,017 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:18,017 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] [2020-12-23 10:03:18,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 10:03:18,018 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:18,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:18,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1063335298, now seen corresponding path program 1 times [2020-12-23 10:03:18,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:18,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804160066] [2020-12-23 10:03:18,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:03:18,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804160066] [2020-12-23 10:03:18,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:18,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:18,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682924670] [2020-12-23 10:03:18,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:18,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:18,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:18,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:18,202 INFO L87 Difference]: Start difference. First operand 334 states and 527 transitions. Second operand 3 states. [2020-12-23 10:03:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:18,260 INFO L93 Difference]: Finished difference Result 850 states and 1369 transitions. [2020-12-23 10:03:18,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:18,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2020-12-23 10:03:18,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:18,269 INFO L225 Difference]: With dead ends: 850 [2020-12-23 10:03:18,269 INFO L226 Difference]: Without dead ends: 576 [2020-12-23 10:03:18,271 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2020-12-23 10:03:18,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 570. [2020-12-23 10:03:18,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2020-12-23 10:03:18,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 907 transitions. [2020-12-23 10:03:18,306 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 907 transitions. Word has length 70 [2020-12-23 10:03:18,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:18,307 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 907 transitions. [2020-12-23 10:03:18,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:18,307 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 907 transitions. [2020-12-23 10:03:18,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 10:03:18,308 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:18,308 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:03:18,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 10:03:18,309 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:18,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:18,310 INFO L82 PathProgramCache]: Analyzing trace with hash 845837107, now seen corresponding path program 1 times [2020-12-23 10:03:18,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:18,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361273325] [2020-12-23 10:03:18,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:18,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:03:18,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361273325] [2020-12-23 10:03:18,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:18,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 10:03:18,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969490016] [2020-12-23 10:03:18,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 10:03:18,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:18,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 10:03:18,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:03:18,507 INFO L87 Difference]: Start difference. First operand 570 states and 907 transitions. Second operand 5 states. [2020-12-23 10:03:18,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:18,708 INFO L93 Difference]: Finished difference Result 2616 states and 4252 transitions. [2020-12-23 10:03:18,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 10:03:18,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2020-12-23 10:03:18,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:18,721 INFO L225 Difference]: With dead ends: 2616 [2020-12-23 10:03:18,721 INFO L226 Difference]: Without dead ends: 2106 [2020-12-23 10:03:18,723 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-23 10:03:18,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2020-12-23 10:03:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 1062. [2020-12-23 10:03:18,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2020-12-23 10:03:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1703 transitions. [2020-12-23 10:03:18,772 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1703 transitions. Word has length 72 [2020-12-23 10:03:18,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:18,772 INFO L481 AbstractCegarLoop]: Abstraction has 1062 states and 1703 transitions. [2020-12-23 10:03:18,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 10:03:18,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1703 transitions. [2020-12-23 10:03:18,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-23 10:03:18,774 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:18,774 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] [2020-12-23 10:03:18,775 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 10:03:18,775 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:18,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:18,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1471686026, now seen corresponding path program 1 times [2020-12-23 10:03:18,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:18,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315337720] [2020-12-23 10:03:18,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:18,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:03:18,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315337720] [2020-12-23 10:03:18,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:18,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:03:18,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379292360] [2020-12-23 10:03:18,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:03:18,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:18,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:03:18,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:03:18,848 INFO L87 Difference]: Start difference. First operand 1062 states and 1703 transitions. Second operand 4 states. [2020-12-23 10:03:18,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:18,996 INFO L93 Difference]: Finished difference Result 3858 states and 6242 transitions. [2020-12-23 10:03:18,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:03:18,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-12-23 10:03:18,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:19,012 INFO L225 Difference]: With dead ends: 3858 [2020-12-23 10:03:19,013 INFO L226 Difference]: Without dead ends: 2856 [2020-12-23 10:03:19,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:03:19,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2020-12-23 10:03:19,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 1950. [2020-12-23 10:03:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2020-12-23 10:03:19,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 3131 transitions. [2020-12-23 10:03:19,101 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 3131 transitions. Word has length 73 [2020-12-23 10:03:19,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:19,103 INFO L481 AbstractCegarLoop]: Abstraction has 1950 states and 3131 transitions. [2020-12-23 10:03:19,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:03:19,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 3131 transitions. [2020-12-23 10:03:19,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-23 10:03:19,107 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:19,107 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] [2020-12-23 10:03:19,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 10:03:19,108 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:19,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:19,108 INFO L82 PathProgramCache]: Analyzing trace with hash -131454774, now seen corresponding path program 1 times [2020-12-23 10:03:19,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:19,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087194887] [2020-12-23 10:03:19,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:03:19,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087194887] [2020-12-23 10:03:19,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:19,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:03:19,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989213307] [2020-12-23 10:03:19,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:03:19,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:19,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:03:19,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:03:19,180 INFO L87 Difference]: Start difference. First operand 1950 states and 3131 transitions. Second operand 4 states. [2020-12-23 10:03:19,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:19,356 INFO L93 Difference]: Finished difference Result 5736 states and 9278 transitions. [2020-12-23 10:03:19,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:03:19,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-12-23 10:03:19,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:19,377 INFO L225 Difference]: With dead ends: 5736 [2020-12-23 10:03:19,378 INFO L226 Difference]: Without dead ends: 3846 [2020-12-23 10:03:19,382 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:03:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3846 states. [2020-12-23 10:03:19,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3846 to 2882. [2020-12-23 10:03:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2882 states. [2020-12-23 10:03:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 4621 transitions. [2020-12-23 10:03:19,526 INFO L78 Accepts]: Start accepts. Automaton has 2882 states and 4621 transitions. Word has length 74 [2020-12-23 10:03:19,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:19,527 INFO L481 AbstractCegarLoop]: Abstraction has 2882 states and 4621 transitions. [2020-12-23 10:03:19,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:03:19,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2882 states and 4621 transitions. [2020-12-23 10:03:19,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 10:03:19,529 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:19,529 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] [2020-12-23 10:03:19,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 10:03:19,530 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:19,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:19,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1364954579, now seen corresponding path program 1 times [2020-12-23 10:03:19,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:19,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36410603] [2020-12-23 10:03:19,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:03:19,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36410603] [2020-12-23 10:03:19,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:19,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:03:19,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61984062] [2020-12-23 10:03:19,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:03:19,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:19,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:03:19,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:03:19,623 INFO L87 Difference]: Start difference. First operand 2882 states and 4621 transitions. Second operand 4 states. [2020-12-23 10:03:19,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:19,871 INFO L93 Difference]: Finished difference Result 8448 states and 13626 transitions. [2020-12-23 10:03:19,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:03:19,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-12-23 10:03:19,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:19,899 INFO L225 Difference]: With dead ends: 8448 [2020-12-23 10:03:19,899 INFO L226 Difference]: Without dead ends: 5626 [2020-12-23 10:03:19,904 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:03:19,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5626 states. [2020-12-23 10:03:20,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5626 to 4232. [2020-12-23 10:03:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4232 states. [2020-12-23 10:03:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4232 states to 4232 states and 6771 transitions. [2020-12-23 10:03:20,081 INFO L78 Accepts]: Start accepts. Automaton has 4232 states and 6771 transitions. Word has length 75 [2020-12-23 10:03:20,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:20,082 INFO L481 AbstractCegarLoop]: Abstraction has 4232 states and 6771 transitions. [2020-12-23 10:03:20,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:03:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 4232 states and 6771 transitions. [2020-12-23 10:03:20,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 10:03:20,084 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:20,084 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] [2020-12-23 10:03:20,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 10:03:20,085 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:20,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:20,085 INFO L82 PathProgramCache]: Analyzing trace with hash 915332421, now seen corresponding path program 1 times [2020-12-23 10:03:20,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:20,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898032886] [2020-12-23 10:03:20,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:20,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:03:20,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898032886] [2020-12-23 10:03:20,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:20,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:20,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096092112] [2020-12-23 10:03:20,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:20,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:20,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:20,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:20,139 INFO L87 Difference]: Start difference. First operand 4232 states and 6771 transitions. Second operand 3 states. [2020-12-23 10:03:20,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:20,371 INFO L93 Difference]: Finished difference Result 9496 states and 15200 transitions. [2020-12-23 10:03:20,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:20,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2020-12-23 10:03:20,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:20,409 INFO L225 Difference]: With dead ends: 9496 [2020-12-23 10:03:20,409 INFO L226 Difference]: Without dead ends: 6500 [2020-12-23 10:03:20,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:20,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6500 states. [2020-12-23 10:03:20,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6500 to 6498. [2020-12-23 10:03:20,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6498 states. [2020-12-23 10:03:20,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6498 states to 6498 states and 10304 transitions. [2020-12-23 10:03:20,681 INFO L78 Accepts]: Start accepts. Automaton has 6498 states and 10304 transitions. Word has length 76 [2020-12-23 10:03:20,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:20,682 INFO L481 AbstractCegarLoop]: Abstraction has 6498 states and 10304 transitions. [2020-12-23 10:03:20,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:20,682 INFO L276 IsEmpty]: Start isEmpty. Operand 6498 states and 10304 transitions. [2020-12-23 10:03:20,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 10:03:20,683 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:20,683 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] [2020-12-23 10:03:20,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 10:03:20,684 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:20,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:20,684 INFO L82 PathProgramCache]: Analyzing trace with hash -318395451, now seen corresponding path program 1 times [2020-12-23 10:03:20,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:20,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170559977] [2020-12-23 10:03:20,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:20,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:03:20,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170559977] [2020-12-23 10:03:20,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:20,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:20,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719720830] [2020-12-23 10:03:20,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:20,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:20,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:20,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:20,807 INFO L87 Difference]: Start difference. First operand 6498 states and 10304 transitions. Second operand 3 states. [2020-12-23 10:03:21,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:21,084 INFO L93 Difference]: Finished difference Result 14068 states and 22346 transitions. [2020-12-23 10:03:21,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:21,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2020-12-23 10:03:21,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:21,134 INFO L225 Difference]: With dead ends: 14068 [2020-12-23 10:03:21,134 INFO L226 Difference]: Without dead ends: 9494 [2020-12-23 10:03:21,144 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:21,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9494 states. [2020-12-23 10:03:21,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9494 to 9492. [2020-12-23 10:03:21,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9492 states. [2020-12-23 10:03:21,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9492 states to 9492 states and 14932 transitions. [2020-12-23 10:03:21,558 INFO L78 Accepts]: Start accepts. Automaton has 9492 states and 14932 transitions. Word has length 76 [2020-12-23 10:03:21,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:21,558 INFO L481 AbstractCegarLoop]: Abstraction has 9492 states and 14932 transitions. [2020-12-23 10:03:21,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:21,558 INFO L276 IsEmpty]: Start isEmpty. Operand 9492 states and 14932 transitions. [2020-12-23 10:03:21,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 10:03:21,559 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:21,559 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] [2020-12-23 10:03:21,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 10:03:21,560 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:21,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:21,560 INFO L82 PathProgramCache]: Analyzing trace with hash 700947013, now seen corresponding path program 1 times [2020-12-23 10:03:21,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:21,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145964935] [2020-12-23 10:03:21,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:21,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:03:21,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145964935] [2020-12-23 10:03:21,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:21,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:21,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477476357] [2020-12-23 10:03:21,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:21,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:21,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:21,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:21,628 INFO L87 Difference]: Start difference. First operand 9492 states and 14932 transitions. Second operand 3 states. [2020-12-23 10:03:22,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:22,101 INFO L93 Difference]: Finished difference Result 22668 states and 35837 transitions. [2020-12-23 10:03:22,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:22,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2020-12-23 10:03:22,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:22,133 INFO L225 Difference]: With dead ends: 22668 [2020-12-23 10:03:22,133 INFO L226 Difference]: Without dead ends: 13262 [2020-12-23 10:03:22,146 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13262 states. [2020-12-23 10:03:22,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13262 to 13260. [2020-12-23 10:03:22,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13260 states. [2020-12-23 10:03:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13260 states to 13260 states and 20929 transitions. [2020-12-23 10:03:22,795 INFO L78 Accepts]: Start accepts. Automaton has 13260 states and 20929 transitions. Word has length 76 [2020-12-23 10:03:22,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:22,795 INFO L481 AbstractCegarLoop]: Abstraction has 13260 states and 20929 transitions. [2020-12-23 10:03:22,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:22,796 INFO L276 IsEmpty]: Start isEmpty. Operand 13260 states and 20929 transitions. [2020-12-23 10:03:22,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-23 10:03:22,796 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:22,797 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] [2020-12-23 10:03:22,797 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 10:03:22,798 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:22,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:22,799 INFO L82 PathProgramCache]: Analyzing trace with hash 411123109, now seen corresponding path program 1 times [2020-12-23 10:03:22,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:22,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229438270] [2020-12-23 10:03:22,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:03:22,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229438270] [2020-12-23 10:03:22,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:22,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:03:22,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174384012] [2020-12-23 10:03:22,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:03:22,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:22,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:03:22,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:03:22,971 INFO L87 Difference]: Start difference. First operand 13260 states and 20929 transitions. Second operand 4 states. [2020-12-23 10:03:23,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:23,922 INFO L93 Difference]: Finished difference Result 39378 states and 62080 transitions. [2020-12-23 10:03:23,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:03:23,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-12-23 10:03:23,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:23,987 INFO L225 Difference]: With dead ends: 39378 [2020-12-23 10:03:23,988 INFO L226 Difference]: Without dead ends: 26127 [2020-12-23 10:03:24,009 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 [2020-12-23 10:03:24,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26127 states. [2020-12-23 10:03:25,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26127 to 26125. [2020-12-23 10:03:25,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26125 states. [2020-12-23 10:03:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26125 states to 26125 states and 40960 transitions. [2020-12-23 10:03:25,536 INFO L78 Accepts]: Start accepts. Automaton has 26125 states and 40960 transitions. Word has length 77 [2020-12-23 10:03:25,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:25,536 INFO L481 AbstractCegarLoop]: Abstraction has 26125 states and 40960 transitions. [2020-12-23 10:03:25,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:03:25,536 INFO L276 IsEmpty]: Start isEmpty. Operand 26125 states and 40960 transitions. [2020-12-23 10:03:25,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 10:03:25,538 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:25,538 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] [2020-12-23 10:03:25,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 10:03:25,538 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:25,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:25,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1502774817, now seen corresponding path program 1 times [2020-12-23 10:03:25,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:25,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987881088] [2020-12-23 10:03:25,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:03:25,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987881088] [2020-12-23 10:03:25,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:25,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:25,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587587953] [2020-12-23 10:03:25,588 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:25,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:25,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:25,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:25,589 INFO L87 Difference]: Start difference. First operand 26125 states and 40960 transitions. Second operand 3 states. [2020-12-23 10:03:27,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:27,111 INFO L93 Difference]: Finished difference Result 61313 states and 95762 transitions. [2020-12-23 10:03:27,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:27,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2020-12-23 10:03:27,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:27,202 INFO L225 Difference]: With dead ends: 61313 [2020-12-23 10:03:27,202 INFO L226 Difference]: Without dead ends: 35317 [2020-12-23 10:03:27,235 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:27,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35317 states. [2020-12-23 10:03:28,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35317 to 34041. [2020-12-23 10:03:28,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34041 states. [2020-12-23 10:03:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34041 states to 34041 states and 52688 transitions. [2020-12-23 10:03:28,928 INFO L78 Accepts]: Start accepts. Automaton has 34041 states and 52688 transitions. Word has length 78 [2020-12-23 10:03:28,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:28,928 INFO L481 AbstractCegarLoop]: Abstraction has 34041 states and 52688 transitions. [2020-12-23 10:03:28,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:28,928 INFO L276 IsEmpty]: Start isEmpty. Operand 34041 states and 52688 transitions. [2020-12-23 10:03:28,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 10:03:28,930 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:28,930 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] [2020-12-23 10:03:28,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 10:03:28,930 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:28,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:28,931 INFO L82 PathProgramCache]: Analyzing trace with hash -225322511, now seen corresponding path program 1 times [2020-12-23 10:03:28,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:28,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470783704] [2020-12-23 10:03:28,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:28,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:03:28,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470783704] [2020-12-23 10:03:28,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:28,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:28,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710848618] [2020-12-23 10:03:28,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:28,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:28,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:28,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:28,971 INFO L87 Difference]: Start difference. First operand 34041 states and 52688 transitions. Second operand 3 states. [2020-12-23 10:03:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:31,127 INFO L93 Difference]: Finished difference Result 102085 states and 158002 transitions. [2020-12-23 10:03:31,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:31,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2020-12-23 10:03:31,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:31,330 INFO L225 Difference]: With dead ends: 102085 [2020-12-23 10:03:31,330 INFO L226 Difference]: Without dead ends: 68072 [2020-12-23 10:03:31,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:31,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68072 states. [2020-12-23 10:03:32,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68072 to 34043. [2020-12-23 10:03:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34043 states. [2020-12-23 10:03:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34043 states to 34043 states and 52690 transitions. [2020-12-23 10:03:32,862 INFO L78 Accepts]: Start accepts. Automaton has 34043 states and 52690 transitions. Word has length 78 [2020-12-23 10:03:32,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:32,862 INFO L481 AbstractCegarLoop]: Abstraction has 34043 states and 52690 transitions. [2020-12-23 10:03:32,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:32,862 INFO L276 IsEmpty]: Start isEmpty. Operand 34043 states and 52690 transitions. [2020-12-23 10:03:32,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-23 10:03:32,863 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:32,864 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] [2020-12-23 10:03:32,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 10:03:32,864 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:32,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:32,865 INFO L82 PathProgramCache]: Analyzing trace with hash -577611119, now seen corresponding path program 1 times [2020-12-23 10:03:32,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:32,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460147511] [2020-12-23 10:03:32,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:32,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:03:32,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460147511] [2020-12-23 10:03:32,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:32,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:03:32,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241894382] [2020-12-23 10:03:32,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:03:32,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:32,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:03:32,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:03:32,956 INFO L87 Difference]: Start difference. First operand 34043 states and 52690 transitions. Second operand 4 states. [2020-12-23 10:03:34,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:34,940 INFO L93 Difference]: Finished difference Result 100591 states and 155448 transitions. [2020-12-23 10:03:34,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:03:34,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2020-12-23 10:03:34,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:35,071 INFO L225 Difference]: With dead ends: 100591 [2020-12-23 10:03:35,071 INFO L226 Difference]: Without dead ends: 66578 [2020-12-23 10:03:35,117 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 [2020-12-23 10:03:35,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66578 states. [2020-12-23 10:03:37,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66578 to 66576. [2020-12-23 10:03:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66576 states. [2020-12-23 10:03:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66576 states to 66576 states and 102186 transitions. [2020-12-23 10:03:37,629 INFO L78 Accepts]: Start accepts. Automaton has 66576 states and 102186 transitions. Word has length 79 [2020-12-23 10:03:37,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:37,629 INFO L481 AbstractCegarLoop]: Abstraction has 66576 states and 102186 transitions. [2020-12-23 10:03:37,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:03:37,629 INFO L276 IsEmpty]: Start isEmpty. Operand 66576 states and 102186 transitions. [2020-12-23 10:03:37,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 10:03:37,631 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:37,631 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:03:37,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 10:03:37,631 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:37,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:37,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1003564987, now seen corresponding path program 1 times [2020-12-23 10:03:37,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:37,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371357788] [2020-12-23 10:03:37,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:37,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:03:37,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371357788] [2020-12-23 10:03:37,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:37,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:37,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376959679] [2020-12-23 10:03:37,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:37,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:37,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:37,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:37,700 INFO L87 Difference]: Start difference. First operand 66576 states and 102186 transitions. Second operand 3 states. [2020-12-23 10:03:40,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:40,929 INFO L93 Difference]: Finished difference Result 161640 states and 249118 transitions. [2020-12-23 10:03:40,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:40,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-12-23 10:03:40,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:41,213 INFO L225 Difference]: With dead ends: 161640 [2020-12-23 10:03:41,214 INFO L226 Difference]: Without dead ends: 95344 [2020-12-23 10:03:41,267 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:41,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95344 states. [2020-12-23 10:03:44,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95344 to 91494. [2020-12-23 10:03:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91494 states. [2020-12-23 10:03:44,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91494 states to 91494 states and 139758 transitions. [2020-12-23 10:03:44,798 INFO L78 Accepts]: Start accepts. Automaton has 91494 states and 139758 transitions. Word has length 80 [2020-12-23 10:03:44,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:44,798 INFO L481 AbstractCegarLoop]: Abstraction has 91494 states and 139758 transitions. [2020-12-23 10:03:44,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:44,798 INFO L276 IsEmpty]: Start isEmpty. Operand 91494 states and 139758 transitions. [2020-12-23 10:03:44,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 10:03:44,800 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:44,802 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] [2020-12-23 10:03:44,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 10:03:44,802 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:44,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:44,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1064997795, now seen corresponding path program 1 times [2020-12-23 10:03:44,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:44,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233329718] [2020-12-23 10:03:44,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:03:44,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233329718] [2020-12-23 10:03:44,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:44,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:03:44,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681474395] [2020-12-23 10:03:44,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:03:44,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:44,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:03:44,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:44,857 INFO L87 Difference]: Start difference. First operand 91494 states and 139758 transitions. Second operand 3 states. [2020-12-23 10:03:50,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:03:50,282 INFO L93 Difference]: Finished difference Result 274406 states and 419154 transitions. [2020-12-23 10:03:50,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:03:50,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-12-23 10:03:50,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:03:50,619 INFO L225 Difference]: With dead ends: 274406 [2020-12-23 10:03:50,620 INFO L226 Difference]: Without dead ends: 182956 [2020-12-23 10:03:50,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:03:50,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182956 states. [2020-12-23 10:03:54,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182956 to 91498. [2020-12-23 10:03:54,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91498 states. [2020-12-23 10:03:54,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91498 states to 91498 states and 139762 transitions. [2020-12-23 10:03:54,898 INFO L78 Accepts]: Start accepts. Automaton has 91498 states and 139762 transitions. Word has length 80 [2020-12-23 10:03:54,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:03:54,898 INFO L481 AbstractCegarLoop]: Abstraction has 91498 states and 139762 transitions. [2020-12-23 10:03:54,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:03:54,898 INFO L276 IsEmpty]: Start isEmpty. Operand 91498 states and 139762 transitions. [2020-12-23 10:03:54,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 10:03:54,899 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:03:54,899 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:03:54,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 10:03:54,900 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:03:54,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:03:54,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1530707325, now seen corresponding path program 1 times [2020-12-23 10:03:54,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:03:54,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972650808] [2020-12-23 10:03:54,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:03:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:03:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:03:54,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972650808] [2020-12-23 10:03:54,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:03:54,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:03:54,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783841506] [2020-12-23 10:03:54,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:03:54,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:03:54,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:03:54,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:03:54,990 INFO L87 Difference]: Start difference. First operand 91498 states and 139762 transitions. Second operand 4 states. [2020-12-23 10:04:00,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:04:00,903 INFO L93 Difference]: Finished difference Result 270242 states and 412042 transitions. [2020-12-23 10:04:00,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:04:00,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2020-12-23 10:04:00,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:04:01,356 INFO L225 Difference]: With dead ends: 270242 [2020-12-23 10:04:01,357 INFO L226 Difference]: Without dead ends: 178792 [2020-12-23 10:04:01,422 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 [2020-12-23 10:04:01,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178792 states. [2020-12-23 10:04:08,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178792 to 178790. [2020-12-23 10:04:08,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178790 states. [2020-12-23 10:04:08,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178790 states to 178790 states and 270616 transitions. [2020-12-23 10:04:08,704 INFO L78 Accepts]: Start accepts. Automaton has 178790 states and 270616 transitions. Word has length 81 [2020-12-23 10:04:08,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:04:08,704 INFO L481 AbstractCegarLoop]: Abstraction has 178790 states and 270616 transitions. [2020-12-23 10:04:08,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:04:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 178790 states and 270616 transitions. [2020-12-23 10:04:08,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-23 10:04:08,707 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:04:08,707 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:04:08,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 10:04:08,707 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:04:08,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:04:08,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1063976855, now seen corresponding path program 1 times [2020-12-23 10:04:08,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:04:08,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394571163] [2020-12-23 10:04:08,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:04:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:04:08,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:04:08,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394571163] [2020-12-23 10:04:08,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:04:08,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:04:08,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37187626] [2020-12-23 10:04:08,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:04:08,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:04:08,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:04:08,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:04:08,761 INFO L87 Difference]: Start difference. First operand 178790 states and 270616 transitions. Second operand 3 states. [2020-12-23 10:04:17,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:04:17,685 INFO L93 Difference]: Finished difference Result 435034 states and 662106 transitions. [2020-12-23 10:04:17,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:04:17,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2020-12-23 10:04:17,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:04:18,176 INFO L225 Difference]: With dead ends: 435034 [2020-12-23 10:04:18,176 INFO L226 Difference]: Without dead ends: 256808 [2020-12-23 10:04:18,325 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:04:18,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256808 states. [2020-12-23 10:04:28,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256808 to 245158. [2020-12-23 10:04:28,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245158 states. [2020-12-23 10:04:29,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245158 states to 245158 states and 368536 transitions. [2020-12-23 10:04:29,143 INFO L78 Accepts]: Start accepts. Automaton has 245158 states and 368536 transitions. Word has length 82 [2020-12-23 10:04:29,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:04:29,144 INFO L481 AbstractCegarLoop]: Abstraction has 245158 states and 368536 transitions. [2020-12-23 10:04:29,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:04:29,144 INFO L276 IsEmpty]: Start isEmpty. Operand 245158 states and 368536 transitions. [2020-12-23 10:04:29,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-23 10:04:29,145 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:04:29,145 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:04:29,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 10:04:29,146 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:04:29,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:04:29,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1085594423, now seen corresponding path program 1 times [2020-12-23 10:04:29,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:04:29,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706833409] [2020-12-23 10:04:29,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:04:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:04:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:04:29,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706833409] [2020-12-23 10:04:29,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:04:29,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:04:29,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865059993] [2020-12-23 10:04:29,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:04:29,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:04:29,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:04:29,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:04:29,587 INFO L87 Difference]: Start difference. First operand 245158 states and 368536 transitions. Second operand 3 states. [2020-12-23 10:04:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:04:46,319 INFO L93 Difference]: Finished difference Result 735050 states and 1105062 transitions. [2020-12-23 10:04:46,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 10:04:46,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2020-12-23 10:04:46,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:04:47,334 INFO L225 Difference]: With dead ends: 735050 [2020-12-23 10:04:47,334 INFO L226 Difference]: Without dead ends: 490224 [2020-12-23 10:04:47,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:04:47,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490224 states. [2020-12-23 10:05:02,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490224 to 245166. [2020-12-23 10:05:02,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245166 states. [2020-12-23 10:05:03,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245166 states to 245166 states and 368544 transitions. [2020-12-23 10:05:03,934 INFO L78 Accepts]: Start accepts. Automaton has 245166 states and 368544 transitions. Word has length 82 [2020-12-23 10:05:03,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:05:03,934 INFO L481 AbstractCegarLoop]: Abstraction has 245166 states and 368544 transitions. [2020-12-23 10:05:03,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 10:05:03,935 INFO L276 IsEmpty]: Start isEmpty. Operand 245166 states and 368544 transitions. [2020-12-23 10:05:03,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 10:05:03,955 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:05:03,956 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:05:03,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 10:05:03,959 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:05:03,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:05:03,959 INFO L82 PathProgramCache]: Analyzing trace with hash 762927108, now seen corresponding path program 1 times [2020-12-23 10:05:03,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:05:03,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56918641] [2020-12-23 10:05:03,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:05:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:05:04,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:05:04,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56918641] [2020-12-23 10:05:04,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:05:04,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 10:05:04,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865943623] [2020-12-23 10:05:04,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 10:05:04,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:05:04,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 10:05:04,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:05:04,193 INFO L87 Difference]: Start difference. First operand 245166 states and 368544 transitions. Second operand 5 states. [2020-12-23 10:05:22,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:05:22,331 INFO L93 Difference]: Finished difference Result 693152 states and 1040937 transitions. [2020-12-23 10:05:22,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:05:22,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2020-12-23 10:05:22,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:05:23,289 INFO L225 Difference]: With dead ends: 693152 [2020-12-23 10:05:23,289 INFO L226 Difference]: Without dead ends: 448074 [2020-12-23 10:05:23,505 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 10:05:23,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448074 states. [2020-12-23 10:05:43,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448074 to 448072. [2020-12-23 10:05:43,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448072 states. [2020-12-23 10:05:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448072 states to 448072 states and 666753 transitions. [2020-12-23 10:05:45,282 INFO L78 Accepts]: Start accepts. Automaton has 448072 states and 666753 transitions. Word has length 83 [2020-12-23 10:05:45,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:05:45,282 INFO L481 AbstractCegarLoop]: Abstraction has 448072 states and 666753 transitions. [2020-12-23 10:05:45,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 10:05:45,283 INFO L276 IsEmpty]: Start isEmpty. Operand 448072 states and 666753 transitions. [2020-12-23 10:05:45,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 10:05:45,286 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:05:45,286 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:05:45,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 10:05:45,287 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:05:45,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:05:45,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1633117801, now seen corresponding path program 1 times [2020-12-23 10:05:45,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:05:45,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936866149] [2020-12-23 10:05:45,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:05:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:05:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:05:45,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936866149] [2020-12-23 10:05:45,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:05:45,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:05:45,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007598259] [2020-12-23 10:05:45,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:05:45,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:05:45,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:05:45,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:05:45,452 INFO L87 Difference]: Start difference. First operand 448072 states and 666753 transitions. Second operand 4 states. [2020-12-23 10:06:04,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:06:04,053 INFO L93 Difference]: Finished difference Result 796198 states and 1182987 transitions. [2020-12-23 10:06:04,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 10:06:04,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2020-12-23 10:06:04,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:06:05,009 INFO L225 Difference]: With dead ends: 796198 [2020-12-23 10:06:05,009 INFO L226 Difference]: Without dead ends: 348200 [2020-12-23 10:06:05,303 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 [2020-12-23 10:06:05,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348200 states. [2020-12-23 10:06:21,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348200 to 348200. [2020-12-23 10:06:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348200 states. [2020-12-23 10:06:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348200 states to 348200 states and 516337 transitions. [2020-12-23 10:06:21,989 INFO L78 Accepts]: Start accepts. Automaton has 348200 states and 516337 transitions. Word has length 83 [2020-12-23 10:06:21,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:06:21,989 INFO L481 AbstractCegarLoop]: Abstraction has 348200 states and 516337 transitions. [2020-12-23 10:06:21,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 10:06:21,989 INFO L276 IsEmpty]: Start isEmpty. Operand 348200 states and 516337 transitions. [2020-12-23 10:06:22,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 10:06:22,002 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:06:22,003 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 10:06:22,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 10:06:22,003 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:06:22,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:06:22,004 INFO L82 PathProgramCache]: Analyzing trace with hash 960344718, now seen corresponding path program 1 times [2020-12-23 10:06:22,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:06:22,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617218875] [2020-12-23 10:06:22,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:06:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:06:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:06:22,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617218875] [2020-12-23 10:06:22,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:06:22,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 10:06:22,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952114237] [2020-12-23 10:06:22,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 10:06:22,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:06:22,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 10:06:22,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 10:06:22,624 INFO L87 Difference]: Start difference. First operand 348200 states and 516337 transitions. Second operand 4 states.