/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_lcr.7.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:53:00,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:53:00,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:53:00,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:53:00,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:53:00,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:53:00,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:53:00,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:53:00,943 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:53:00,945 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:53:00,946 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:53:00,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:53:00,948 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:53:00,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:53:00,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:53:00,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:53:00,960 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:53:00,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:53:00,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:53:00,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:53:00,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:53:00,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:53:00,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:53:00,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:53:00,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:53:00,975 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:53:00,975 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:53:00,976 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:53:00,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:53:00,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:53:00,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:53:00,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:53:00,980 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:53:00,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:53:00,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:53:00,982 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:53:00,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:53:00,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:53:00,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:53:00,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:53:00,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:53:00,987 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:53:01,012 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:53:01,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:53:01,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:53:01,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:53:01,014 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:53:01,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:53:01,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:53:01,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:53:01,015 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:53:01,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:53:01,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:53:01,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:53:01,016 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:53:01,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:53:01,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:53:01,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:53:01,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:53:01,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:53:01,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:53:01,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:53:01,017 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:53:01,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:53:01,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:53:01,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:53:01,018 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:53:01,018 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:53:01,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:53:01,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:53:01,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:53:01,389 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:53:01,389 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:53:01,390 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.UNBOUNDED.pals.c [2021-01-06 19:53:01,476 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/eacb49544/805cb1bc8ead4a5e9886a486d6a94ce1/FLAG1233977ef [2021-01-06 19:53:02,164 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:53:02,165 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.UNBOUNDED.pals.c [2021-01-06 19:53:02,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/eacb49544/805cb1bc8ead4a5e9886a486d6a94ce1/FLAG1233977ef [2021-01-06 19:53:02,469 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/eacb49544/805cb1bc8ead4a5e9886a486d6a94ce1 [2021-01-06 19:53:02,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:53:02,482 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:53:02,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:53:02,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:53:02,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:53:02,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:53:02" (1/1) ... [2021-01-06 19:53:02,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a95f36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:02, skipping insertion in model container [2021-01-06 19:53:02,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:53:02" (1/1) ... [2021-01-06 19:53:02,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:53:02,567 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] 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[~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[~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[~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[~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[~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[~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[~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[~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[~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[~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[~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[~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~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[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~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[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~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[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2021-01-06 19:53:02,818 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_lcr.7.1.ufo.UNBOUNDED.pals.c[20084,20097] [2021-01-06 19:53:02,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:53:02,841 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] 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[~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[~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[~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[~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[~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[~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[~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[~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[~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[~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[~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[~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~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[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~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[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~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[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2021-01-06 19:53:02,923 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_lcr.7.1.ufo.UNBOUNDED.pals.c[20084,20097] [2021-01-06 19:53:02,924 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:53:02,946 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:53:02,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:02 WrapperNode [2021-01-06 19:53:02,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:53:02,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:53:02,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:53:02,948 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:53:02,959 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:53:02" (1/1) ... [2021-01-06 19:53:02,989 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:53:02" (1/1) ... [2021-01-06 19:53:03,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:53:03,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:53:03,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:53:03,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:53:03,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:02" (1/1) ... [2021-01-06 19:53:03,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:02" (1/1) ... [2021-01-06 19:53:03,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:02" (1/1) ... [2021-01-06 19:53:03,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:02" (1/1) ... [2021-01-06 19:53:03,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:02" (1/1) ... [2021-01-06 19:53:03,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:02" (1/1) ... [2021-01-06 19:53:03,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:02" (1/1) ... [2021-01-06 19:53:03,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:53:03,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:53:03,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:53:03,094 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:53:03,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:02" (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:53:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:53:03,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:53:03,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:53:03,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:53:04,448 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:53:04,449 INFO L299 CfgBuilder]: Removed 27 assume(true) statements. [2021-01-06 19:53:04,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:53:04 BoogieIcfgContainer [2021-01-06 19:53:04,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:53:04,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:53:04,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:53:04,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:53:04,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:53:02" (1/3) ... [2021-01-06 19:53:04,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf0de87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:53:04, skipping insertion in model container [2021-01-06 19:53:04,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:02" (2/3) ... [2021-01-06 19:53:04,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf0de87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:53:04, skipping insertion in model container [2021-01-06 19:53:04,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:53:04" (3/3) ... [2021-01-06 19:53:04,459 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c [2021-01-06 19:53:04,466 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:53:04,471 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:53:04,489 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:53:04,517 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:53:04,518 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:53:04,518 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:53:04,518 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:53:04,518 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:53:04,518 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:53:04,518 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:53:04,519 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:53:04,537 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2021-01-06 19:53:04,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-06 19:53:04,547 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:04,548 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] [2021-01-06 19:53:04,548 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:04,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:04,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1880075128, now seen corresponding path program 1 times [2021-01-06 19:53:04,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:04,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599455270] [2021-01-06 19:53:04,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:04,802 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:53:04,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599455270] [2021-01-06 19:53:04,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:04,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:53:04,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451348222] [2021-01-06 19:53:04,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 19:53:04,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:04,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 19:53:04,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:53:04,828 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 2 states. [2021-01-06 19:53:04,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:04,862 INFO L93 Difference]: Finished difference Result 199 states and 337 transitions. [2021-01-06 19:53:04,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 19:53:04,864 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 41 [2021-01-06 19:53:04,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:04,877 INFO L225 Difference]: With dead ends: 199 [2021-01-06 19:53:04,877 INFO L226 Difference]: Without dead ends: 125 [2021-01-06 19:53:04,881 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:53:04,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-01-06 19:53:04,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-01-06 19:53:04,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2021-01-06 19:53:04,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 216 transitions. [2021-01-06 19:53:04,932 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 216 transitions. Word has length 41 [2021-01-06 19:53:04,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:04,933 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 216 transitions. [2021-01-06 19:53:04,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 19:53:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 216 transitions. [2021-01-06 19:53:04,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-06 19:53:04,939 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:04,939 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] [2021-01-06 19:53:04,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:53:04,940 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:04,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:04,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2020525382, now seen corresponding path program 1 times [2021-01-06 19:53:04,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:04,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273512066] [2021-01-06 19:53:04,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:05,116 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:53:05,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273512066] [2021-01-06 19:53:05,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:05,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:53:05,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491019601] [2021-01-06 19:53:05,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:53:05,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:05,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:53:05,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:53:05,121 INFO L87 Difference]: Start difference. First operand 125 states and 216 transitions. Second operand 5 states. [2021-01-06 19:53:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:05,281 INFO L93 Difference]: Finished difference Result 198 states and 330 transitions. [2021-01-06 19:53:05,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:53:05,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2021-01-06 19:53:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:05,284 INFO L225 Difference]: With dead ends: 198 [2021-01-06 19:53:05,284 INFO L226 Difference]: Without dead ends: 125 [2021-01-06 19:53:05,285 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:53:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-01-06 19:53:05,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-01-06 19:53:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2021-01-06 19:53:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 166 transitions. [2021-01-06 19:53:05,298 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 166 transitions. Word has length 41 [2021-01-06 19:53:05,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:05,298 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 166 transitions. [2021-01-06 19:53:05,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:53:05,299 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2021-01-06 19:53:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:05,302 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:05,303 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:05,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:53:05,303 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:05,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:05,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1655570070, now seen corresponding path program 1 times [2021-01-06 19:53:05,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:05,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131536282] [2021-01-06 19:53:05,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:05,529 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:53:05,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131536282] [2021-01-06 19:53:05,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:05,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:05,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738952589] [2021-01-06 19:53:05,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:05,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:05,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:05,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:05,538 INFO L87 Difference]: Start difference. First operand 125 states and 166 transitions. Second operand 3 states. [2021-01-06 19:53:05,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:05,568 INFO L93 Difference]: Finished difference Result 257 states and 376 transitions. [2021-01-06 19:53:05,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:05,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:53:05,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:05,572 INFO L225 Difference]: With dead ends: 257 [2021-01-06 19:53:05,572 INFO L226 Difference]: Without dead ends: 188 [2021-01-06 19:53:05,573 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:53:05,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-01-06 19:53:05,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2021-01-06 19:53:05,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2021-01-06 19:53:05,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 264 transitions. [2021-01-06 19:53:05,589 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 264 transitions. Word has length 90 [2021-01-06 19:53:05,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:05,590 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 264 transitions. [2021-01-06 19:53:05,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:05,590 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 264 transitions. [2021-01-06 19:53:05,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:05,592 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:05,593 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:05,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:53:05,593 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:05,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:05,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1317776928, now seen corresponding path program 1 times [2021-01-06 19:53:05,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:05,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700788544] [2021-01-06 19:53:05,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:05,795 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:53:05,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700788544] [2021-01-06 19:53:05,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:05,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:05,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971555685] [2021-01-06 19:53:05,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:05,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:05,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:05,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:05,799 INFO L87 Difference]: Start difference. First operand 186 states and 264 transitions. Second operand 3 states. [2021-01-06 19:53:05,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:05,836 INFO L93 Difference]: Finished difference Result 434 states and 660 transitions. [2021-01-06 19:53:05,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:05,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:53:05,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:05,840 INFO L225 Difference]: With dead ends: 434 [2021-01-06 19:53:05,840 INFO L226 Difference]: Without dead ends: 304 [2021-01-06 19:53:05,841 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:53:05,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-01-06 19:53:05,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 302. [2021-01-06 19:53:05,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2021-01-06 19:53:05,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 449 transitions. [2021-01-06 19:53:05,865 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 449 transitions. Word has length 90 [2021-01-06 19:53:05,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:05,866 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 449 transitions. [2021-01-06 19:53:05,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:05,866 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 449 transitions. [2021-01-06 19:53:05,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:05,868 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:05,868 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:05,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:53:05,868 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:05,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:05,869 INFO L82 PathProgramCache]: Analyzing trace with hash -99791530, now seen corresponding path program 1 times [2021-01-06 19:53:05,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:05,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3662078] [2021-01-06 19:53:05,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:06,139 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:53:06,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3662078] [2021-01-06 19:53:06,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:06,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:53:06,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319784998] [2021-01-06 19:53:06,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:53:06,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:06,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:53:06,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:53:06,143 INFO L87 Difference]: Start difference. First operand 302 states and 449 transitions. Second operand 9 states. [2021-01-06 19:53:06,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:06,810 INFO L93 Difference]: Finished difference Result 3746 states and 5951 transitions. [2021-01-06 19:53:06,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 19:53:06,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2021-01-06 19:53:06,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:06,850 INFO L225 Difference]: With dead ends: 3746 [2021-01-06 19:53:06,850 INFO L226 Difference]: Without dead ends: 3500 [2021-01-06 19:53:06,859 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2021-01-06 19:53:06,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3500 states. [2021-01-06 19:53:06,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3500 to 546. [2021-01-06 19:53:06,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2021-01-06 19:53:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 833 transitions. [2021-01-06 19:53:06,983 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 833 transitions. Word has length 90 [2021-01-06 19:53:06,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:06,984 INFO L481 AbstractCegarLoop]: Abstraction has 546 states and 833 transitions. [2021-01-06 19:53:06,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:53:06,984 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 833 transitions. [2021-01-06 19:53:06,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 19:53:06,998 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:06,998 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:06,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:53:06,999 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:06,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:06,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1468897702, now seen corresponding path program 1 times [2021-01-06 19:53:07,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:07,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934272826] [2021-01-06 19:53:07,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:07,100 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:53:07,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934272826] [2021-01-06 19:53:07,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:07,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:07,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570521339] [2021-01-06 19:53:07,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:07,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:07,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:07,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:07,104 INFO L87 Difference]: Start difference. First operand 546 states and 833 transitions. Second operand 3 states. [2021-01-06 19:53:07,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:07,198 INFO L93 Difference]: Finished difference Result 1482 states and 2311 transitions. [2021-01-06 19:53:07,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:07,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2021-01-06 19:53:07,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:07,206 INFO L225 Difference]: With dead ends: 1482 [2021-01-06 19:53:07,206 INFO L226 Difference]: Without dead ends: 992 [2021-01-06 19:53:07,209 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:53:07,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2021-01-06 19:53:07,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 982. [2021-01-06 19:53:07,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2021-01-06 19:53:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1505 transitions. [2021-01-06 19:53:07,277 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1505 transitions. Word has length 92 [2021-01-06 19:53:07,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:07,278 INFO L481 AbstractCegarLoop]: Abstraction has 982 states and 1505 transitions. [2021-01-06 19:53:07,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:07,279 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1505 transitions. [2021-01-06 19:53:07,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 19:53:07,280 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:07,280 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:07,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:53:07,281 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:07,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:07,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1535391214, now seen corresponding path program 1 times [2021-01-06 19:53:07,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:07,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512474783] [2021-01-06 19:53:07,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:07,758 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:53:07,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512474783] [2021-01-06 19:53:07,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:07,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:53:07,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949693299] [2021-01-06 19:53:07,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:53:07,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:07,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:53:07,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:53:07,763 INFO L87 Difference]: Start difference. First operand 982 states and 1505 transitions. Second operand 9 states. [2021-01-06 19:53:08,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:08,250 INFO L93 Difference]: Finished difference Result 2372 states and 3684 transitions. [2021-01-06 19:53:08,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:53:08,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2021-01-06 19:53:08,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:08,259 INFO L225 Difference]: With dead ends: 2372 [2021-01-06 19:53:08,260 INFO L226 Difference]: Without dead ends: 1446 [2021-01-06 19:53:08,262 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:53:08,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2021-01-06 19:53:08,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 982. [2021-01-06 19:53:08,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2021-01-06 19:53:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1497 transitions. [2021-01-06 19:53:08,345 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1497 transitions. Word has length 92 [2021-01-06 19:53:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:08,345 INFO L481 AbstractCegarLoop]: Abstraction has 982 states and 1497 transitions. [2021-01-06 19:53:08,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:53:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1497 transitions. [2021-01-06 19:53:08,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 19:53:08,347 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:08,348 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:08,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:53:08,348 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:08,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:08,349 INFO L82 PathProgramCache]: Analyzing trace with hash 550533322, now seen corresponding path program 1 times [2021-01-06 19:53:08,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:08,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056551666] [2021-01-06 19:53:08,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:08,447 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:53:08,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056551666] [2021-01-06 19:53:08,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:08,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:08,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529221400] [2021-01-06 19:53:08,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:08,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:08,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:08,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:08,450 INFO L87 Difference]: Start difference. First operand 982 states and 1497 transitions. Second operand 3 states. [2021-01-06 19:53:08,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:08,572 INFO L93 Difference]: Finished difference Result 2738 states and 4219 transitions. [2021-01-06 19:53:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:08,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2021-01-06 19:53:08,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:08,582 INFO L225 Difference]: With dead ends: 2738 [2021-01-06 19:53:08,582 INFO L226 Difference]: Without dead ends: 1812 [2021-01-06 19:53:08,584 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:53:08,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2021-01-06 19:53:08,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1810. [2021-01-06 19:53:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1810 states. [2021-01-06 19:53:08,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2761 transitions. [2021-01-06 19:53:08,710 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2761 transitions. Word has length 92 [2021-01-06 19:53:08,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:08,711 INFO L481 AbstractCegarLoop]: Abstraction has 1810 states and 2761 transitions. [2021-01-06 19:53:08,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:08,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2761 transitions. [2021-01-06 19:53:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 19:53:08,714 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:08,714 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:08,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:53:08,715 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:08,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:08,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1925362326, now seen corresponding path program 1 times [2021-01-06 19:53:08,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:08,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491847829] [2021-01-06 19:53:08,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:08,818 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:53:08,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491847829] [2021-01-06 19:53:08,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:08,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:08,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943467524] [2021-01-06 19:53:08,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:08,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:08,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:08,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:08,828 INFO L87 Difference]: Start difference. First operand 1810 states and 2761 transitions. Second operand 3 states. [2021-01-06 19:53:09,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:09,026 INFO L93 Difference]: Finished difference Result 5126 states and 7851 transitions. [2021-01-06 19:53:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:09,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2021-01-06 19:53:09,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:09,043 INFO L225 Difference]: With dead ends: 5126 [2021-01-06 19:53:09,044 INFO L226 Difference]: Without dead ends: 3372 [2021-01-06 19:53:09,050 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:53:09,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3372 states. [2021-01-06 19:53:09,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 3370. [2021-01-06 19:53:09,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3370 states. [2021-01-06 19:53:09,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 5113 transitions. [2021-01-06 19:53:09,301 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 5113 transitions. Word has length 92 [2021-01-06 19:53:09,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:09,301 INFO L481 AbstractCegarLoop]: Abstraction has 3370 states and 5113 transitions. [2021-01-06 19:53:09,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:09,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 5113 transitions. [2021-01-06 19:53:09,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 19:53:09,303 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:09,303 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:09,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:53:09,304 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:09,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:09,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1745956342, now seen corresponding path program 1 times [2021-01-06 19:53:09,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:09,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177526345] [2021-01-06 19:53:09,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:09,384 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:53:09,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177526345] [2021-01-06 19:53:09,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:09,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:09,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623796816] [2021-01-06 19:53:09,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:09,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:09,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:09,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:09,390 INFO L87 Difference]: Start difference. First operand 3370 states and 5113 transitions. Second operand 3 states. [2021-01-06 19:53:09,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:09,766 INFO L93 Difference]: Finished difference Result 9614 states and 14587 transitions. [2021-01-06 19:53:09,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:09,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2021-01-06 19:53:09,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:09,797 INFO L225 Difference]: With dead ends: 9614 [2021-01-06 19:53:09,798 INFO L226 Difference]: Without dead ends: 6300 [2021-01-06 19:53:09,803 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:53:09,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6300 states. [2021-01-06 19:53:10,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6300 to 6298. [2021-01-06 19:53:10,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6298 states. [2021-01-06 19:53:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6298 states to 6298 states and 9465 transitions. [2021-01-06 19:53:10,266 INFO L78 Accepts]: Start accepts. Automaton has 6298 states and 9465 transitions. Word has length 92 [2021-01-06 19:53:10,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:10,266 INFO L481 AbstractCegarLoop]: Abstraction has 6298 states and 9465 transitions. [2021-01-06 19:53:10,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:10,267 INFO L276 IsEmpty]: Start isEmpty. Operand 6298 states and 9465 transitions. [2021-01-06 19:53:10,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 19:53:10,269 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:10,270 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:10,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:53:10,271 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:10,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:10,271 INFO L82 PathProgramCache]: Analyzing trace with hash 789382826, now seen corresponding path program 1 times [2021-01-06 19:53:10,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:10,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127185334] [2021-01-06 19:53:10,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:10,340 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:53:10,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127185334] [2021-01-06 19:53:10,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:10,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:10,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460121258] [2021-01-06 19:53:10,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:10,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:10,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:10,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:10,344 INFO L87 Difference]: Start difference. First operand 6298 states and 9465 transitions. Second operand 3 states. [2021-01-06 19:53:11,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:11,085 INFO L93 Difference]: Finished difference Result 18014 states and 27003 transitions. [2021-01-06 19:53:11,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:11,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2021-01-06 19:53:11,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:11,148 INFO L225 Difference]: With dead ends: 18014 [2021-01-06 19:53:11,149 INFO L226 Difference]: Without dead ends: 11772 [2021-01-06 19:53:11,158 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:53:11,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11772 states. [2021-01-06 19:53:12,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11772 to 11770. [2021-01-06 19:53:12,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11770 states. [2021-01-06 19:53:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11770 states to 11770 states and 17465 transitions. [2021-01-06 19:53:12,058 INFO L78 Accepts]: Start accepts. Automaton has 11770 states and 17465 transitions. Word has length 92 [2021-01-06 19:53:12,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:12,059 INFO L481 AbstractCegarLoop]: Abstraction has 11770 states and 17465 transitions. [2021-01-06 19:53:12,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:12,059 INFO L276 IsEmpty]: Start isEmpty. Operand 11770 states and 17465 transitions. [2021-01-06 19:53:12,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 19:53:12,060 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:12,060 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:12,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:53:12,061 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:12,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:12,061 INFO L82 PathProgramCache]: Analyzing trace with hash -62235482, now seen corresponding path program 1 times [2021-01-06 19:53:12,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:12,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841540142] [2021-01-06 19:53:12,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:12,219 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:53:12,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841540142] [2021-01-06 19:53:12,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:12,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:53:12,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496574880] [2021-01-06 19:53:12,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:53:12,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:12,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:53:12,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:53:12,222 INFO L87 Difference]: Start difference. First operand 11770 states and 17465 transitions. Second operand 8 states. [2021-01-06 19:53:13,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:13,706 INFO L93 Difference]: Finished difference Result 20512 states and 30249 transitions. [2021-01-06 19:53:13,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:53:13,707 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2021-01-06 19:53:13,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:13,763 INFO L225 Difference]: With dead ends: 20512 [2021-01-06 19:53:13,763 INFO L226 Difference]: Without dead ends: 20510 [2021-01-06 19:53:13,768 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:53:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20510 states. [2021-01-06 19:53:14,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20510 to 12154. [2021-01-06 19:53:14,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12154 states. [2021-01-06 19:53:14,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12154 states to 12154 states and 17785 transitions. [2021-01-06 19:53:14,770 INFO L78 Accepts]: Start accepts. Automaton has 12154 states and 17785 transitions. Word has length 93 [2021-01-06 19:53:14,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:14,771 INFO L481 AbstractCegarLoop]: Abstraction has 12154 states and 17785 transitions. [2021-01-06 19:53:14,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:53:14,771 INFO L276 IsEmpty]: Start isEmpty. Operand 12154 states and 17785 transitions. [2021-01-06 19:53:14,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 19:53:14,772 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:14,772 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:14,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:53:14,773 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:14,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:14,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1252770917, now seen corresponding path program 1 times [2021-01-06 19:53:14,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:14,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000673763] [2021-01-06 19:53:14,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:14,835 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:53:14,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000673763] [2021-01-06 19:53:14,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:14,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:14,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41144579] [2021-01-06 19:53:14,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:14,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:14,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:14,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:14,838 INFO L87 Difference]: Start difference. First operand 12154 states and 17785 transitions. Second operand 3 states. [2021-01-06 19:53:16,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:16,034 INFO L93 Difference]: Finished difference Result 24449 states and 35967 transitions. [2021-01-06 19:53:16,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:16,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2021-01-06 19:53:16,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:16,162 INFO L225 Difference]: With dead ends: 24449 [2021-01-06 19:53:16,162 INFO L226 Difference]: Without dead ends: 17790 [2021-01-06 19:53:16,172 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:53:16,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17790 states. [2021-01-06 19:53:17,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17790 to 17788. [2021-01-06 19:53:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17788 states. [2021-01-06 19:53:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17788 states to 17788 states and 25915 transitions. [2021-01-06 19:53:17,264 INFO L78 Accepts]: Start accepts. Automaton has 17788 states and 25915 transitions. Word has length 94 [2021-01-06 19:53:17,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:17,264 INFO L481 AbstractCegarLoop]: Abstraction has 17788 states and 25915 transitions. [2021-01-06 19:53:17,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:17,265 INFO L276 IsEmpty]: Start isEmpty. Operand 17788 states and 25915 transitions. [2021-01-06 19:53:17,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 19:53:17,275 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:17,276 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:17,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:53:17,276 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:17,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:17,277 INFO L82 PathProgramCache]: Analyzing trace with hash -789894795, now seen corresponding path program 1 times [2021-01-06 19:53:17,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:17,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881736721] [2021-01-06 19:53:17,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-01-06 19:53:17,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881736721] [2021-01-06 19:53:17,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:17,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:53:17,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579979011] [2021-01-06 19:53:17,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:53:17,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:17,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:53:17,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:53:17,460 INFO L87 Difference]: Start difference. First operand 17788 states and 25915 transitions. Second operand 9 states. [2021-01-06 19:53:23,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:23,663 INFO L93 Difference]: Finished difference Result 145356 states and 211779 transitions. [2021-01-06 19:53:23,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:53:23,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2021-01-06 19:53:23,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:23,900 INFO L225 Difference]: With dead ends: 145356 [2021-01-06 19:53:23,900 INFO L226 Difference]: Without dead ends: 127626 [2021-01-06 19:53:23,953 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:53:24,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127626 states. [2021-01-06 19:53:27,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127626 to 35516. [2021-01-06 19:53:27,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35516 states. [2021-01-06 19:53:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35516 states to 35516 states and 51579 transitions. [2021-01-06 19:53:27,727 INFO L78 Accepts]: Start accepts. Automaton has 35516 states and 51579 transitions. Word has length 128 [2021-01-06 19:53:27,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:27,728 INFO L481 AbstractCegarLoop]: Abstraction has 35516 states and 51579 transitions. [2021-01-06 19:53:27,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:53:27,728 INFO L276 IsEmpty]: Start isEmpty. Operand 35516 states and 51579 transitions. [2021-01-06 19:53:27,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 19:53:27,743 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:27,744 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:27,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:53:27,744 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:27,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:27,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1736289685, now seen corresponding path program 1 times [2021-01-06 19:53:27,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:27,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358385413] [2021-01-06 19:53:27,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-01-06 19:53:28,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358385413] [2021-01-06 19:53:28,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:28,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:53:28,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173038788] [2021-01-06 19:53:28,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:53:28,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:28,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:53:28,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:53:28,147 INFO L87 Difference]: Start difference. First operand 35516 states and 51579 transitions. Second operand 9 states. [2021-01-06 19:53:35,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:35,987 INFO L93 Difference]: Finished difference Result 163084 states and 237443 transitions. [2021-01-06 19:53:35,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:53:35,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2021-01-06 19:53:35,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:36,182 INFO L225 Difference]: With dead ends: 163084 [2021-01-06 19:53:36,182 INFO L226 Difference]: Without dead ends: 145354 [2021-01-06 19:53:36,232 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:53:36,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145354 states. [2021-01-06 19:53:40,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145354 to 62140. [2021-01-06 19:53:40,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62140 states. [2021-01-06 19:53:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62140 states to 62140 states and 89915 transitions. [2021-01-06 19:53:40,799 INFO L78 Accepts]: Start accepts. Automaton has 62140 states and 89915 transitions. Word has length 128 [2021-01-06 19:53:40,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:40,799 INFO L481 AbstractCegarLoop]: Abstraction has 62140 states and 89915 transitions. [2021-01-06 19:53:40,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:53:40,800 INFO L276 IsEmpty]: Start isEmpty. Operand 62140 states and 89915 transitions. [2021-01-06 19:53:40,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 19:53:40,816 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:40,816 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:40,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:53:40,816 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:40,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:40,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1672184255, now seen corresponding path program 1 times [2021-01-06 19:53:40,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:40,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493738598] [2021-01-06 19:53:40,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-01-06 19:53:41,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493738598] [2021-01-06 19:53:41,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:41,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:53:41,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615470575] [2021-01-06 19:53:41,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:53:41,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:41,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:53:41,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:53:41,121 INFO L87 Difference]: Start difference. First operand 62140 states and 89915 transitions. Second operand 9 states. [2021-01-06 19:53:50,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:50,150 INFO L93 Difference]: Finished difference Result 180812 states and 263107 transitions. [2021-01-06 19:53:50,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:53:50,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2021-01-06 19:53:50,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:50,341 INFO L225 Difference]: With dead ends: 180812 [2021-01-06 19:53:50,341 INFO L226 Difference]: Without dead ends: 163082 [2021-01-06 19:53:50,382 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:53:50,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163082 states. [2021-01-06 19:53:56,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163082 to 79868. [2021-01-06 19:53:56,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79868 states. [2021-01-06 19:53:56,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79868 states to 79868 states and 115579 transitions. [2021-01-06 19:53:56,346 INFO L78 Accepts]: Start accepts. Automaton has 79868 states and 115579 transitions. Word has length 128 [2021-01-06 19:53:56,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:56,347 INFO L481 AbstractCegarLoop]: Abstraction has 79868 states and 115579 transitions. [2021-01-06 19:53:56,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:53:56,347 INFO L276 IsEmpty]: Start isEmpty. Operand 79868 states and 115579 transitions. [2021-01-06 19:53:56,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 19:53:56,364 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:56,365 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:56,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:53:56,365 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:56,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:56,366 INFO L82 PathProgramCache]: Analyzing trace with hash -803711393, now seen corresponding path program 1 times [2021-01-06 19:53:56,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:56,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911109858] [2021-01-06 19:53:56,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-06 19:53:56,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911109858] [2021-01-06 19:53:56,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:56,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:53:56,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195128732] [2021-01-06 19:53:56,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:53:56,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:56,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:53:56,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:53:56,538 INFO L87 Difference]: Start difference. First operand 79868 states and 115579 transitions. Second operand 9 states. [2021-01-06 19:54:07,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:07,745 INFO L93 Difference]: Finished difference Result 198540 states and 288771 transitions. [2021-01-06 19:54:07,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:54:07,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2021-01-06 19:54:07,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:07,965 INFO L225 Difference]: With dead ends: 198540 [2021-01-06 19:54:07,965 INFO L226 Difference]: Without dead ends: 180810 [2021-01-06 19:54:08,194 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:54:08,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180810 states. [2021-01-06 19:54:15,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180810 to 97596. [2021-01-06 19:54:15,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97596 states. [2021-01-06 19:54:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97596 states to 97596 states and 141243 transitions. [2021-01-06 19:54:15,611 INFO L78 Accepts]: Start accepts. Automaton has 97596 states and 141243 transitions. Word has length 128 [2021-01-06 19:54:15,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:15,611 INFO L481 AbstractCegarLoop]: Abstraction has 97596 states and 141243 transitions. [2021-01-06 19:54:15,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:54:15,612 INFO L276 IsEmpty]: Start isEmpty. Operand 97596 states and 141243 transitions. [2021-01-06 19:54:15,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 19:54:15,629 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:15,629 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:15,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:54:15,630 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:15,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:15,631 INFO L82 PathProgramCache]: Analyzing trace with hash -624305409, now seen corresponding path program 1 times [2021-01-06 19:54:15,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:15,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420437563] [2021-01-06 19:54:15,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 19:54:15,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420437563] [2021-01-06 19:54:15,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:15,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:54:15,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993492764] [2021-01-06 19:54:15,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:54:15,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:15,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:54:15,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:54:15,800 INFO L87 Difference]: Start difference. First operand 97596 states and 141243 transitions. Second operand 9 states. [2021-01-06 19:54:29,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:29,581 INFO L93 Difference]: Finished difference Result 216268 states and 314435 transitions. [2021-01-06 19:54:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:54:29,582 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2021-01-06 19:54:29,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:30,001 INFO L225 Difference]: With dead ends: 216268 [2021-01-06 19:54:30,001 INFO L226 Difference]: Without dead ends: 198538 [2021-01-06 19:54:30,046 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:54:30,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198538 states. [2021-01-06 19:54:39,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198538 to 115324. [2021-01-06 19:54:39,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115324 states. [2021-01-06 19:54:39,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115324 states to 115324 states and 166907 transitions. [2021-01-06 19:54:39,344 INFO L78 Accepts]: Start accepts. Automaton has 115324 states and 166907 transitions. Word has length 128 [2021-01-06 19:54:39,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:39,345 INFO L481 AbstractCegarLoop]: Abstraction has 115324 states and 166907 transitions. [2021-01-06 19:54:39,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:54:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand 115324 states and 166907 transitions. [2021-01-06 19:54:39,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 19:54:39,362 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:39,363 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:39,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:54:39,363 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:39,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:39,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1911033759, now seen corresponding path program 1 times [2021-01-06 19:54:39,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:39,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406683190] [2021-01-06 19:54:39,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:54:39,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406683190] [2021-01-06 19:54:39,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:39,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:54:39,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925699477] [2021-01-06 19:54:39,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:54:39,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:39,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:54:39,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:54:39,526 INFO L87 Difference]: Start difference. First operand 115324 states and 166907 transitions. Second operand 9 states. [2021-01-06 19:54:56,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:56,635 INFO L93 Difference]: Finished difference Result 233996 states and 340099 transitions. [2021-01-06 19:54:56,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:54:56,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2021-01-06 19:54:56,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:57,125 INFO L225 Difference]: With dead ends: 233996 [2021-01-06 19:54:57,125 INFO L226 Difference]: Without dead ends: 216266 [2021-01-06 19:54:57,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:54:57,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216266 states. [2021-01-06 19:55:09,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216266 to 133052. [2021-01-06 19:55:09,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133052 states. [2021-01-06 19:55:09,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133052 states to 133052 states and 192571 transitions. [2021-01-06 19:55:09,409 INFO L78 Accepts]: Start accepts. Automaton has 133052 states and 192571 transitions. Word has length 128 [2021-01-06 19:55:09,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:55:09,409 INFO L481 AbstractCegarLoop]: Abstraction has 133052 states and 192571 transitions. [2021-01-06 19:55:09,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:55:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 133052 states and 192571 transitions. [2021-01-06 19:55:09,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-01-06 19:55:09,431 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:55:09,431 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:09,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:55:09,431 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:55:09,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:55:09,432 INFO L82 PathProgramCache]: Analyzing trace with hash 21305626, now seen corresponding path program 1 times [2021-01-06 19:55:09,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:55:09,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943383267] [2021-01-06 19:55:09,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:55:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:55:09,827 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 19:55:09,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943383267] [2021-01-06 19:55:09,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:55:09,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:55:09,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307401339] [2021-01-06 19:55:09,829 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:55:09,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:55:09,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:55:09,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:55:09,830 INFO L87 Difference]: Start difference. First operand 133052 states and 192571 transitions. Second operand 9 states. [2021-01-06 19:55:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:55:29,747 INFO L93 Difference]: Finished difference Result 240844 states and 350147 transitions. [2021-01-06 19:55:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:55:29,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2021-01-06 19:55:29,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:55:30,243 INFO L225 Difference]: With dead ends: 240844 [2021-01-06 19:55:30,243 INFO L226 Difference]: Without dead ends: 228554 [2021-01-06 19:55:30,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:55:30,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228554 states. [2021-01-06 19:55:43,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228554 to 145340. [2021-01-06 19:55:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145340 states. [2021-01-06 19:55:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145340 states to 145340 states and 210491 transitions. [2021-01-06 19:55:43,983 INFO L78 Accepts]: Start accepts. Automaton has 145340 states and 210491 transitions. Word has length 130 [2021-01-06 19:55:43,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:55:43,983 INFO L481 AbstractCegarLoop]: Abstraction has 145340 states and 210491 transitions. [2021-01-06 19:55:43,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:55:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 145340 states and 210491 transitions. [2021-01-06 19:55:44,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-01-06 19:55:44,003 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:55:44,003 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:44,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:55:44,003 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:55:44,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:55:44,004 INFO L82 PathProgramCache]: Analyzing trace with hash -228882867, now seen corresponding path program 1 times [2021-01-06 19:55:44,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:55:44,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570969307] [2021-01-06 19:55:44,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:55:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:55:44,098 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:55:44,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570969307] [2021-01-06 19:55:44,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:55:44,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:55:44,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118909243] [2021-01-06 19:55:44,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:55:44,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:55:44,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:55:44,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:55:44,102 INFO L87 Difference]: Start difference. First operand 145340 states and 210491 transitions. Second operand 3 states. [2021-01-06 19:55:53,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:55:53,756 INFO L93 Difference]: Finished difference Result 249829 states and 362858 transitions. [2021-01-06 19:55:53,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:55:53,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2021-01-06 19:55:53,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:55:53,897 INFO L225 Difference]: With dead ends: 249829 [2021-01-06 19:55:53,897 INFO L226 Difference]: Without dead ends: 104547 [2021-01-06 19:55:53,976 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:55:54,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104547 states. [2021-01-06 19:56:03,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104547 to 104545. [2021-01-06 19:56:03,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104545 states. [2021-01-06 19:56:03,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104545 states to 104545 states and 151335 transitions. [2021-01-06 19:56:03,625 INFO L78 Accepts]: Start accepts. Automaton has 104545 states and 151335 transitions. Word has length 130 [2021-01-06 19:56:03,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:03,626 INFO L481 AbstractCegarLoop]: Abstraction has 104545 states and 151335 transitions. [2021-01-06 19:56:03,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:56:03,626 INFO L276 IsEmpty]: Start isEmpty. Operand 104545 states and 151335 transitions. [2021-01-06 19:56:03,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-06 19:56:03,824 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:03,824 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:03,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:56:03,833 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:03,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:03,833 INFO L82 PathProgramCache]: Analyzing trace with hash 17347787, now seen corresponding path program 1 times [2021-01-06 19:56:03,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:03,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353068583] [2021-01-06 19:56:03,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:56:03,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353068583] [2021-01-06 19:56:03,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:03,943 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:56:03,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280055541] [2021-01-06 19:56:03,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:56:03,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:03,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:56:03,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:56:03,948 INFO L87 Difference]: Start difference. First operand 104545 states and 151335 transitions. Second operand 3 states.