/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_overflow.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:53:49,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:53:49,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:53:49,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:53:49,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:53:49,942 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:53:49,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:53:49,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:53:49,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:53:49,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:53:49,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:53:49,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:53:49,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:53:49,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:53:49,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:53:49,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:53:49,986 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:53:49,987 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:53:49,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:53:50,002 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:53:50,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:53:50,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:53:50,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:53:50,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:53:50,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:53:50,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:53:50,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:53:50,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:53:50,026 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:53:50,027 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:53:50,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:53:50,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:53:50,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:53:50,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:53:50,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:53:50,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:53:50,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:53:50,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:53:50,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:53:50,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:53:50,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:53:50,046 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:53:50,096 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:53:50,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:53:50,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:53:50,101 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:53:50,101 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:53:50,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:53:50,102 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:53:50,102 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:53:50,102 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:53:50,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:53:50,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:53:50,104 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:53:50,104 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:53:50,104 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:53:50,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:53:50,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:53:50,105 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:53:50,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:53:50,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:53:50,106 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:53:50,106 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:53:50,107 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:53:50,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:53:50,107 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:53:50,107 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:53:50,107 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 19:53:50,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:53:50,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:53:50,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:53:50,562 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:53:50,563 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:53:50,564 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_overflow.ufo.UNBOUNDED.pals.c [2021-01-06 19:53:50,652 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/66962b03b/0f75cc6e0ad841fbbb6d1e9481fe7ccd/FLAG237e3a2c8 [2021-01-06 19:53:51,266 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:53:51,267 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c [2021-01-06 19:53:51,282 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/66962b03b/0f75cc6e0ad841fbbb6d1e9481fe7ccd/FLAG237e3a2c8 [2021-01-06 19:53:51,573 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/66962b03b/0f75cc6e0ad841fbbb6d1e9481fe7ccd [2021-01-06 19:53:51,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:53:51,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:53:51,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:53:51,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:53:51,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:53:51,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:53:51" (1/1) ... [2021-01-06 19:53:51,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d3a47f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:51, skipping insertion in model container [2021-01-06 19:53:51,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:53:51" (1/1) ... [2021-01-06 19:53:51,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:53:51,640 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[~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[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2021-01-06 19:53:51,899 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_overflow.ufo.UNBOUNDED.pals.c[20121,20134] [2021-01-06 19:53:51,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:53:51,915 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[~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[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~m2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~m3~0,] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~m4~0,] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~m5~0,] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~m6~0,] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~m7~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~id7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~i2~0,] left hand side expression in assignment: lhs: VariableLHS[~p1_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p2_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p3_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p4_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p5_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p7_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c1~0,] [2021-01-06 19:53:51,995 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_overflow.ufo.UNBOUNDED.pals.c[20121,20134] [2021-01-06 19:53:51,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:53:52,019 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:53:52,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:52 WrapperNode [2021-01-06 19:53:52,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:53:52,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:53:52,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:53:52,021 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:53:52,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:52" (1/1) ... [2021-01-06 19:53:52,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:52" (1/1) ... [2021-01-06 19:53:52,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:53:52,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:53:52,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:53:52,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:53:52,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:52" (1/1) ... [2021-01-06 19:53:52,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:52" (1/1) ... [2021-01-06 19:53:52,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:52" (1/1) ... [2021-01-06 19:53:52,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:52" (1/1) ... [2021-01-06 19:53:52,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:52" (1/1) ... [2021-01-06 19:53:52,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:52" (1/1) ... [2021-01-06 19:53:52,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:52" (1/1) ... [2021-01-06 19:53:52,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:53:52,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:53:52,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:53:52,185 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:53:52,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:52" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:53:52,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:53:52,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:53:52,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:53:52,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:53:53,031 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:53:53,032 INFO L299 CfgBuilder]: Removed 27 assume(true) statements. [2021-01-06 19:53:53,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:53:53 BoogieIcfgContainer [2021-01-06 19:53:53,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:53:53,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:53:53,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:53:53,041 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:53:53,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:53:51" (1/3) ... [2021-01-06 19:53:53,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f168ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:53:53, skipping insertion in model container [2021-01-06 19:53:53,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:53:52" (2/3) ... [2021-01-06 19:53:53,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49f168ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:53:53, skipping insertion in model container [2021-01-06 19:53:53,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:53:53" (3/3) ... [2021-01-06 19:53:53,045 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c [2021-01-06 19:53:53,053 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:53:53,059 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:53:53,080 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:53:53,110 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:53:53,110 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:53:53,110 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:53:53,110 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:53:53,111 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:53:53,111 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:53:53,111 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:53:53,111 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:53:53,130 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2021-01-06 19:53:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-06 19:53:53,140 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:53,141 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:53,141 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:53,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:53,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1781508813, now seen corresponding path program 1 times [2021-01-06 19:53:53,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:53,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039243166] [2021-01-06 19:53:53,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:53,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:53,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039243166] [2021-01-06 19:53:53,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:53,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:53:53,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046209396] [2021-01-06 19:53:53,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 19:53:53,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:53,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 19:53:53,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:53:53,533 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 2 states. [2021-01-06 19:53:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:53,589 INFO L93 Difference]: Finished difference Result 195 states and 331 transitions. [2021-01-06 19:53:53,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 19:53:53,591 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 41 [2021-01-06 19:53:53,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:53,623 INFO L225 Difference]: With dead ends: 195 [2021-01-06 19:53:53,624 INFO L226 Difference]: Without dead ends: 123 [2021-01-06 19:53:53,628 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 19:53:53,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-01-06 19:53:53,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-01-06 19:53:53,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2021-01-06 19:53:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 213 transitions. [2021-01-06 19:53:53,694 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 213 transitions. Word has length 41 [2021-01-06 19:53:53,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:53,695 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 213 transitions. [2021-01-06 19:53:53,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 19:53:53,695 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 213 transitions. [2021-01-06 19:53:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-06 19:53:53,700 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:53,700 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:53,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:53:53,702 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:53,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:53,704 INFO L82 PathProgramCache]: Analyzing trace with hash 2119091697, now seen corresponding path program 1 times [2021-01-06 19:53:53,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:53,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788832948] [2021-01-06 19:53:53,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:53,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788832948] [2021-01-06 19:53:53,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:53,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:53:53,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248155092] [2021-01-06 19:53:53,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:53:53,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:53,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:53:53,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:53:53,919 INFO L87 Difference]: Start difference. First operand 123 states and 213 transitions. Second operand 5 states. [2021-01-06 19:53:54,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:54,075 INFO L93 Difference]: Finished difference Result 194 states and 324 transitions. [2021-01-06 19:53:54,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:53:54,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2021-01-06 19:53:54,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:54,077 INFO L225 Difference]: With dead ends: 194 [2021-01-06 19:53:54,077 INFO L226 Difference]: Without dead ends: 123 [2021-01-06 19:53:54,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:53:54,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-01-06 19:53:54,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-01-06 19:53:54,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2021-01-06 19:53:54,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 163 transitions. [2021-01-06 19:53:54,089 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 163 transitions. Word has length 41 [2021-01-06 19:53:54,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:54,090 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 163 transitions. [2021-01-06 19:53:54,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:53:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 163 transitions. [2021-01-06 19:53:54,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:54,093 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:54,093 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:54,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:53:54,094 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:54,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:54,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1557003755, now seen corresponding path program 1 times [2021-01-06 19:53:54,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:54,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250086048] [2021-01-06 19:53:54,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:54,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250086048] [2021-01-06 19:53:54,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:54,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:54,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815702759] [2021-01-06 19:53:54,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:54,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:54,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:54,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:54,383 INFO L87 Difference]: Start difference. First operand 123 states and 163 transitions. Second operand 3 states. [2021-01-06 19:53:54,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:54,426 INFO L93 Difference]: Finished difference Result 251 states and 367 transitions. [2021-01-06 19:53:54,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:54,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:53:54,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:54,435 INFO L225 Difference]: With dead ends: 251 [2021-01-06 19:53:54,436 INFO L226 Difference]: Without dead ends: 184 [2021-01-06 19:53:54,437 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:54,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-01-06 19:53:54,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2021-01-06 19:53:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2021-01-06 19:53:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 258 transitions. [2021-01-06 19:53:54,468 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 258 transitions. Word has length 90 [2021-01-06 19:53:54,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:54,469 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 258 transitions. [2021-01-06 19:53:54,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:54,469 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 258 transitions. [2021-01-06 19:53:54,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:54,477 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:54,477 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:54,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:53:54,478 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:54,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:54,479 INFO L82 PathProgramCache]: Analyzing trace with hash -309494901, now seen corresponding path program 1 times [2021-01-06 19:53:54,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:54,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090795270] [2021-01-06 19:53:54,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:54,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:54,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090795270] [2021-01-06 19:53:54,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:54,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:54,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723696568] [2021-01-06 19:53:54,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:54,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:54,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:54,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:54,668 INFO L87 Difference]: Start difference. First operand 182 states and 258 transitions. Second operand 3 states. [2021-01-06 19:53:54,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:54,706 INFO L93 Difference]: Finished difference Result 422 states and 642 transitions. [2021-01-06 19:53:54,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:54,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:53:54,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:54,709 INFO L225 Difference]: With dead ends: 422 [2021-01-06 19:53:54,709 INFO L226 Difference]: Without dead ends: 296 [2021-01-06 19:53:54,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:54,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-01-06 19:53:54,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2021-01-06 19:53:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2021-01-06 19:53:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 437 transitions. [2021-01-06 19:53:54,743 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 437 transitions. Word has length 90 [2021-01-06 19:53:54,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:54,744 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 437 transitions. [2021-01-06 19:53:54,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:54,745 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 437 transitions. [2021-01-06 19:53:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:54,747 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:54,748 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:54,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:53:54,748 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:54,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:54,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1050927103, now seen corresponding path program 1 times [2021-01-06 19:53:54,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:54,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332446863] [2021-01-06 19:53:54,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:54,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:54,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332446863] [2021-01-06 19:53:54,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:54,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:54,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699283465] [2021-01-06 19:53:54,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:54,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:54,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:54,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:54,865 INFO L87 Difference]: Start difference. First operand 294 states and 437 transitions. Second operand 3 states. [2021-01-06 19:53:54,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:54,901 INFO L93 Difference]: Finished difference Result 746 states and 1159 transitions. [2021-01-06 19:53:54,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:54,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:53:54,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:54,905 INFO L225 Difference]: With dead ends: 746 [2021-01-06 19:53:54,906 INFO L226 Difference]: Without dead ends: 508 [2021-01-06 19:53:54,907 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:54,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-01-06 19:53:54,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 506. [2021-01-06 19:53:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2021-01-06 19:53:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 773 transitions. [2021-01-06 19:53:54,941 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 773 transitions. Word has length 90 [2021-01-06 19:53:54,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:54,941 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 773 transitions. [2021-01-06 19:53:54,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 773 transitions. [2021-01-06 19:53:54,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:54,945 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:54,947 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:54,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:53:54,947 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:54,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:54,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1796509833, now seen corresponding path program 1 times [2021-01-06 19:53:54,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:54,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891632898] [2021-01-06 19:53:54,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:55,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891632898] [2021-01-06 19:53:55,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:55,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:55,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127879742] [2021-01-06 19:53:55,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:55,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:55,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:55,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:55,077 INFO L87 Difference]: Start difference. First operand 506 states and 773 transitions. Second operand 3 states. [2021-01-06 19:53:55,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:55,143 INFO L93 Difference]: Finished difference Result 1358 states and 2127 transitions. [2021-01-06 19:53:55,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:55,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:53:55,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:55,153 INFO L225 Difference]: With dead ends: 1358 [2021-01-06 19:53:55,154 INFO L226 Difference]: Without dead ends: 908 [2021-01-06 19:53:55,155 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:55,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2021-01-06 19:53:55,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 906. [2021-01-06 19:53:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2021-01-06 19:53:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1401 transitions. [2021-01-06 19:53:55,194 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1401 transitions. Word has length 90 [2021-01-06 19:53:55,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:55,195 INFO L481 AbstractCegarLoop]: Abstraction has 906 states and 1401 transitions. [2021-01-06 19:53:55,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:55,195 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1401 transitions. [2021-01-06 19:53:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:55,196 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:55,196 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:55,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:53:55,197 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:55,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:55,197 INFO L82 PathProgramCache]: Analyzing trace with hash -259221845, now seen corresponding path program 1 times [2021-01-06 19:53:55,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:55,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586166799] [2021-01-06 19:53:55,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:55,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586166799] [2021-01-06 19:53:55,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:55,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:55,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494955506] [2021-01-06 19:53:55,280 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:55,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:55,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:55,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:55,281 INFO L87 Difference]: Start difference. First operand 906 states and 1401 transitions. Second operand 3 states. [2021-01-06 19:53:55,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:55,346 INFO L93 Difference]: Finished difference Result 2510 states and 3931 transitions. [2021-01-06 19:53:55,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:55,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:53:55,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:55,356 INFO L225 Difference]: With dead ends: 2510 [2021-01-06 19:53:55,357 INFO L226 Difference]: Without dead ends: 1660 [2021-01-06 19:53:55,359 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:55,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2021-01-06 19:53:55,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1658. [2021-01-06 19:53:55,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2021-01-06 19:53:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2569 transitions. [2021-01-06 19:53:55,430 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2569 transitions. Word has length 90 [2021-01-06 19:53:55,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:55,430 INFO L481 AbstractCegarLoop]: Abstraction has 1658 states and 2569 transitions. [2021-01-06 19:53:55,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2569 transitions. [2021-01-06 19:53:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:55,431 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:55,431 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:55,432 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:53:55,432 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:55,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:55,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1420392415, now seen corresponding path program 1 times [2021-01-06 19:53:55,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:55,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899395313] [2021-01-06 19:53:55,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:55,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899395313] [2021-01-06 19:53:55,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:55,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:55,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542850163] [2021-01-06 19:53:55,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:55,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:55,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:55,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:55,513 INFO L87 Difference]: Start difference. First operand 1658 states and 2569 transitions. Second operand 3 states. [2021-01-06 19:53:55,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:55,652 INFO L93 Difference]: Finished difference Result 4670 states and 7275 transitions. [2021-01-06 19:53:55,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:55,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:53:55,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:55,670 INFO L225 Difference]: With dead ends: 4670 [2021-01-06 19:53:55,671 INFO L226 Difference]: Without dead ends: 3068 [2021-01-06 19:53:55,674 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:55,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2021-01-06 19:53:55,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3066. [2021-01-06 19:53:55,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3066 states. [2021-01-06 19:53:55,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 4729 transitions. [2021-01-06 19:53:55,820 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 4729 transitions. Word has length 90 [2021-01-06 19:53:55,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:55,821 INFO L481 AbstractCegarLoop]: Abstraction has 3066 states and 4729 transitions. [2021-01-06 19:53:55,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:55,823 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 4729 transitions. [2021-01-06 19:53:55,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:55,823 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:55,824 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:55,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:53:55,824 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:55,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:55,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1758185557, now seen corresponding path program 1 times [2021-01-06 19:53:55,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:55,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671940493] [2021-01-06 19:53:55,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:55,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:55,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671940493] [2021-01-06 19:53:55,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:55,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:53:55,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890921457] [2021-01-06 19:53:55,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:53:55,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:55,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:53:55,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:55,927 INFO L87 Difference]: Start difference. First operand 3066 states and 4729 transitions. Second operand 3 states. [2021-01-06 19:53:56,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:56,212 INFO L93 Difference]: Finished difference Result 8702 states and 13435 transitions. [2021-01-06 19:53:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:53:56,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:53:56,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:56,244 INFO L225 Difference]: With dead ends: 8702 [2021-01-06 19:53:56,244 INFO L226 Difference]: Without dead ends: 5692 [2021-01-06 19:53:56,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:53:56,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5692 states. [2021-01-06 19:53:56,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5692 to 5690. [2021-01-06 19:53:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5690 states. [2021-01-06 19:53:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5690 states to 5690 states and 8697 transitions. [2021-01-06 19:53:56,514 INFO L78 Accepts]: Start accepts. Automaton has 5690 states and 8697 transitions. Word has length 90 [2021-01-06 19:53:56,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:56,515 INFO L481 AbstractCegarLoop]: Abstraction has 5690 states and 8697 transitions. [2021-01-06 19:53:56,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:53:56,515 INFO L276 IsEmpty]: Start isEmpty. Operand 5690 states and 8697 transitions. [2021-01-06 19:53:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:56,516 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:56,516 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:56,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:53:56,517 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:56,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:56,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1318796341, now seen corresponding path program 1 times [2021-01-06 19:53:56,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:56,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074872736] [2021-01-06 19:53:56,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:56,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074872736] [2021-01-06 19:53:56,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:56,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:53:56,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049324427] [2021-01-06 19:53:56,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:53:56,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:56,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:53:56,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:53:56,679 INFO L87 Difference]: Start difference. First operand 5690 states and 8697 transitions. Second operand 6 states. [2021-01-06 19:53:57,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:57,271 INFO L93 Difference]: Finished difference Result 11324 states and 17338 transitions. [2021-01-06 19:53:57,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:53:57,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2021-01-06 19:53:57,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:57,302 INFO L225 Difference]: With dead ends: 11324 [2021-01-06 19:53:57,302 INFO L226 Difference]: Without dead ends: 5690 [2021-01-06 19:53:57,311 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:53:57,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5690 states. [2021-01-06 19:53:57,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5690 to 5690. [2021-01-06 19:53:57,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5690 states. [2021-01-06 19:53:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5690 states to 5690 states and 8633 transitions. [2021-01-06 19:53:57,649 INFO L78 Accepts]: Start accepts. Automaton has 5690 states and 8633 transitions. Word has length 90 [2021-01-06 19:53:57,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:57,650 INFO L481 AbstractCegarLoop]: Abstraction has 5690 states and 8633 transitions. [2021-01-06 19:53:57,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:53:57,650 INFO L276 IsEmpty]: Start isEmpty. Operand 5690 states and 8633 transitions. [2021-01-06 19:53:57,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:57,654 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:57,654 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:57,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:53:57,655 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:57,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:57,655 INFO L82 PathProgramCache]: Analyzing trace with hash -297727987, now seen corresponding path program 1 times [2021-01-06 19:53:57,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:57,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224390881] [2021-01-06 19:53:57,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:57,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224390881] [2021-01-06 19:53:57,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:57,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:53:57,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611490352] [2021-01-06 19:53:57,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:53:57,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:57,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:53:57,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:53:57,792 INFO L87 Difference]: Start difference. First operand 5690 states and 8633 transitions. Second operand 6 states. [2021-01-06 19:53:58,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:53:58,261 INFO L93 Difference]: Finished difference Result 11324 states and 17210 transitions. [2021-01-06 19:53:58,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:53:58,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2021-01-06 19:53:58,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:53:58,290 INFO L225 Difference]: With dead ends: 11324 [2021-01-06 19:53:58,290 INFO L226 Difference]: Without dead ends: 5690 [2021-01-06 19:53:58,299 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:53:58,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5690 states. [2021-01-06 19:53:58,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5690 to 5690. [2021-01-06 19:53:58,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5690 states. [2021-01-06 19:53:58,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5690 states to 5690 states and 8569 transitions. [2021-01-06 19:53:58,702 INFO L78 Accepts]: Start accepts. Automaton has 5690 states and 8569 transitions. Word has length 90 [2021-01-06 19:53:58,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:53:58,703 INFO L481 AbstractCegarLoop]: Abstraction has 5690 states and 8569 transitions. [2021-01-06 19:53:58,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:53:58,703 INFO L276 IsEmpty]: Start isEmpty. Operand 5690 states and 8569 transitions. [2021-01-06 19:53:58,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:53:58,704 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:53:58,704 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:53:58,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:53:58,705 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:53:58,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:53:58,705 INFO L82 PathProgramCache]: Analyzing trace with hash 519920463, now seen corresponding path program 1 times [2021-01-06 19:53:58,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:53:58,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848596846] [2021-01-06 19:53:58,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:53:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:53:58,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:53:58,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848596846] [2021-01-06 19:53:58,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:53:58,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:53:58,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669578060] [2021-01-06 19:53:58,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:53:58,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:53:58,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:53:58,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:53:58,877 INFO L87 Difference]: Start difference. First operand 5690 states and 8569 transitions. Second operand 9 states. [2021-01-06 19:54:02,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:02,725 INFO L93 Difference]: Finished difference Result 84566 states and 127751 transitions. [2021-01-06 19:54:02,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 19:54:02,726 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2021-01-06 19:54:02,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:02,940 INFO L225 Difference]: With dead ends: 84566 [2021-01-06 19:54:02,941 INFO L226 Difference]: Without dead ends: 78932 [2021-01-06 19:54:02,967 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2021-01-06 19:54:03,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78932 states. [2021-01-06 19:54:04,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78932 to 11322. [2021-01-06 19:54:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11322 states. [2021-01-06 19:54:04,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11322 states to 11322 states and 16825 transitions. [2021-01-06 19:54:04,760 INFO L78 Accepts]: Start accepts. Automaton has 11322 states and 16825 transitions. Word has length 90 [2021-01-06 19:54:04,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:04,760 INFO L481 AbstractCegarLoop]: Abstraction has 11322 states and 16825 transitions. [2021-01-06 19:54:04,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:54:04,761 INFO L276 IsEmpty]: Start isEmpty. Operand 11322 states and 16825 transitions. [2021-01-06 19:54:04,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 19:54:04,762 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:04,762 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:04,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:54:04,763 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:04,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:04,763 INFO L82 PathProgramCache]: Analyzing trace with hash 78162119, now seen corresponding path program 1 times [2021-01-06 19:54:04,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:04,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652286340] [2021-01-06 19:54:04,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:05,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:05,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652286340] [2021-01-06 19:54:05,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:05,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:54:05,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517598782] [2021-01-06 19:54:05,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:54:05,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:05,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:54:05,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:54:05,188 INFO L87 Difference]: Start difference. First operand 11322 states and 16825 transitions. Second operand 9 states. [2021-01-06 19:54:07,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:07,008 INFO L93 Difference]: Finished difference Result 28224 states and 42108 transitions. [2021-01-06 19:54:07,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:54:07,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2021-01-06 19:54:07,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:07,072 INFO L225 Difference]: With dead ends: 28224 [2021-01-06 19:54:07,072 INFO L226 Difference]: Without dead ends: 16958 [2021-01-06 19:54:07,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:54:07,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16958 states. [2021-01-06 19:54:07,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16958 to 11322. [2021-01-06 19:54:07,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11322 states. [2021-01-06 19:54:07,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11322 states to 11322 states and 16697 transitions. [2021-01-06 19:54:07,997 INFO L78 Accepts]: Start accepts. Automaton has 11322 states and 16697 transitions. Word has length 92 [2021-01-06 19:54:08,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:08,001 INFO L481 AbstractCegarLoop]: Abstraction has 11322 states and 16697 transitions. [2021-01-06 19:54:08,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:54:08,001 INFO L276 IsEmpty]: Start isEmpty. Operand 11322 states and 16697 transitions. [2021-01-06 19:54:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 19:54:08,002 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:08,002 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:08,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:54:08,003 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:08,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:08,003 INFO L82 PathProgramCache]: Analyzing trace with hash 11668607, now seen corresponding path program 1 times [2021-01-06 19:54:08,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:08,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631603609] [2021-01-06 19:54:08,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:08,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631603609] [2021-01-06 19:54:08,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:08,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:54:08,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394648474] [2021-01-06 19:54:08,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:54:08,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:08,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:54:08,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:08,109 INFO L87 Difference]: Start difference. First operand 11322 states and 16697 transitions. Second operand 3 states. [2021-01-06 19:54:09,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:09,113 INFO L93 Difference]: Finished difference Result 27904 states and 41149 transitions. [2021-01-06 19:54:09,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:54:09,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2021-01-06 19:54:09,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:09,147 INFO L225 Difference]: With dead ends: 27904 [2021-01-06 19:54:09,148 INFO L226 Difference]: Without dead ends: 16638 [2021-01-06 19:54:09,164 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:54:09,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16638 states. [2021-01-06 19:54:10,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16638 to 16636. [2021-01-06 19:54:10,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16636 states. [2021-01-06 19:54:10,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16636 states to 16636 states and 24315 transitions. [2021-01-06 19:54:10,415 INFO L78 Accepts]: Start accepts. Automaton has 16636 states and 24315 transitions. Word has length 92 [2021-01-06 19:54:10,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:10,415 INFO L481 AbstractCegarLoop]: Abstraction has 16636 states and 24315 transitions. [2021-01-06 19:54:10,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:54:10,416 INFO L276 IsEmpty]: Start isEmpty. Operand 16636 states and 24315 transitions. [2021-01-06 19:54:10,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-01-06 19:54:10,417 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:10,417 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:10,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:54:10,417 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:10,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:10,418 INFO L82 PathProgramCache]: Analyzing trace with hash 2008302822, now seen corresponding path program 1 times [2021-01-06 19:54:10,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:10,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711444350] [2021-01-06 19:54:10,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:10,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:54:10,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711444350] [2021-01-06 19:54:10,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:10,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 19:54:10,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191010009] [2021-01-06 19:54:10,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:54:10,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:10,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:54:10,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:54:10,566 INFO L87 Difference]: Start difference. First operand 16636 states and 24315 transitions. Second operand 8 states. [2021-01-06 19:54:12,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:12,891 INFO L93 Difference]: Finished difference Result 30879 states and 44657 transitions. [2021-01-06 19:54:12,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 19:54:12,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2021-01-06 19:54:12,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:12,936 INFO L225 Difference]: With dead ends: 30879 [2021-01-06 19:54:12,936 INFO L226 Difference]: Without dead ends: 30877 [2021-01-06 19:54:12,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:54:12,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30877 states. [2021-01-06 19:54:14,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30877 to 17404. [2021-01-06 19:54:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17404 states. [2021-01-06 19:54:14,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17404 states to 17404 states and 25019 transitions. [2021-01-06 19:54:14,321 INFO L78 Accepts]: Start accepts. Automaton has 17404 states and 25019 transitions. Word has length 93 [2021-01-06 19:54:14,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:14,321 INFO L481 AbstractCegarLoop]: Abstraction has 17404 states and 25019 transitions. [2021-01-06 19:54:14,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:54:14,322 INFO L276 IsEmpty]: Start isEmpty. Operand 17404 states and 25019 transitions. [2021-01-06 19:54:14,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 19:54:14,334 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:14,335 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:14,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:54:14,335 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:14,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:14,336 INFO L82 PathProgramCache]: Analyzing trace with hash 727934169, now seen corresponding path program 1 times [2021-01-06 19:54:14,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:14,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415239629] [2021-01-06 19:54:14,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-06 19:54:14,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415239629] [2021-01-06 19:54:14,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:14,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:54:14,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80482127] [2021-01-06 19:54:14,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:54:14,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:14,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:54:14,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:54:14,570 INFO L87 Difference]: Start difference. First operand 17404 states and 25019 transitions. Second operand 9 states. [2021-01-06 19:54:23,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:23,099 INFO L93 Difference]: Finished difference Result 142220 states and 204419 transitions. [2021-01-06 19:54:23,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:54:23,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2021-01-06 19:54:23,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:23,268 INFO L225 Difference]: With dead ends: 142220 [2021-01-06 19:54:23,269 INFO L226 Difference]: Without dead ends: 124874 [2021-01-06 19:54:23,315 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:54:23,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124874 states. [2021-01-06 19:54:26,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124874 to 34748. [2021-01-06 19:54:26,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34748 states. [2021-01-06 19:54:26,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34748 states to 34748 states and 49787 transitions. [2021-01-06 19:54:26,829 INFO L78 Accepts]: Start accepts. Automaton has 34748 states and 49787 transitions. Word has length 128 [2021-01-06 19:54:26,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:26,830 INFO L481 AbstractCegarLoop]: Abstraction has 34748 states and 49787 transitions. [2021-01-06 19:54:26,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:54:26,830 INFO L276 IsEmpty]: Start isEmpty. Operand 34748 states and 49787 transitions. [2021-01-06 19:54:26,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 19:54:26,850 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:26,850 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:26,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:54:26,850 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:26,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:26,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1040848647, now seen corresponding path program 1 times [2021-01-06 19:54:26,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:26,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588771791] [2021-01-06 19:54:26,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:27,034 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-06 19:54:27,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588771791] [2021-01-06 19:54:27,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:27,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:54:27,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165417589] [2021-01-06 19:54:27,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:54:27,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:27,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:54:27,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:54:27,037 INFO L87 Difference]: Start difference. First operand 34748 states and 49787 transitions. Second operand 9 states. [2021-01-06 19:54:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:37,118 INFO L93 Difference]: Finished difference Result 159564 states and 229187 transitions. [2021-01-06 19:54:37,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:54:37,119 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2021-01-06 19:54:37,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:37,327 INFO L225 Difference]: With dead ends: 159564 [2021-01-06 19:54:37,327 INFO L226 Difference]: Without dead ends: 142218 [2021-01-06 19:54:37,579 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:54:37,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142218 states. [2021-01-06 19:54:42,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142218 to 60796. [2021-01-06 19:54:42,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60796 states. [2021-01-06 19:54:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60796 states to 60796 states and 86779 transitions. [2021-01-06 19:54:42,943 INFO L78 Accepts]: Start accepts. Automaton has 60796 states and 86779 transitions. Word has length 128 [2021-01-06 19:54:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:54:42,943 INFO L481 AbstractCegarLoop]: Abstraction has 60796 states and 86779 transitions. [2021-01-06 19:54:42,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:54:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 60796 states and 86779 transitions. [2021-01-06 19:54:42,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 19:54:42,961 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:54:42,961 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:54:42,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:54:42,962 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:54:42,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:54:42,962 INFO L82 PathProgramCache]: Analyzing trace with hash 90791193, now seen corresponding path program 1 times [2021-01-06 19:54:42,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:54:42,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610979481] [2021-01-06 19:54:42,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:54:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:54:43,142 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 19:54:43,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610979481] [2021-01-06 19:54:43,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:54:43,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:54:43,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428590090] [2021-01-06 19:54:43,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:54:43,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:54:43,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:54:43,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:54:43,145 INFO L87 Difference]: Start difference. First operand 60796 states and 86779 transitions. Second operand 9 states. [2021-01-06 19:54:55,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:54:55,011 INFO L93 Difference]: Finished difference Result 176908 states and 253955 transitions. [2021-01-06 19:54:55,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:54:55,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2021-01-06 19:54:55,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:54:55,260 INFO L225 Difference]: With dead ends: 176908 [2021-01-06 19:54:55,261 INFO L226 Difference]: Without dead ends: 159562 [2021-01-06 19:54:55,313 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:54:55,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159562 states. [2021-01-06 19:55:02,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159562 to 78140. [2021-01-06 19:55:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78140 states. [2021-01-06 19:55:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78140 states to 78140 states and 111547 transitions. [2021-01-06 19:55:02,551 INFO L78 Accepts]: Start accepts. Automaton has 78140 states and 111547 transitions. Word has length 128 [2021-01-06 19:55:02,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:55:02,551 INFO L481 AbstractCegarLoop]: Abstraction has 78140 states and 111547 transitions. [2021-01-06 19:55:02,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:55:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 78140 states and 111547 transitions. [2021-01-06 19:55:02,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 19:55:02,570 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:55:02,570 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:55:02,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:55:02,570 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:55:02,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:55:02,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1144667847, now seen corresponding path program 1 times [2021-01-06 19:55:02,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:55:02,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394506178] [2021-01-06 19:55:02,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:55:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:55:02,744 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:55:02,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394506178] [2021-01-06 19:55:02,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:55:02,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:55:02,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038561601] [2021-01-06 19:55:02,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:55:02,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:55:02,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:55:02,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:55:02,746 INFO L87 Difference]: Start difference. First operand 78140 states and 111547 transitions. Second operand 9 states. [2021-01-06 19:55:16,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:55:16,604 INFO L93 Difference]: Finished difference Result 194252 states and 278723 transitions. [2021-01-06 19:55:16,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:55:16,605 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2021-01-06 19:55:16,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:55:17,042 INFO L225 Difference]: With dead ends: 194252 [2021-01-06 19:55:17,042 INFO L226 Difference]: Without dead ends: 176906 [2021-01-06 19:55:17,087 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:55:17,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176906 states. [2021-01-06 19:55:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176906 to 95484. [2021-01-06 19:55:25,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95484 states. [2021-01-06 19:55:26,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95484 states to 95484 states and 136315 transitions. [2021-01-06 19:55:26,083 INFO L78 Accepts]: Start accepts. Automaton has 95484 states and 136315 transitions. Word has length 128 [2021-01-06 19:55:26,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:55:26,083 INFO L481 AbstractCegarLoop]: Abstraction has 95484 states and 136315 transitions. [2021-01-06 19:55:26,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:55:26,083 INFO L276 IsEmpty]: Start isEmpty. Operand 95484 states and 136315 transitions. [2021-01-06 19:55:26,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 19:55:26,098 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:55:26,098 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:55:26,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:55:26,098 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:55:26,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:55:26,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1729303897, now seen corresponding path program 1 times [2021-01-06 19:55:26,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:55:26,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786274108] [2021-01-06 19:55:26,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:55:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:55:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-06 19:55:26,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786274108] [2021-01-06 19:55:26,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:55:26,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:55:26,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149604474] [2021-01-06 19:55:26,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:55:26,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:55:26,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:55:26,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:55:26,304 INFO L87 Difference]: Start difference. First operand 95484 states and 136315 transitions. Second operand 9 states. [2021-01-06 19:55:43,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:55:43,275 INFO L93 Difference]: Finished difference Result 211596 states and 303491 transitions. [2021-01-06 19:55:43,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:55:43,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2021-01-06 19:55:43,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:55:43,723 INFO L225 Difference]: With dead ends: 211596 [2021-01-06 19:55:43,723 INFO L226 Difference]: Without dead ends: 194250 [2021-01-06 19:55:43,792 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-01-06 19:55:43,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194250 states. [2021-01-06 19:55:54,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194250 to 112828. [2021-01-06 19:55:54,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112828 states. [2021-01-06 19:55:55,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112828 states to 112828 states and 161083 transitions. [2021-01-06 19:55:55,009 INFO L78 Accepts]: Start accepts. Automaton has 112828 states and 161083 transitions. Word has length 128 [2021-01-06 19:55:55,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:55:55,009 INFO L481 AbstractCegarLoop]: Abstraction has 112828 states and 161083 transitions. [2021-01-06 19:55:55,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:55:55,009 INFO L276 IsEmpty]: Start isEmpty. Operand 112828 states and 161083 transitions. [2021-01-06 19:55:55,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 19:55:55,024 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:55:55,024 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:55:55,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:55:55,024 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:55:55,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:55:55,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1163483513, now seen corresponding path program 1 times [2021-01-06 19:55:55,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:55:55,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859757531] [2021-01-06 19:55:55,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:55:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:55:55,199 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 19:55:55,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859757531] [2021-01-06 19:55:55,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:55:55,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:55:55,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227421813] [2021-01-06 19:55:55,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:55:55,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:55:55,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:55:55,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:55:55,204 INFO L87 Difference]: Start difference. First operand 112828 states and 161083 transitions. Second operand 9 states. [2021-01-06 19:56:15,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:56:15,561 INFO L93 Difference]: Finished difference Result 228940 states and 328259 transitions. [2021-01-06 19:56:15,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:56:15,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2021-01-06 19:56:15,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:56:15,909 INFO L225 Difference]: With dead ends: 228940 [2021-01-06 19:56:15,910 INFO L226 Difference]: Without dead ends: 211594 [2021-01-06 19:56:15,966 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:56:16,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211594 states. [2021-01-06 19:56:29,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211594 to 130172. [2021-01-06 19:56:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130172 states. [2021-01-06 19:56:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130172 states to 130172 states and 185851 transitions. [2021-01-06 19:56:30,456 INFO L78 Accepts]: Start accepts. Automaton has 130172 states and 185851 transitions. Word has length 128 [2021-01-06 19:56:30,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:56:30,456 INFO L481 AbstractCegarLoop]: Abstraction has 130172 states and 185851 transitions. [2021-01-06 19:56:30,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:56:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 130172 states and 185851 transitions. [2021-01-06 19:56:30,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 19:56:30,481 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:56:30,481 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:56:30,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:56:30,481 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:56:30,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:56:30,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1352699289, now seen corresponding path program 1 times [2021-01-06 19:56:30,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:56:30,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665431759] [2021-01-06 19:56:30,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:56:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:56:30,689 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 19:56:30,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665431759] [2021-01-06 19:56:30,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:56:30,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 19:56:30,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860168250] [2021-01-06 19:56:30,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:56:30,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:56:30,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:56:30,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:56:30,693 INFO L87 Difference]: Start difference. First operand 130172 states and 185851 transitions. Second operand 9 states.