/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:35:47,759 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:35:47,762 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:35:47,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:35:47,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:35:47,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:35:47,805 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:35:47,807 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:35:47,809 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:35:47,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:35:47,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:35:47,813 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:35:47,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:35:47,815 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:35:47,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:35:47,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:35:47,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:35:47,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:35:47,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:35:47,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:35:47,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:35:47,839 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:35:47,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:35:47,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:35:47,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:35:47,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:35:47,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:35:47,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:35:47,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:35:47,857 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:35:47,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:35:47,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:35:47,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:35:47,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:35:47,864 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:35:47,865 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:35:47,866 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:35:47,866 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:35:47,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:35:47,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:35:47,869 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:35:47,874 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:35:47,928 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:35:47,929 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:35:47,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:35:47,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:35:47,933 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:35:47,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:35:47,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:35:47,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:35:47,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:35:47,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:35:47,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:35:47,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:35:47,936 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:35:47,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:35:47,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:35:47,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:35:47,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:35:47,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:35:47,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:35:47,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:35:47,937 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:35:47,938 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:35:47,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:35:47,938 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:35:47,938 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:35:47,938 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 19:35:48,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:35:48,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:35:48,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:35:48,423 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:35:48,424 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:35:48,425 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c [2021-01-06 19:35:48,516 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/170f05663/c718d3fc9c844d289584a78ae0ec6288/FLAG79a1464f0 [2021-01-06 19:35:49,174 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:35:49,177 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c [2021-01-06 19:35:49,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/170f05663/c718d3fc9c844d289584a78ae0ec6288/FLAG79a1464f0 [2021-01-06 19:35:49,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/170f05663/c718d3fc9c844d289584a78ae0ec6288 [2021-01-06 19:35:49,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:35:49,505 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:35:49,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:35:49,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:35:49,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:35:49,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:35:49" (1/1) ... [2021-01-06 19:35:49,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dd41cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:35:49, skipping insertion in model container [2021-01-06 19:35:49,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:35:49" (1/1) ... [2021-01-06 19:35:49,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:35:49,558 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r121~0,] left hand side expression in assignment: lhs: VariableLHS[~r131~0,] left hand side expression in assignment: lhs: VariableLHS[~r211~0,] left hand side expression in assignment: lhs: VariableLHS[~r231~0,] left hand side expression in assignment: lhs: VariableLHS[~r311~0,] left hand side expression in assignment: lhs: VariableLHS[~r321~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~r122~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~r132~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~r212~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~r232~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~r312~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~r322~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2021-01-06 19:35:49,831 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c[12764,12777] [2021-01-06 19:35:49,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:35:49,868 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r121~0,] left hand side expression in assignment: lhs: VariableLHS[~r131~0,] left hand side expression in assignment: lhs: VariableLHS[~r211~0,] left hand side expression in assignment: lhs: VariableLHS[~r231~0,] left hand side expression in assignment: lhs: VariableLHS[~r311~0,] left hand side expression in assignment: lhs: VariableLHS[~r321~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~r122~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~r132~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~r212~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~r232~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~r312~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~r322~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~ep12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep23~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep31~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ep32~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nl3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~max3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p12_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p12_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p13_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p21_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p23_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p31_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p32_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2021-01-06 19:35:49,965 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c[12764,12777] [2021-01-06 19:35:49,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:35:49,987 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:35:49,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:35:49 WrapperNode [2021-01-06 19:35:49,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:35:49,989 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:35:49,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:35:49,989 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:35:50,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:35:49" (1/1) ... [2021-01-06 19:35:50,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:35:49" (1/1) ... [2021-01-06 19:35:50,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:35:50,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:35:50,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:35:50,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:35:50,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:35:49" (1/1) ... [2021-01-06 19:35:50,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:35:49" (1/1) ... [2021-01-06 19:35:50,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:35:49" (1/1) ... [2021-01-06 19:35:50,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:35:49" (1/1) ... [2021-01-06 19:35:50,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:35:49" (1/1) ... [2021-01-06 19:35:50,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:35:49" (1/1) ... [2021-01-06 19:35:50,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:35:49" (1/1) ... [2021-01-06 19:35:50,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:35:50,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:35:50,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:35:50,112 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:35:50,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:35:49" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:35:50,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:35:50,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:35:50,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:35:50,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:35:51,075 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:35:51,076 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-01-06 19:35:51,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:35:51 BoogieIcfgContainer [2021-01-06 19:35:51,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:35:51,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:35:51,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:35:51,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:35:51,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:35:49" (1/3) ... [2021-01-06 19:35:51,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65624ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:35:51, skipping insertion in model container [2021-01-06 19:35:51,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:35:49" (2/3) ... [2021-01-06 19:35:51,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65624ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:35:51, skipping insertion in model container [2021-01-06 19:35:51,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:35:51" (3/3) ... [2021-01-06 19:35:51,088 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c [2021-01-06 19:35:51,094 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:35:51,100 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:35:51,120 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:35:51,148 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:35:51,149 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:35:51,149 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:35:51,149 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:35:51,149 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:35:51,149 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:35:51,150 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:35:51,150 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:35:51,170 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2021-01-06 19:35:51,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:35:51,180 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:51,181 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:35:51,181 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:35:51,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:51,188 INFO L82 PathProgramCache]: Analyzing trace with hash -306716250, now seen corresponding path program 1 times [2021-01-06 19:35:51,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:51,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274410988] [2021-01-06 19:35:51,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:35:51,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274410988] [2021-01-06 19:35:51,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:35:51,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:35:51,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522511333] [2021-01-06 19:35:51,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 19:35:51,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:51,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 19:35:51,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:35:51,582 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 2 states. [2021-01-06 19:35:51,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:51,640 INFO L93 Difference]: Finished difference Result 206 states and 352 transitions. [2021-01-06 19:35:51,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 19:35:51,642 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2021-01-06 19:35:51,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:51,669 INFO L225 Difference]: With dead ends: 206 [2021-01-06 19:35:51,669 INFO L226 Difference]: Without dead ends: 127 [2021-01-06 19:35:51,673 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:35:51,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-01-06 19:35:51,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-01-06 19:35:51,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2021-01-06 19:35:51,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 220 transitions. [2021-01-06 19:35:51,748 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 220 transitions. Word has length 37 [2021-01-06 19:35:51,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:51,750 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 220 transitions. [2021-01-06 19:35:51,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 19:35:51,750 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 220 transitions. [2021-01-06 19:35:51,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:35:51,756 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:51,757 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:35:51,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:35:51,758 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:35:51,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:51,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1124364700, now seen corresponding path program 1 times [2021-01-06 19:35:51,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:51,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127752032] [2021-01-06 19:35:51,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:51,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:35:51,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127752032] [2021-01-06 19:35:51,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:35:51,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:35:51,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918128589] [2021-01-06 19:35:51,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:35:51,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:51,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:35:51,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:35:51,968 INFO L87 Difference]: Start difference. First operand 127 states and 220 transitions. Second operand 5 states. [2021-01-06 19:35:52,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:52,132 INFO L93 Difference]: Finished difference Result 271 states and 460 transitions. [2021-01-06 19:35:52,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:35:52,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2021-01-06 19:35:52,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:52,136 INFO L225 Difference]: With dead ends: 271 [2021-01-06 19:35:52,136 INFO L226 Difference]: Without dead ends: 197 [2021-01-06 19:35:52,139 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:35:52,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-01-06 19:35:52,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 127. [2021-01-06 19:35:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2021-01-06 19:35:52,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 193 transitions. [2021-01-06 19:35:52,155 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 193 transitions. Word has length 37 [2021-01-06 19:35:52,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:52,155 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 193 transitions. [2021-01-06 19:35:52,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:35:52,156 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 193 transitions. [2021-01-06 19:35:52,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 19:35:52,158 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:52,159 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:35:52,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:35:52,159 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:35:52,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:52,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1313145683, now seen corresponding path program 1 times [2021-01-06 19:35:52,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:52,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7266426] [2021-01-06 19:35:52,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:52,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:35:52,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7266426] [2021-01-06 19:35:52,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:35:52,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:35:52,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980635452] [2021-01-06 19:35:52,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:35:52,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:52,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:35:52,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:35:52,354 INFO L87 Difference]: Start difference. First operand 127 states and 193 transitions. Second operand 3 states. [2021-01-06 19:35:52,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:52,450 INFO L93 Difference]: Finished difference Result 258 states and 412 transitions. [2021-01-06 19:35:52,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:35:52,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2021-01-06 19:35:52,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:52,458 INFO L225 Difference]: With dead ends: 258 [2021-01-06 19:35:52,459 INFO L226 Difference]: Without dead ends: 188 [2021-01-06 19:35:52,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:35:52,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-01-06 19:35:52,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2021-01-06 19:35:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2021-01-06 19:35:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 288 transitions. [2021-01-06 19:35:52,499 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 288 transitions. Word has length 63 [2021-01-06 19:35:52,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:52,500 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 288 transitions. [2021-01-06 19:35:52,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:35:52,501 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 288 transitions. [2021-01-06 19:35:52,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 19:35:52,507 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:52,507 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:35:52,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:35:52,507 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:35:52,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:52,512 INFO L82 PathProgramCache]: Analyzing trace with hash -255493166, now seen corresponding path program 1 times [2021-01-06 19:35:52,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:52,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41566385] [2021-01-06 19:35:52,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:52,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:35:52,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41566385] [2021-01-06 19:35:52,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:35:52,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:35:52,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297528769] [2021-01-06 19:35:52,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:35:52,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:52,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:35:52,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:35:52,676 INFO L87 Difference]: Start difference. First operand 186 states and 288 transitions. Second operand 3 states. [2021-01-06 19:35:52,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:52,715 INFO L93 Difference]: Finished difference Result 313 states and 501 transitions. [2021-01-06 19:35:52,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:35:52,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2021-01-06 19:35:52,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:52,718 INFO L225 Difference]: With dead ends: 313 [2021-01-06 19:35:52,719 INFO L226 Difference]: Without dead ends: 243 [2021-01-06 19:35:52,720 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:35:52,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-01-06 19:35:52,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2021-01-06 19:35:52,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2021-01-06 19:35:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 380 transitions. [2021-01-06 19:35:52,736 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 380 transitions. Word has length 65 [2021-01-06 19:35:52,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:52,737 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 380 transitions. [2021-01-06 19:35:52,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:35:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 380 transitions. [2021-01-06 19:35:52,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 19:35:52,738 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:52,738 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:35:52,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:35:52,739 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:35:52,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:52,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1395779292, now seen corresponding path program 1 times [2021-01-06 19:35:52,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:52,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999014697] [2021-01-06 19:35:52,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:52,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:35:52,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999014697] [2021-01-06 19:35:52,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:35:52,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:35:52,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768199537] [2021-01-06 19:35:52,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:35:52,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:52,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:35:52,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:35:52,861 INFO L87 Difference]: Start difference. First operand 241 states and 380 transitions. Second operand 3 states. [2021-01-06 19:35:52,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:52,915 INFO L93 Difference]: Finished difference Result 584 states and 947 transitions. [2021-01-06 19:35:52,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:35:52,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2021-01-06 19:35:52,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:52,921 INFO L225 Difference]: With dead ends: 584 [2021-01-06 19:35:52,921 INFO L226 Difference]: Without dead ends: 402 [2021-01-06 19:35:52,925 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:35:52,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2021-01-06 19:35:52,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2021-01-06 19:35:52,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2021-01-06 19:35:52,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 640 transitions. [2021-01-06 19:35:52,962 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 640 transitions. Word has length 65 [2021-01-06 19:35:52,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:52,964 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 640 transitions. [2021-01-06 19:35:52,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:35:52,965 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 640 transitions. [2021-01-06 19:35:52,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 19:35:52,967 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:52,967 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:35:52,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:35:52,968 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:35:52,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:52,970 INFO L82 PathProgramCache]: Analyzing trace with hash -812427391, now seen corresponding path program 1 times [2021-01-06 19:35:52,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:52,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316956613] [2021-01-06 19:35:52,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:35:53,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316956613] [2021-01-06 19:35:53,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:35:53,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:35:53,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444728099] [2021-01-06 19:35:53,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:35:53,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:53,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:35:53,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:35:53,068 INFO L87 Difference]: Start difference. First operand 400 states and 640 transitions. Second operand 3 states. [2021-01-06 19:35:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:53,115 INFO L93 Difference]: Finished difference Result 729 states and 1183 transitions. [2021-01-06 19:35:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:35:53,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2021-01-06 19:35:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:53,119 INFO L225 Difference]: With dead ends: 729 [2021-01-06 19:35:53,119 INFO L226 Difference]: Without dead ends: 547 [2021-01-06 19:35:53,121 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:35:53,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-01-06 19:35:53,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2021-01-06 19:35:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2021-01-06 19:35:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 875 transitions. [2021-01-06 19:35:53,169 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 875 transitions. Word has length 67 [2021-01-06 19:35:53,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:53,169 INFO L481 AbstractCegarLoop]: Abstraction has 545 states and 875 transitions. [2021-01-06 19:35:53,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:35:53,170 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 875 transitions. [2021-01-06 19:35:53,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 19:35:53,171 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:53,172 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:35:53,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:35:53,172 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:35:53,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:53,174 INFO L82 PathProgramCache]: Analyzing trace with hash 221435787, now seen corresponding path program 1 times [2021-01-06 19:35:53,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:53,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884892427] [2021-01-06 19:35:53,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:35:53,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884892427] [2021-01-06 19:35:53,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:35:53,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:35:53,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915598605] [2021-01-06 19:35:53,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:35:53,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:53,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:35:53,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:35:53,290 INFO L87 Difference]: Start difference. First operand 545 states and 875 transitions. Second operand 3 states. [2021-01-06 19:35:53,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:53,344 INFO L93 Difference]: Finished difference Result 1434 states and 2326 transitions. [2021-01-06 19:35:53,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:35:53,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2021-01-06 19:35:53,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:53,351 INFO L225 Difference]: With dead ends: 1434 [2021-01-06 19:35:53,352 INFO L226 Difference]: Without dead ends: 958 [2021-01-06 19:35:53,354 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:35:53,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2021-01-06 19:35:53,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 956. [2021-01-06 19:35:53,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2021-01-06 19:35:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1532 transitions. [2021-01-06 19:35:53,398 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1532 transitions. Word has length 67 [2021-01-06 19:35:53,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:53,400 INFO L481 AbstractCegarLoop]: Abstraction has 956 states and 1532 transitions. [2021-01-06 19:35:53,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:35:53,400 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1532 transitions. [2021-01-06 19:35:53,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 19:35:53,402 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:53,402 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:35:53,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:35:53,403 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:35:53,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:53,403 INFO L82 PathProgramCache]: Analyzing trace with hash 664156592, now seen corresponding path program 1 times [2021-01-06 19:35:53,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:53,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990127288] [2021-01-06 19:35:53,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:53,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:35:53,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990127288] [2021-01-06 19:35:53,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:35:53,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:35:53,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343965378] [2021-01-06 19:35:53,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:35:53,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:53,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:35:53,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:35:53,483 INFO L87 Difference]: Start difference. First operand 956 states and 1532 transitions. Second operand 3 states. [2021-01-06 19:35:53,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:53,533 INFO L93 Difference]: Finished difference Result 1783 states and 2881 transitions. [2021-01-06 19:35:53,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:35:53,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2021-01-06 19:35:53,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:53,540 INFO L225 Difference]: With dead ends: 1783 [2021-01-06 19:35:53,541 INFO L226 Difference]: Without dead ends: 1307 [2021-01-06 19:35:53,542 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:35:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2021-01-06 19:35:53,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1305. [2021-01-06 19:35:53,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2021-01-06 19:35:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 2086 transitions. [2021-01-06 19:35:53,595 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 2086 transitions. Word has length 69 [2021-01-06 19:35:53,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:53,595 INFO L481 AbstractCegarLoop]: Abstraction has 1305 states and 2086 transitions. [2021-01-06 19:35:53,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:35:53,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 2086 transitions. [2021-01-06 19:35:53,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 19:35:53,602 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:53,602 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:35:53,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:35:53,603 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:35:53,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:53,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1757720902, now seen corresponding path program 1 times [2021-01-06 19:35:53,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:53,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562293487] [2021-01-06 19:35:53,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:53,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:35:53,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562293487] [2021-01-06 19:35:53,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:35:53,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:35:53,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353585449] [2021-01-06 19:35:53,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:35:53,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:53,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:35:53,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:35:53,757 INFO L87 Difference]: Start difference. First operand 1305 states and 2086 transitions. Second operand 5 states. [2021-01-06 19:35:54,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:54,080 INFO L93 Difference]: Finished difference Result 6582 states and 10723 transitions. [2021-01-06 19:35:54,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:35:54,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2021-01-06 19:35:54,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:54,110 INFO L225 Difference]: With dead ends: 6582 [2021-01-06 19:35:54,110 INFO L226 Difference]: Without dead ends: 5356 [2021-01-06 19:35:54,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:35:54,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5356 states. [2021-01-06 19:35:54,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5356 to 2452. [2021-01-06 19:35:54,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2452 states. [2021-01-06 19:35:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3914 transitions. [2021-01-06 19:35:54,259 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3914 transitions. Word has length 69 [2021-01-06 19:35:54,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:54,260 INFO L481 AbstractCegarLoop]: Abstraction has 2452 states and 3914 transitions. [2021-01-06 19:35:54,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:35:54,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3914 transitions. [2021-01-06 19:35:54,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-01-06 19:35:54,261 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:54,261 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:35:54,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:35:54,262 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:35:54,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:54,262 INFO L82 PathProgramCache]: Analyzing trace with hash -577605759, now seen corresponding path program 1 times [2021-01-06 19:35:54,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:54,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427896313] [2021-01-06 19:35:54,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:35:54,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427896313] [2021-01-06 19:35:54,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:35:54,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:35:54,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875800934] [2021-01-06 19:35:54,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:35:54,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:54,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:35:54,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:35:54,364 INFO L87 Difference]: Start difference. First operand 2452 states and 3914 transitions. Second operand 4 states. [2021-01-06 19:35:54,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:54,647 INFO L93 Difference]: Finished difference Result 7943 states and 12835 transitions. [2021-01-06 19:35:54,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:35:54,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2021-01-06 19:35:54,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:54,683 INFO L225 Difference]: With dead ends: 7943 [2021-01-06 19:35:54,683 INFO L226 Difference]: Without dead ends: 5570 [2021-01-06 19:35:54,692 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:35:54,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states. [2021-01-06 19:35:54,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 3992. [2021-01-06 19:35:54,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3992 states. [2021-01-06 19:35:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3992 states to 3992 states and 6384 transitions. [2021-01-06 19:35:54,979 INFO L78 Accepts]: Start accepts. Automaton has 3992 states and 6384 transitions. Word has length 70 [2021-01-06 19:35:54,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:54,980 INFO L481 AbstractCegarLoop]: Abstraction has 3992 states and 6384 transitions. [2021-01-06 19:35:54,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:35:54,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3992 states and 6384 transitions. [2021-01-06 19:35:54,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 19:35:54,981 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:54,981 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:35:54,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:35:54,982 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:35:54,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:54,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1815229649, now seen corresponding path program 1 times [2021-01-06 19:35:54,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:54,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252354303] [2021-01-06 19:35:54,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:55,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:35:55,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252354303] [2021-01-06 19:35:55,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:35:55,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:35:55,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255331714] [2021-01-06 19:35:55,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:35:55,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:55,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:35:55,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:35:55,109 INFO L87 Difference]: Start difference. First operand 3992 states and 6384 transitions. Second operand 4 states. [2021-01-06 19:35:55,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:55,557 INFO L93 Difference]: Finished difference Result 13018 states and 20914 transitions. [2021-01-06 19:35:55,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:35:55,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2021-01-06 19:35:55,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:55,629 INFO L225 Difference]: With dead ends: 13018 [2021-01-06 19:35:55,630 INFO L226 Difference]: Without dead ends: 9105 [2021-01-06 19:35:55,639 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:35:55,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9105 states. [2021-01-06 19:35:56,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9105 to 6388. [2021-01-06 19:35:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6388 states. [2021-01-06 19:35:56,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6388 states to 6388 states and 10164 transitions. [2021-01-06 19:35:56,052 INFO L78 Accepts]: Start accepts. Automaton has 6388 states and 10164 transitions. Word has length 71 [2021-01-06 19:35:56,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:56,053 INFO L481 AbstractCegarLoop]: Abstraction has 6388 states and 10164 transitions. [2021-01-06 19:35:56,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:35:56,053 INFO L276 IsEmpty]: Start isEmpty. Operand 6388 states and 10164 transitions. [2021-01-06 19:35:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:35:56,054 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:56,054 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:35:56,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:35:56,054 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:35:56,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:56,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1147279688, now seen corresponding path program 1 times [2021-01-06 19:35:56,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:56,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967017152] [2021-01-06 19:35:56,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:35:56,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967017152] [2021-01-06 19:35:56,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:35:56,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:35:56,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347915034] [2021-01-06 19:35:56,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:35:56,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:56,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:35:56,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:35:56,116 INFO L87 Difference]: Start difference. First operand 6388 states and 10164 transitions. Second operand 4 states. [2021-01-06 19:35:56,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:56,811 INFO L93 Difference]: Finished difference Result 20047 states and 32019 transitions. [2021-01-06 19:35:56,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:35:56,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-01-06 19:35:56,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:56,848 INFO L225 Difference]: With dead ends: 20047 [2021-01-06 19:35:56,848 INFO L226 Difference]: Without dead ends: 13738 [2021-01-06 19:35:56,860 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:35:56,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13738 states. [2021-01-06 19:35:57,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13738 to 10020. [2021-01-06 19:35:57,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10020 states. [2021-01-06 19:35:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10020 states to 10020 states and 15856 transitions. [2021-01-06 19:35:57,526 INFO L78 Accepts]: Start accepts. Automaton has 10020 states and 15856 transitions. Word has length 72 [2021-01-06 19:35:57,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:57,526 INFO L481 AbstractCegarLoop]: Abstraction has 10020 states and 15856 transitions. [2021-01-06 19:35:57,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:35:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 10020 states and 15856 transitions. [2021-01-06 19:35:57,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 19:35:57,527 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:57,528 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:35:57,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:35:57,528 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:35:57,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:57,529 INFO L82 PathProgramCache]: Analyzing trace with hash -856706640, now seen corresponding path program 1 times [2021-01-06 19:35:57,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:57,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973421829] [2021-01-06 19:35:57,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:35:57,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973421829] [2021-01-06 19:35:57,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:35:57,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:35:57,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917410464] [2021-01-06 19:35:57,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:35:57,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:57,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:35:57,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:35:57,708 INFO L87 Difference]: Start difference. First operand 10020 states and 15856 transitions. Second operand 4 states. [2021-01-06 19:35:58,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:58,652 INFO L93 Difference]: Finished difference Result 29688 states and 46962 transitions. [2021-01-06 19:35:58,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:35:58,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 19:35:58,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:58,700 INFO L225 Difference]: With dead ends: 29688 [2021-01-06 19:35:58,701 INFO L226 Difference]: Without dead ends: 19677 [2021-01-06 19:35:58,721 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:35:58,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19677 states. [2021-01-06 19:35:59,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19677 to 19675. [2021-01-06 19:35:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19675 states. [2021-01-06 19:35:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19675 states to 19675 states and 30894 transitions. [2021-01-06 19:35:59,829 INFO L78 Accepts]: Start accepts. Automaton has 19675 states and 30894 transitions. Word has length 74 [2021-01-06 19:35:59,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:35:59,829 INFO L481 AbstractCegarLoop]: Abstraction has 19675 states and 30894 transitions. [2021-01-06 19:35:59,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:35:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand 19675 states and 30894 transitions. [2021-01-06 19:35:59,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 19:35:59,832 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:35:59,833 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:35:59,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:35:59,833 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:35:59,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:35:59,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1857988380, now seen corresponding path program 1 times [2021-01-06 19:35:59,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:35:59,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953106658] [2021-01-06 19:35:59,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:35:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:35:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:35:59,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953106658] [2021-01-06 19:35:59,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:35:59,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:35:59,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312645378] [2021-01-06 19:35:59,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:35:59,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:35:59,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:35:59,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:35:59,875 INFO L87 Difference]: Start difference. First operand 19675 states and 30894 transitions. Second operand 3 states. [2021-01-06 19:36:01,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:01,476 INFO L93 Difference]: Finished difference Result 58987 states and 92620 transitions. [2021-01-06 19:36:01,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:36:01,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2021-01-06 19:36:01,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:01,603 INFO L225 Difference]: With dead ends: 58987 [2021-01-06 19:36:01,603 INFO L226 Difference]: Without dead ends: 39340 [2021-01-06 19:36:01,643 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:01,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39340 states. [2021-01-06 19:36:03,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39340 to 19677. [2021-01-06 19:36:03,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19677 states. [2021-01-06 19:36:03,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19677 states to 19677 states and 30896 transitions. [2021-01-06 19:36:03,145 INFO L78 Accepts]: Start accepts. Automaton has 19677 states and 30896 transitions. Word has length 75 [2021-01-06 19:36:03,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:03,145 INFO L481 AbstractCegarLoop]: Abstraction has 19677 states and 30896 transitions. [2021-01-06 19:36:03,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:36:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 19677 states and 30896 transitions. [2021-01-06 19:36:03,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:36:03,147 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:03,147 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:36:03,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:36:03,147 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:03,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:03,148 INFO L82 PathProgramCache]: Analyzing trace with hash 424514133, now seen corresponding path program 1 times [2021-01-06 19:36:03,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:03,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376149661] [2021-01-06 19:36:03,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:03,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:03,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376149661] [2021-01-06 19:36:03,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:03,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:36:03,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585972861] [2021-01-06 19:36:03,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:36:03,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:03,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:36:03,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:36:03,299 INFO L87 Difference]: Start difference. First operand 19677 states and 30896 transitions. Second operand 4 states. [2021-01-06 19:36:04,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:04,990 INFO L93 Difference]: Finished difference Result 58291 states and 91488 transitions. [2021-01-06 19:36:04,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:36:04,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2021-01-06 19:36:04,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:05,119 INFO L225 Difference]: With dead ends: 58291 [2021-01-06 19:36:05,119 INFO L226 Difference]: Without dead ends: 38626 [2021-01-06 19:36:05,158 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:36:05,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38626 states. [2021-01-06 19:36:07,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38626 to 38624. [2021-01-06 19:36:07,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38624 states. [2021-01-06 19:36:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38624 states to 38624 states and 60157 transitions. [2021-01-06 19:36:07,089 INFO L78 Accepts]: Start accepts. Automaton has 38624 states and 60157 transitions. Word has length 76 [2021-01-06 19:36:07,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:07,089 INFO L481 AbstractCegarLoop]: Abstraction has 38624 states and 60157 transitions. [2021-01-06 19:36:07,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:36:07,089 INFO L276 IsEmpty]: Start isEmpty. Operand 38624 states and 60157 transitions. [2021-01-06 19:36:07,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 19:36:07,097 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:07,097 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:36:07,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:36:07,097 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:07,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:07,098 INFO L82 PathProgramCache]: Analyzing trace with hash 551656516, now seen corresponding path program 1 times [2021-01-06 19:36:07,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:07,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060105494] [2021-01-06 19:36:07,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:07,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:07,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060105494] [2021-01-06 19:36:07,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:07,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:36:07,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507163897] [2021-01-06 19:36:07,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:36:07,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:07,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:36:07,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:36:07,192 INFO L87 Difference]: Start difference. First operand 38624 states and 60157 transitions. Second operand 4 states. [2021-01-06 19:36:09,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:09,757 INFO L93 Difference]: Finished difference Result 114364 states and 178019 transitions. [2021-01-06 19:36:09,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:36:09,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2021-01-06 19:36:09,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:09,926 INFO L225 Difference]: With dead ends: 114364 [2021-01-06 19:36:09,926 INFO L226 Difference]: Without dead ends: 75786 [2021-01-06 19:36:09,981 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:36:10,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75786 states. [2021-01-06 19:36:13,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75786 to 75784. [2021-01-06 19:36:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75784 states. [2021-01-06 19:36:13,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75784 states to 75784 states and 117031 transitions. [2021-01-06 19:36:13,490 INFO L78 Accepts]: Start accepts. Automaton has 75784 states and 117031 transitions. Word has length 76 [2021-01-06 19:36:13,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:13,491 INFO L481 AbstractCegarLoop]: Abstraction has 75784 states and 117031 transitions. [2021-01-06 19:36:13,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:36:13,491 INFO L276 IsEmpty]: Start isEmpty. Operand 75784 states and 117031 transitions. [2021-01-06 19:36:13,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 19:36:13,493 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:13,493 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:36:13,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:36:13,493 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:13,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:13,494 INFO L82 PathProgramCache]: Analyzing trace with hash -656359944, now seen corresponding path program 1 times [2021-01-06 19:36:13,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:13,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435805823] [2021-01-06 19:36:13,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:13,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435805823] [2021-01-06 19:36:13,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:13,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:36:13,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048855444] [2021-01-06 19:36:13,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:36:13,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:13,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:36:13,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:13,527 INFO L87 Difference]: Start difference. First operand 75784 states and 117031 transitions. Second operand 3 states. [2021-01-06 19:36:18,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:18,608 INFO L93 Difference]: Finished difference Result 227228 states and 350901 transitions. [2021-01-06 19:36:18,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:36:18,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2021-01-06 19:36:18,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:18,915 INFO L225 Difference]: With dead ends: 227228 [2021-01-06 19:36:18,915 INFO L226 Difference]: Without dead ends: 151518 [2021-01-06 19:36:18,981 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:36:19,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151518 states. [2021-01-06 19:36:23,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151518 to 75792. [2021-01-06 19:36:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75792 states. [2021-01-06 19:36:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75792 states to 75792 states and 117039 transitions. [2021-01-06 19:36:23,408 INFO L78 Accepts]: Start accepts. Automaton has 75792 states and 117039 transitions. Word has length 77 [2021-01-06 19:36:23,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:23,408 INFO L481 AbstractCegarLoop]: Abstraction has 75792 states and 117039 transitions. [2021-01-06 19:36:23,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:36:23,408 INFO L276 IsEmpty]: Start isEmpty. Operand 75792 states and 117039 transitions. [2021-01-06 19:36:23,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:36:23,410 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:23,410 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:36:23,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:36:23,410 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:23,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:23,411 INFO L82 PathProgramCache]: Analyzing trace with hash 834408617, now seen corresponding path program 1 times [2021-01-06 19:36:23,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:23,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715183547] [2021-01-06 19:36:23,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:23,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:23,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715183547] [2021-01-06 19:36:23,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:23,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:36:23,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824462751] [2021-01-06 19:36:23,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:36:23,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:23,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:36:23,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:36:23,500 INFO L87 Difference]: Start difference. First operand 75792 states and 117039 transitions. Second operand 4 states. [2021-01-06 19:36:29,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:29,336 INFO L93 Difference]: Finished difference Result 224404 states and 346298 transitions. [2021-01-06 19:36:29,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:36:29,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2021-01-06 19:36:29,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:29,635 INFO L225 Difference]: With dead ends: 224404 [2021-01-06 19:36:29,635 INFO L226 Difference]: Without dead ends: 148667 [2021-01-06 19:36:29,705 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:36:29,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148667 states. [2021-01-06 19:36:36,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148667 to 148665. [2021-01-06 19:36:36,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148665 states. [2021-01-06 19:36:36,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148665 states to 148665 states and 227541 transitions. [2021-01-06 19:36:36,467 INFO L78 Accepts]: Start accepts. Automaton has 148665 states and 227541 transitions. Word has length 78 [2021-01-06 19:36:36,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:36:36,467 INFO L481 AbstractCegarLoop]: Abstraction has 148665 states and 227541 transitions. [2021-01-06 19:36:36,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:36:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 148665 states and 227541 transitions. [2021-01-06 19:36:36,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-01-06 19:36:36,731 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:36:36,731 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:36:36,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:36:36,731 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:36:36,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:36:36,732 INFO L82 PathProgramCache]: Analyzing trace with hash 640680152, now seen corresponding path program 1 times [2021-01-06 19:36:36,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:36:36,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086815721] [2021-01-06 19:36:36,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:36:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:36:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:36:36,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086815721] [2021-01-06 19:36:36,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:36:36,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:36:36,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89877660] [2021-01-06 19:36:36,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:36:36,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:36:36,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:36:36,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:36:36,845 INFO L87 Difference]: Start difference. First operand 148665 states and 227541 transitions. Second operand 4 states. [2021-01-06 19:36:48,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:36:48,346 INFO L93 Difference]: Finished difference Result 440021 states and 672927 transitions. [2021-01-06 19:36:48,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:36:48,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2021-01-06 19:36:48,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:36:49,029 INFO L225 Difference]: With dead ends: 440021 [2021-01-06 19:36:49,030 INFO L226 Difference]: Without dead ends: 291515 [2021-01-06 19:36:49,161 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:36:49,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291515 states. [2021-01-06 19:37:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291515 to 291513. [2021-01-06 19:37:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291513 states. [2021-01-06 19:37:03,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291513 states to 291513 states and 442037 transitions. [2021-01-06 19:37:03,927 INFO L78 Accepts]: Start accepts. Automaton has 291513 states and 442037 transitions. Word has length 78 [2021-01-06 19:37:03,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:03,928 INFO L481 AbstractCegarLoop]: Abstraction has 291513 states and 442037 transitions. [2021-01-06 19:37:03,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:37:03,928 INFO L276 IsEmpty]: Start isEmpty. Operand 291513 states and 442037 transitions. [2021-01-06 19:37:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-06 19:37:03,934 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:03,934 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:37:03,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:37:03,936 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:03,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:03,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1890599668, now seen corresponding path program 1 times [2021-01-06 19:37:03,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:03,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116761087] [2021-01-06 19:37:03,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:03,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:03,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116761087] [2021-01-06 19:37:03,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:03,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:37:03,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47352588] [2021-01-06 19:37:03,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:37:03,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:03,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:37:03,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:03,987 INFO L87 Difference]: Start difference. First operand 291513 states and 442037 transitions. Second operand 3 states. [2021-01-06 19:37:27,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:37:27,363 INFO L93 Difference]: Finished difference Result 873245 states and 1324519 transitions. [2021-01-06 19:37:27,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:37:27,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2021-01-06 19:37:27,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:37:28,919 INFO L225 Difference]: With dead ends: 873245 [2021-01-06 19:37:28,919 INFO L226 Difference]: Without dead ends: 582795 [2021-01-06 19:37:29,240 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:37:29,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582795 states. [2021-01-06 19:37:46,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582795 to 291545. [2021-01-06 19:37:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291545 states. [2021-01-06 19:37:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291545 states to 291545 states and 442069 transitions. [2021-01-06 19:37:48,067 INFO L78 Accepts]: Start accepts. Automaton has 291545 states and 442069 transitions. Word has length 79 [2021-01-06 19:37:48,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:37:48,067 INFO L481 AbstractCegarLoop]: Abstraction has 291545 states and 442069 transitions. [2021-01-06 19:37:48,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:37:48,068 INFO L276 IsEmpty]: Start isEmpty. Operand 291545 states and 442069 transitions. [2021-01-06 19:37:48,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 19:37:48,092 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:37:48,093 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:37:48,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:37:48,095 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:37:48,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:37:48,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1453451011, now seen corresponding path program 1 times [2021-01-06 19:37:48,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:37:48,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228538385] [2021-01-06 19:37:48,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:37:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:37:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:37:48,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228538385] [2021-01-06 19:37:48,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:37:48,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:37:48,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399003367] [2021-01-06 19:37:48,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:37:48,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:37:48,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:37:48,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:37:48,296 INFO L87 Difference]: Start difference. First operand 291545 states and 442069 transitions. Second operand 4 states. [2021-01-06 19:38:18,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:38:18,625 INFO L93 Difference]: Finished difference Result 862768 states and 1306995 transitions. [2021-01-06 19:38:18,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:38:18,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2021-01-06 19:38:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:38:20,319 INFO L225 Difference]: With dead ends: 862768 [2021-01-06 19:38:20,319 INFO L226 Difference]: Without dead ends: 571474 [2021-01-06 19:38:20,738 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:38:21,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571474 states.