/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-dcfa08f [2020-12-23 09:59:28,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:59:28,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:59:28,441 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:59:28,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:59:28,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:59:28,445 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:59:28,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:59:28,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:59:28,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:59:28,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:59:28,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:59:28,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:59:28,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:59:28,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:59:28,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:59:28,462 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:59:28,463 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:59:28,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:59:28,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:59:28,470 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:59:28,471 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:59:28,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:59:28,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:59:28,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:59:28,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:59:28,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:59:28,492 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:59:28,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:59:28,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:59:28,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:59:28,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:59:28,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:59:28,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:59:28,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:59:28,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:59:28,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:59:28,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:59:28,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:59:28,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:59:28,503 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:59:28,504 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 09:59:28,540 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:59:28,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:59:28,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:59:28,545 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:59:28,546 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:59:28,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:59:28,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:59:28,547 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:59:28,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:59:28,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:59:28,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:59:28,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:59:28,548 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:59:28,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:59:28,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:59:28,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:59:28,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:59:28,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:59:28,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:59:28,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:59:28,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:59:28,550 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:59:28,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:59:28,551 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:59:28,551 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:59:28,552 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 09:59:28,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:59:28,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:59:28,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:59:28,939 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:59:28,940 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:59:28,941 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 [2020-12-23 09:59:29,033 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c7d46bba7/9237bd2b328741efae86b04b1ac17d35/FLAGc511118d6 [2020-12-23 09:59:29,802 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:59:29,802 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.UNBOUNDED.pals.c [2020-12-23 09:59:29,821 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c7d46bba7/9237bd2b328741efae86b04b1ac17d35/FLAGc511118d6 [2020-12-23 09:59:30,065 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c7d46bba7/9237bd2b328741efae86b04b1ac17d35 [2020-12-23 09:59:30,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:59:30,070 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:59:30,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:59:30,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:59:30,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:59:30,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:59:30" (1/1) ... [2020-12-23 09:59:30,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39b90ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:59:30, skipping insertion in model container [2020-12-23 09:59:30,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:59:30" (1/1) ... [2020-12-23 09:59:30,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:59:30,123 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,] [2020-12-23 09:59:30,385 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] [2020-12-23 09:59:30,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:59:30,401 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,] [2020-12-23 09:59:30,511 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] [2020-12-23 09:59:30,512 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:59:30,538 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:59:30,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:59:30 WrapperNode [2020-12-23 09:59:30,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:59:30,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:59:30,540 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:59:30,541 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:59:30,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:59:30" (1/1) ... [2020-12-23 09:59:30,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:59:30" (1/1) ... [2020-12-23 09:59:30,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:59:30,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:59:30,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:59:30,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:59:30,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:59:30" (1/1) ... [2020-12-23 09:59:30,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:59:30" (1/1) ... [2020-12-23 09:59:30,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:59:30" (1/1) ... [2020-12-23 09:59:30,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:59:30" (1/1) ... [2020-12-23 09:59:30,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:59:30" (1/1) ... [2020-12-23 09:59:30,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:59:30" (1/1) ... [2020-12-23 09:59:30,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:59:30" (1/1) ... [2020-12-23 09:59:30,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:59:30,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:59:30,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:59:30,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:59:30,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:59:30" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:59:30,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:59:30,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:59:30,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:59:30,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:59:31,714 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:59:31,714 INFO L299 CfgBuilder]: Removed 27 assume(true) statements. [2020-12-23 09:59:31,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:59:31 BoogieIcfgContainer [2020-12-23 09:59:31,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:59:31,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:59:31,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:59:31,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:59:31,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:59:30" (1/3) ... [2020-12-23 09:59:31,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5611114b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:59:31, skipping insertion in model container [2020-12-23 09:59:31,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:59:30" (2/3) ... [2020-12-23 09:59:31,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5611114b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:59:31, skipping insertion in model container [2020-12-23 09:59:31,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:59:31" (3/3) ... [2020-12-23 09:59:31,733 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c [2020-12-23 09:59:31,741 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:59:31,747 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 09:59:31,770 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 09:59:31,816 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:59:31,817 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:59:31,817 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:59:31,817 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:59:31,817 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:59:31,817 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:59:31,817 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:59:31,818 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:59:31,842 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2020-12-23 09:59:31,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-23 09:59:31,859 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:59:31,860 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] [2020-12-23 09:59:31,861 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:59:31,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:59:31,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1880075128, now seen corresponding path program 1 times [2020-12-23 09:59:31,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:59:31,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974544327] [2020-12-23 09:59:31,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:59:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:59:32,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:59:32,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974544327] [2020-12-23 09:59:32,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:59:32,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:59:32,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643974114] [2020-12-23 09:59:32,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 09:59:32,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:59:32,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 09:59:32,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 09:59:32,257 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 2 states. [2020-12-23 09:59:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:59:32,289 INFO L93 Difference]: Finished difference Result 199 states and 337 transitions. [2020-12-23 09:59:32,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 09:59:32,291 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 41 [2020-12-23 09:59:32,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:59:32,304 INFO L225 Difference]: With dead ends: 199 [2020-12-23 09:59:32,304 INFO L226 Difference]: Without dead ends: 125 [2020-12-23 09:59:32,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 09:59:32,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-12-23 09:59:32,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-12-23 09:59:32,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-12-23 09:59:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 216 transitions. [2020-12-23 09:59:32,362 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 216 transitions. Word has length 41 [2020-12-23 09:59:32,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:59:32,363 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 216 transitions. [2020-12-23 09:59:32,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 09:59:32,363 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 216 transitions. [2020-12-23 09:59:32,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-23 09:59:32,365 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:59:32,366 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] [2020-12-23 09:59:32,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:59:32,366 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:59:32,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:59:32,367 INFO L82 PathProgramCache]: Analyzing trace with hash 2020525382, now seen corresponding path program 1 times [2020-12-23 09:59:32,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:59:32,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422201347] [2020-12-23 09:59:32,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:59:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:59:32,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:59:32,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422201347] [2020-12-23 09:59:32,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:59:32,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:59:32,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113293044] [2020-12-23 09:59:32,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:59:32,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:59:32,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:59:32,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:59:32,549 INFO L87 Difference]: Start difference. First operand 125 states and 216 transitions. Second operand 5 states. [2020-12-23 09:59:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:59:32,748 INFO L93 Difference]: Finished difference Result 198 states and 330 transitions. [2020-12-23 09:59:32,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:59:32,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-12-23 09:59:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:59:32,754 INFO L225 Difference]: With dead ends: 198 [2020-12-23 09:59:32,754 INFO L226 Difference]: Without dead ends: 125 [2020-12-23 09:59:32,756 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:59:32,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-12-23 09:59:32,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-12-23 09:59:32,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-12-23 09:59:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 166 transitions. [2020-12-23 09:59:32,779 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 166 transitions. Word has length 41 [2020-12-23 09:59:32,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:59:32,779 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 166 transitions. [2020-12-23 09:59:32,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:59:32,780 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2020-12-23 09:59:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-12-23 09:59:32,786 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:59:32,786 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] [2020-12-23 09:59:32,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:59:32,787 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:59:32,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:59:32,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1655570070, now seen corresponding path program 1 times [2020-12-23 09:59:32,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:59:32,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199262039] [2020-12-23 09:59:32,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:59:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:59:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:59:32,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199262039] [2020-12-23 09:59:32,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:59:32,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:59:32,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761114077] [2020-12-23 09:59:32,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:59:32,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:59:32,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:59:32,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:59:32,995 INFO L87 Difference]: Start difference. First operand 125 states and 166 transitions. Second operand 3 states. [2020-12-23 09:59:33,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:59:33,029 INFO L93 Difference]: Finished difference Result 257 states and 376 transitions. [2020-12-23 09:59:33,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:59:33,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2020-12-23 09:59:33,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:59:33,036 INFO L225 Difference]: With dead ends: 257 [2020-12-23 09:59:33,037 INFO L226 Difference]: Without dead ends: 188 [2020-12-23 09:59:33,038 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:59:33,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-12-23 09:59:33,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2020-12-23 09:59:33,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-12-23 09:59:33,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 264 transitions. [2020-12-23 09:59:33,070 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 264 transitions. Word has length 90 [2020-12-23 09:59:33,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:59:33,070 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 264 transitions. [2020-12-23 09:59:33,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:59:33,071 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 264 transitions. [2020-12-23 09:59:33,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-12-23 09:59:33,077 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:59:33,079 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] [2020-12-23 09:59:33,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:59:33,079 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:59:33,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:59:33,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1317776928, now seen corresponding path program 1 times [2020-12-23 09:59:33,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:59:33,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699989359] [2020-12-23 09:59:33,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:59:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:59:33,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:59:33,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699989359] [2020-12-23 09:59:33,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:59:33,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:59:33,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31592953] [2020-12-23 09:59:33,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:59:33,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:59:33,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:59:33,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:59:33,280 INFO L87 Difference]: Start difference. First operand 186 states and 264 transitions. Second operand 3 states. [2020-12-23 09:59:33,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:59:33,307 INFO L93 Difference]: Finished difference Result 434 states and 660 transitions. [2020-12-23 09:59:33,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:59:33,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2020-12-23 09:59:33,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:59:33,310 INFO L225 Difference]: With dead ends: 434 [2020-12-23 09:59:33,310 INFO L226 Difference]: Without dead ends: 304 [2020-12-23 09:59:33,311 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:59:33,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-12-23 09:59:33,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 302. [2020-12-23 09:59:33,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-12-23 09:59:33,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 449 transitions. [2020-12-23 09:59:33,351 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 449 transitions. Word has length 90 [2020-12-23 09:59:33,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:59:33,352 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 449 transitions. [2020-12-23 09:59:33,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:59:33,352 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 449 transitions. [2020-12-23 09:59:33,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-12-23 09:59:33,353 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:59:33,354 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] [2020-12-23 09:59:33,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:59:33,354 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:59:33,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:59:33,355 INFO L82 PathProgramCache]: Analyzing trace with hash -99791530, now seen corresponding path program 1 times [2020-12-23 09:59:33,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:59:33,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982581128] [2020-12-23 09:59:33,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:59:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:59:33,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:59:33,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982581128] [2020-12-23 09:59:33,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:59:33,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 09:59:33,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270639876] [2020-12-23 09:59:33,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 09:59:33,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:59:33,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 09:59:33,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:59:33,666 INFO L87 Difference]: Start difference. First operand 302 states and 449 transitions. Second operand 9 states. [2020-12-23 09:59:34,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:59:34,190 INFO L93 Difference]: Finished difference Result 3746 states and 5951 transitions. [2020-12-23 09:59:34,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 09:59:34,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2020-12-23 09:59:34,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:59:34,210 INFO L225 Difference]: With dead ends: 3746 [2020-12-23 09:59:34,211 INFO L226 Difference]: Without dead ends: 3500 [2020-12-23 09:59:34,214 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2020-12-23 09:59:34,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3500 states. [2020-12-23 09:59:34,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3500 to 546. [2020-12-23 09:59:34,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2020-12-23 09:59:34,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 833 transitions. [2020-12-23 09:59:34,278 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 833 transitions. Word has length 90 [2020-12-23 09:59:34,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:59:34,279 INFO L481 AbstractCegarLoop]: Abstraction has 546 states and 833 transitions. [2020-12-23 09:59:34,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 09:59:34,279 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 833 transitions. [2020-12-23 09:59:34,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 09:59:34,280 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:59:34,281 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] [2020-12-23 09:59:34,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:59:34,281 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:59:34,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:59:34,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1468897702, now seen corresponding path program 1 times [2020-12-23 09:59:34,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:59:34,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221212722] [2020-12-23 09:59:34,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:59:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:59:34,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:59:34,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221212722] [2020-12-23 09:59:34,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:59:34,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:59:34,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496647915] [2020-12-23 09:59:34,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:59:34,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:59:34,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:59:34,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:59:34,383 INFO L87 Difference]: Start difference. First operand 546 states and 833 transitions. Second operand 3 states. [2020-12-23 09:59:34,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:59:34,454 INFO L93 Difference]: Finished difference Result 1482 states and 2311 transitions. [2020-12-23 09:59:34,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:59:34,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-12-23 09:59:34,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:59:34,460 INFO L225 Difference]: With dead ends: 1482 [2020-12-23 09:59:34,460 INFO L226 Difference]: Without dead ends: 992 [2020-12-23 09:59:34,462 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:59:34,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2020-12-23 09:59:34,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 982. [2020-12-23 09:59:34,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2020-12-23 09:59:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1505 transitions. [2020-12-23 09:59:34,524 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1505 transitions. Word has length 92 [2020-12-23 09:59:34,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:59:34,524 INFO L481 AbstractCegarLoop]: Abstraction has 982 states and 1505 transitions. [2020-12-23 09:59:34,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:59:34,524 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1505 transitions. [2020-12-23 09:59:34,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 09:59:34,526 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:59:34,526 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] [2020-12-23 09:59:34,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:59:34,526 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:59:34,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:59:34,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1535391214, now seen corresponding path program 1 times [2020-12-23 09:59:34,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:59:34,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738415339] [2020-12-23 09:59:34,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:59:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:59:34,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:59:34,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738415339] [2020-12-23 09:59:34,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:59:34,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 09:59:34,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592920919] [2020-12-23 09:59:34,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 09:59:34,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:59:34,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 09:59:34,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:59:34,936 INFO L87 Difference]: Start difference. First operand 982 states and 1505 transitions. Second operand 9 states. [2020-12-23 09:59:35,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:59:35,362 INFO L93 Difference]: Finished difference Result 2372 states and 3684 transitions. [2020-12-23 09:59:35,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 09:59:35,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2020-12-23 09:59:35,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:59:35,372 INFO L225 Difference]: With dead ends: 2372 [2020-12-23 09:59:35,372 INFO L226 Difference]: Without dead ends: 1446 [2020-12-23 09:59:35,375 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:59:35,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2020-12-23 09:59:35,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 982. [2020-12-23 09:59:35,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2020-12-23 09:59:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1497 transitions. [2020-12-23 09:59:35,446 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1497 transitions. Word has length 92 [2020-12-23 09:59:35,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:59:35,446 INFO L481 AbstractCegarLoop]: Abstraction has 982 states and 1497 transitions. [2020-12-23 09:59:35,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 09:59:35,446 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1497 transitions. [2020-12-23 09:59:35,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 09:59:35,448 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:59:35,448 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] [2020-12-23 09:59:35,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:59:35,448 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:59:35,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:59:35,449 INFO L82 PathProgramCache]: Analyzing trace with hash 550533322, now seen corresponding path program 1 times [2020-12-23 09:59:35,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:59:35,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477854552] [2020-12-23 09:59:35,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:59:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:59:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:59:35,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477854552] [2020-12-23 09:59:35,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:59:35,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:59:35,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994026828] [2020-12-23 09:59:35,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:59:35,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:59:35,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:59:35,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:59:35,549 INFO L87 Difference]: Start difference. First operand 982 states and 1497 transitions. Second operand 3 states. [2020-12-23 09:59:35,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:59:35,671 INFO L93 Difference]: Finished difference Result 2738 states and 4219 transitions. [2020-12-23 09:59:35,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:59:35,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-12-23 09:59:35,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:59:35,682 INFO L225 Difference]: With dead ends: 2738 [2020-12-23 09:59:35,682 INFO L226 Difference]: Without dead ends: 1812 [2020-12-23 09:59:35,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:59:35,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2020-12-23 09:59:35,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1810. [2020-12-23 09:59:35,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1810 states. [2020-12-23 09:59:35,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2761 transitions. [2020-12-23 09:59:35,868 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2761 transitions. Word has length 92 [2020-12-23 09:59:35,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:59:35,868 INFO L481 AbstractCegarLoop]: Abstraction has 1810 states and 2761 transitions. [2020-12-23 09:59:35,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:59:35,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2761 transitions. [2020-12-23 09:59:35,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 09:59:35,870 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:59:35,870 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] [2020-12-23 09:59:35,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:59:35,870 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:59:35,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:59:35,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1925362326, now seen corresponding path program 1 times [2020-12-23 09:59:35,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:59:35,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528092245] [2020-12-23 09:59:35,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:59:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:59:35,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:59:35,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528092245] [2020-12-23 09:59:35,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:59:35,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:59:35,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613462322] [2020-12-23 09:59:35,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:59:35,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:59:35,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:59:35,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:59:35,977 INFO L87 Difference]: Start difference. First operand 1810 states and 2761 transitions. Second operand 3 states. [2020-12-23 09:59:36,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:59:36,232 INFO L93 Difference]: Finished difference Result 5126 states and 7851 transitions. [2020-12-23 09:59:36,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:59:36,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-12-23 09:59:36,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:59:36,250 INFO L225 Difference]: With dead ends: 5126 [2020-12-23 09:59:36,251 INFO L226 Difference]: Without dead ends: 3372 [2020-12-23 09:59:36,257 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:59:36,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3372 states. [2020-12-23 09:59:36,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 3370. [2020-12-23 09:59:36,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3370 states. [2020-12-23 09:59:36,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 5113 transitions. [2020-12-23 09:59:36,526 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 5113 transitions. Word has length 92 [2020-12-23 09:59:36,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:59:36,527 INFO L481 AbstractCegarLoop]: Abstraction has 3370 states and 5113 transitions. [2020-12-23 09:59:36,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:59:36,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 5113 transitions. [2020-12-23 09:59:36,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 09:59:36,528 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:59:36,529 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:59:36,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:59:36,529 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:59:36,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:59:36,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1745956342, now seen corresponding path program 1 times [2020-12-23 09:59:36,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:59:36,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122821153] [2020-12-23 09:59:36,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:59:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:59:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:59:36,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122821153] [2020-12-23 09:59:36,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:59:36,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:59:36,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031693744] [2020-12-23 09:59:36,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:59:36,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:59:36,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:59:36,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:59:36,610 INFO L87 Difference]: Start difference. First operand 3370 states and 5113 transitions. Second operand 3 states. [2020-12-23 09:59:37,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:59:37,048 INFO L93 Difference]: Finished difference Result 9614 states and 14587 transitions. [2020-12-23 09:59:37,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:59:37,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-12-23 09:59:37,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:59:37,084 INFO L225 Difference]: With dead ends: 9614 [2020-12-23 09:59:37,084 INFO L226 Difference]: Without dead ends: 6300 [2020-12-23 09:59:37,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:59:37,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6300 states. [2020-12-23 09:59:37,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6300 to 6298. [2020-12-23 09:59:37,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6298 states. [2020-12-23 09:59:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6298 states to 6298 states and 9465 transitions. [2020-12-23 09:59:37,593 INFO L78 Accepts]: Start accepts. Automaton has 6298 states and 9465 transitions. Word has length 92 [2020-12-23 09:59:37,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:59:37,594 INFO L481 AbstractCegarLoop]: Abstraction has 6298 states and 9465 transitions. [2020-12-23 09:59:37,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:59:37,594 INFO L276 IsEmpty]: Start isEmpty. Operand 6298 states and 9465 transitions. [2020-12-23 09:59:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 09:59:37,595 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:59:37,595 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] [2020-12-23 09:59:37,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:59:37,596 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:59:37,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:59:37,596 INFO L82 PathProgramCache]: Analyzing trace with hash 789382826, now seen corresponding path program 1 times [2020-12-23 09:59:37,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:59:37,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638392663] [2020-12-23 09:59:37,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:59:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:59:37,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:59:37,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638392663] [2020-12-23 09:59:37,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:59:37,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:59:37,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736491321] [2020-12-23 09:59:37,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:59:37,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:59:37,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:59:37,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:59:37,675 INFO L87 Difference]: Start difference. First operand 6298 states and 9465 transitions. Second operand 3 states. [2020-12-23 09:59:38,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:59:38,487 INFO L93 Difference]: Finished difference Result 18014 states and 27003 transitions. [2020-12-23 09:59:38,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:59:38,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-12-23 09:59:38,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:59:38,552 INFO L225 Difference]: With dead ends: 18014 [2020-12-23 09:59:38,552 INFO L226 Difference]: Without dead ends: 11772 [2020-12-23 09:59:38,561 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:59:38,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11772 states. [2020-12-23 09:59:39,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11772 to 11770. [2020-12-23 09:59:39,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11770 states. [2020-12-23 09:59:39,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11770 states to 11770 states and 17465 transitions. [2020-12-23 09:59:39,440 INFO L78 Accepts]: Start accepts. Automaton has 11770 states and 17465 transitions. Word has length 92 [2020-12-23 09:59:39,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:59:39,440 INFO L481 AbstractCegarLoop]: Abstraction has 11770 states and 17465 transitions. [2020-12-23 09:59:39,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:59:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 11770 states and 17465 transitions. [2020-12-23 09:59:39,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-12-23 09:59:39,441 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:59:39,442 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] [2020-12-23 09:59:39,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:59:39,442 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:59:39,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:59:39,443 INFO L82 PathProgramCache]: Analyzing trace with hash -62235482, now seen corresponding path program 1 times [2020-12-23 09:59:39,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:59:39,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270532507] [2020-12-23 09:59:39,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:59:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:59:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:59:39,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270532507] [2020-12-23 09:59:39,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:59:39,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:59:39,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227169924] [2020-12-23 09:59:39,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:59:39,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:59:39,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:59:39,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:59:39,593 INFO L87 Difference]: Start difference. First operand 11770 states and 17465 transitions. Second operand 8 states. [2020-12-23 09:59:41,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:59:41,359 INFO L93 Difference]: Finished difference Result 20512 states and 30249 transitions. [2020-12-23 09:59:41,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 09:59:41,360 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2020-12-23 09:59:41,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:59:41,414 INFO L225 Difference]: With dead ends: 20512 [2020-12-23 09:59:41,414 INFO L226 Difference]: Without dead ends: 20510 [2020-12-23 09:59:41,423 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 [2020-12-23 09:59:41,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20510 states. [2020-12-23 09:59:42,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20510 to 12154. [2020-12-23 09:59:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12154 states. [2020-12-23 09:59:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12154 states to 12154 states and 17785 transitions. [2020-12-23 09:59:42,364 INFO L78 Accepts]: Start accepts. Automaton has 12154 states and 17785 transitions. Word has length 93 [2020-12-23 09:59:42,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:59:42,365 INFO L481 AbstractCegarLoop]: Abstraction has 12154 states and 17785 transitions. [2020-12-23 09:59:42,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:59:42,365 INFO L276 IsEmpty]: Start isEmpty. Operand 12154 states and 17785 transitions. [2020-12-23 09:59:42,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-23 09:59:42,366 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:59:42,366 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] [2020-12-23 09:59:42,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:59:42,367 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:59:42,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:59:42,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1252770917, now seen corresponding path program 1 times [2020-12-23 09:59:42,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:59:42,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913826090] [2020-12-23 09:59:42,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:59:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:59:42,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:59:42,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913826090] [2020-12-23 09:59:42,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:59:42,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:59:42,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889460552] [2020-12-23 09:59:42,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:59:42,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:59:42,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:59:42,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:59:42,432 INFO L87 Difference]: Start difference. First operand 12154 states and 17785 transitions. Second operand 3 states. [2020-12-23 09:59:43,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:59:43,695 INFO L93 Difference]: Finished difference Result 24449 states and 35967 transitions. [2020-12-23 09:59:43,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:59:43,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-12-23 09:59:43,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:59:43,732 INFO L225 Difference]: With dead ends: 24449 [2020-12-23 09:59:43,733 INFO L226 Difference]: Without dead ends: 17790 [2020-12-23 09:59:43,749 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:59:43,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17790 states. [2020-12-23 09:59:45,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17790 to 17788. [2020-12-23 09:59:45,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17788 states. [2020-12-23 09:59:45,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17788 states to 17788 states and 25915 transitions. [2020-12-23 09:59:45,381 INFO L78 Accepts]: Start accepts. Automaton has 17788 states and 25915 transitions. Word has length 94 [2020-12-23 09:59:45,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:59:45,382 INFO L481 AbstractCegarLoop]: Abstraction has 17788 states and 25915 transitions. [2020-12-23 09:59:45,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:59:45,382 INFO L276 IsEmpty]: Start isEmpty. Operand 17788 states and 25915 transitions. [2020-12-23 09:59:45,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-12-23 09:59:45,395 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:59:45,396 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] [2020-12-23 09:59:45,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:59:45,396 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:59:45,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:59:45,397 INFO L82 PathProgramCache]: Analyzing trace with hash -789894795, now seen corresponding path program 1 times [2020-12-23 09:59:45,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:59:45,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367542149] [2020-12-23 09:59:45,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:59:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:59:45,685 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-12-23 09:59:45,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367542149] [2020-12-23 09:59:45,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:59:45,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 09:59:45,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409223531] [2020-12-23 09:59:45,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 09:59:45,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:59:45,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 09:59:45,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:59:45,688 INFO L87 Difference]: Start difference. First operand 17788 states and 25915 transitions. Second operand 9 states. [2020-12-23 09:59:51,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:59:51,885 INFO L93 Difference]: Finished difference Result 145356 states and 211779 transitions. [2020-12-23 09:59:51,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 09:59:51,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2020-12-23 09:59:51,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:59:52,310 INFO L225 Difference]: With dead ends: 145356 [2020-12-23 09:59:52,310 INFO L226 Difference]: Without dead ends: 127626 [2020-12-23 09:59:52,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2020-12-23 09:59:52,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127626 states. [2020-12-23 09:59:55,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127626 to 35516. [2020-12-23 09:59:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35516 states. [2020-12-23 09:59:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35516 states to 35516 states and 51579 transitions. [2020-12-23 09:59:55,813 INFO L78 Accepts]: Start accepts. Automaton has 35516 states and 51579 transitions. Word has length 128 [2020-12-23 09:59:55,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:59:55,814 INFO L481 AbstractCegarLoop]: Abstraction has 35516 states and 51579 transitions. [2020-12-23 09:59:55,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 09:59:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 35516 states and 51579 transitions. [2020-12-23 09:59:55,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-12-23 09:59:55,827 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:59:55,827 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] [2020-12-23 09:59:55,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:59:55,828 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:59:55,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:59:55,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1736289685, now seen corresponding path program 1 times [2020-12-23 09:59:55,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:59:55,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365942473] [2020-12-23 09:59:55,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:59:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:59:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-12-23 09:59:56,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365942473] [2020-12-23 09:59:56,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:59:56,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 09:59:56,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473931580] [2020-12-23 09:59:56,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 09:59:56,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:59:56,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 09:59:56,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:59:56,169 INFO L87 Difference]: Start difference. First operand 35516 states and 51579 transitions. Second operand 9 states. [2020-12-23 10:00:04,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:00:04,317 INFO L93 Difference]: Finished difference Result 163084 states and 237443 transitions. [2020-12-23 10:00:04,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 10:00:04,318 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2020-12-23 10:00:04,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:00:04,543 INFO L225 Difference]: With dead ends: 163084 [2020-12-23 10:00:04,544 INFO L226 Difference]: Without dead ends: 145354 [2020-12-23 10:00:04,605 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 [2020-12-23 10:00:04,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145354 states. [2020-12-23 10:00:09,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145354 to 62140. [2020-12-23 10:00:09,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62140 states. [2020-12-23 10:00:09,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62140 states to 62140 states and 89915 transitions. [2020-12-23 10:00:09,237 INFO L78 Accepts]: Start accepts. Automaton has 62140 states and 89915 transitions. Word has length 128 [2020-12-23 10:00:09,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:00:09,237 INFO L481 AbstractCegarLoop]: Abstraction has 62140 states and 89915 transitions. [2020-12-23 10:00:09,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 10:00:09,237 INFO L276 IsEmpty]: Start isEmpty. Operand 62140 states and 89915 transitions. [2020-12-23 10:00:09,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-12-23 10:00:09,254 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:00:09,254 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] [2020-12-23 10:00:09,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 10:00:09,254 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:00:09,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:00:09,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1672184255, now seen corresponding path program 1 times [2020-12-23 10:00:09,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:00:09,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618623677] [2020-12-23 10:00:09,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:00:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:00:09,431 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 10:00:09,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618623677] [2020-12-23 10:00:09,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:00:09,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 10:00:09,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729897267] [2020-12-23 10:00:09,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 10:00:09,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:00:09,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 10:00:09,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-23 10:00:09,433 INFO L87 Difference]: Start difference. First operand 62140 states and 89915 transitions. Second operand 9 states. [2020-12-23 10:00:19,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:00:19,100 INFO L93 Difference]: Finished difference Result 180812 states and 263107 transitions. [2020-12-23 10:00:19,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 10:00:19,101 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2020-12-23 10:00:19,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:00:19,469 INFO L225 Difference]: With dead ends: 180812 [2020-12-23 10:00:19,469 INFO L226 Difference]: Without dead ends: 163082 [2020-12-23 10:00:19,505 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 [2020-12-23 10:00:19,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163082 states. [2020-12-23 10:00:25,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163082 to 79868. [2020-12-23 10:00:25,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79868 states. [2020-12-23 10:00:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79868 states to 79868 states and 115579 transitions. [2020-12-23 10:00:25,586 INFO L78 Accepts]: Start accepts. Automaton has 79868 states and 115579 transitions. Word has length 128 [2020-12-23 10:00:25,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:00:25,586 INFO L481 AbstractCegarLoop]: Abstraction has 79868 states and 115579 transitions. [2020-12-23 10:00:25,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 10:00:25,586 INFO L276 IsEmpty]: Start isEmpty. Operand 79868 states and 115579 transitions. [2020-12-23 10:00:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-12-23 10:00:25,602 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:00:25,603 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] [2020-12-23 10:00:25,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 10:00:25,604 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:00:25,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:00:25,604 INFO L82 PathProgramCache]: Analyzing trace with hash -803711393, now seen corresponding path program 1 times [2020-12-23 10:00:25,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:00:25,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889302169] [2020-12-23 10:00:25,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:00:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:00:25,804 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-23 10:00:25,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889302169] [2020-12-23 10:00:25,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:00:25,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 10:00:25,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424384290] [2020-12-23 10:00:25,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 10:00:25,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:00:25,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 10:00:25,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-23 10:00:25,807 INFO L87 Difference]: Start difference. First operand 79868 states and 115579 transitions. Second operand 9 states. [2020-12-23 10:00:37,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:00:37,246 INFO L93 Difference]: Finished difference Result 198540 states and 288771 transitions. [2020-12-23 10:00:37,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 10:00:37,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2020-12-23 10:00:37,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:00:37,479 INFO L225 Difference]: With dead ends: 198540 [2020-12-23 10:00:37,480 INFO L226 Difference]: Without dead ends: 180810 [2020-12-23 10:00:37,711 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 [2020-12-23 10:00:37,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180810 states. [2020-12-23 10:00:44,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180810 to 97596. [2020-12-23 10:00:44,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97596 states. [2020-12-23 10:00:45,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97596 states to 97596 states and 141243 transitions. [2020-12-23 10:00:45,049 INFO L78 Accepts]: Start accepts. Automaton has 97596 states and 141243 transitions. Word has length 128 [2020-12-23 10:00:45,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:00:45,050 INFO L481 AbstractCegarLoop]: Abstraction has 97596 states and 141243 transitions. [2020-12-23 10:00:45,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 10:00:45,050 INFO L276 IsEmpty]: Start isEmpty. Operand 97596 states and 141243 transitions. [2020-12-23 10:00:45,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-12-23 10:00:45,064 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:00:45,065 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] [2020-12-23 10:00:45,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 10:00:45,065 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:00:45,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:00:45,065 INFO L82 PathProgramCache]: Analyzing trace with hash -624305409, now seen corresponding path program 1 times [2020-12-23 10:00:45,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:00:45,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388500358] [2020-12-23 10:00:45,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:00:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:00:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-23 10:00:45,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388500358] [2020-12-23 10:00:45,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:00:45,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 10:00:45,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981760244] [2020-12-23 10:00:45,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 10:00:45,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:00:45,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 10:00:45,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-23 10:00:45,241 INFO L87 Difference]: Start difference. First operand 97596 states and 141243 transitions. Second operand 9 states. [2020-12-23 10:00:59,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:00:59,451 INFO L93 Difference]: Finished difference Result 216268 states and 314435 transitions. [2020-12-23 10:00:59,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 10:00:59,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2020-12-23 10:00:59,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:00:59,914 INFO L225 Difference]: With dead ends: 216268 [2020-12-23 10:00:59,914 INFO L226 Difference]: Without dead ends: 198538 [2020-12-23 10:00:59,963 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 [2020-12-23 10:01:00,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198538 states. [2020-12-23 10:01:09,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198538 to 115324. [2020-12-23 10:01:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115324 states. [2020-12-23 10:01:09,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115324 states to 115324 states and 166907 transitions. [2020-12-23 10:01:09,647 INFO L78 Accepts]: Start accepts. Automaton has 115324 states and 166907 transitions. Word has length 128 [2020-12-23 10:01:09,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:09,647 INFO L481 AbstractCegarLoop]: Abstraction has 115324 states and 166907 transitions. [2020-12-23 10:01:09,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 10:01:09,647 INFO L276 IsEmpty]: Start isEmpty. Operand 115324 states and 166907 transitions. [2020-12-23 10:01:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-12-23 10:01:09,662 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:09,662 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] [2020-12-23 10:01:09,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 10:01:09,662 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:09,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:09,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1911033759, now seen corresponding path program 1 times [2020-12-23 10:01:09,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:09,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890097153] [2020-12-23 10:01:09,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:09,838 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 10:01:09,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890097153] [2020-12-23 10:01:09,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:09,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 10:01:09,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346259574] [2020-12-23 10:01:09,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 10:01:09,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:09,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 10:01:09,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-23 10:01:09,842 INFO L87 Difference]: Start difference. First operand 115324 states and 166907 transitions. Second operand 9 states. [2020-12-23 10:01:27,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:01:27,370 INFO L93 Difference]: Finished difference Result 233996 states and 340099 transitions. [2020-12-23 10:01:27,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 10:01:27,370 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2020-12-23 10:01:27,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:01:27,888 INFO L225 Difference]: With dead ends: 233996 [2020-12-23 10:01:27,888 INFO L226 Difference]: Without dead ends: 216266 [2020-12-23 10:01:27,949 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 [2020-12-23 10:01:28,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216266 states. [2020-12-23 10:01:39,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216266 to 133052. [2020-12-23 10:01:39,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133052 states. [2020-12-23 10:01:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133052 states to 133052 states and 192571 transitions. [2020-12-23 10:01:39,853 INFO L78 Accepts]: Start accepts. Automaton has 133052 states and 192571 transitions. Word has length 128 [2020-12-23 10:01:39,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:01:39,854 INFO L481 AbstractCegarLoop]: Abstraction has 133052 states and 192571 transitions. [2020-12-23 10:01:39,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 10:01:39,854 INFO L276 IsEmpty]: Start isEmpty. Operand 133052 states and 192571 transitions. [2020-12-23 10:01:39,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-12-23 10:01:39,873 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:01:39,874 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] [2020-12-23 10:01:39,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 10:01:39,874 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:01:39,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:01:39,875 INFO L82 PathProgramCache]: Analyzing trace with hash 21305626, now seen corresponding path program 1 times [2020-12-23 10:01:39,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:01:39,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126502040] [2020-12-23 10:01:39,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:01:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:01:40,318 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 10:01:40,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126502040] [2020-12-23 10:01:40,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:01:40,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 10:01:40,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678190814] [2020-12-23 10:01:40,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 10:01:40,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:01:40,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 10:01:40,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-23 10:01:40,324 INFO L87 Difference]: Start difference. First operand 133052 states and 192571 transitions. Second operand 9 states. [2020-12-23 10:02:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 10:02:00,701 INFO L93 Difference]: Finished difference Result 240844 states and 350147 transitions. [2020-12-23 10:02:00,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 10:02:00,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2020-12-23 10:02:00,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 10:02:01,218 INFO L225 Difference]: With dead ends: 240844 [2020-12-23 10:02:01,219 INFO L226 Difference]: Without dead ends: 228554 [2020-12-23 10:02:01,266 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 [2020-12-23 10:02:01,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228554 states. [2020-12-23 10:02:14,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228554 to 145340. [2020-12-23 10:02:14,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145340 states. [2020-12-23 10:02:15,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145340 states to 145340 states and 210491 transitions. [2020-12-23 10:02:15,310 INFO L78 Accepts]: Start accepts. Automaton has 145340 states and 210491 transitions. Word has length 130 [2020-12-23 10:02:15,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 10:02:15,311 INFO L481 AbstractCegarLoop]: Abstraction has 145340 states and 210491 transitions. [2020-12-23 10:02:15,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 10:02:15,311 INFO L276 IsEmpty]: Start isEmpty. Operand 145340 states and 210491 transitions. [2020-12-23 10:02:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-12-23 10:02:15,333 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 10:02:15,333 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] [2020-12-23 10:02:15,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 10:02:15,333 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 10:02:15,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 10:02:15,334 INFO L82 PathProgramCache]: Analyzing trace with hash -228882867, now seen corresponding path program 1 times [2020-12-23 10:02:15,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 10:02:15,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689785655] [2020-12-23 10:02:15,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 10:02:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 10:02:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 10:02:15,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689785655] [2020-12-23 10:02:15,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 10:02:15,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 10:02:15,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463151779] [2020-12-23 10:02:15,655 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 10:02:15,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 10:02:15,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 10:02:15,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 10:02:15,656 INFO L87 Difference]: Start difference. First operand 145340 states and 210491 transitions. Second operand 3 states.