/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-var-start-time.6.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:54:06,942 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:54:06,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:54:07,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:54:07,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:54:07,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:54:07,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:54:07,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:54:07,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:54:07,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:54:07,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:54:07,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:54:07,037 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:54:07,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:54:07,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:54:07,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:54:07,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:54:07,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:54:07,058 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:54:07,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:54:07,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:54:07,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:54:07,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:54:07,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:54:07,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:54:07,087 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:54:07,087 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:54:07,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:54:07,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:54:07,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:54:07,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:54:07,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:54:07,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:54:07,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:54:07,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:54:07,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:54:07,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:54:07,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:54:07,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:54:07,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:54:07,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:54:07,107 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 09:54:07,151 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:54:07,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:54:07,155 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:54:07,155 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:54:07,156 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:54:07,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:54:07,156 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:54:07,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:54:07,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:54:07,177 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:54:07,178 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:54:07,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:54:07,179 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:54:07,179 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:54:07,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:54:07,180 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:54:07,180 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:54:07,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:54:07,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:54:07,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:54:07,181 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:54:07,181 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:54:07,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:54:07,182 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:54:07,182 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:54:07,182 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 09:54:07,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:54:07,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:54:07,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:54:07,653 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:54:07,654 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:54:07,655 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c [2020-12-23 09:54:07,743 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/901157ab0/68bf6a821ebd472b8517442751502322/FLAG9aa823c0b [2020-12-23 09:54:08,514 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:54:08,515 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c [2020-12-23 09:54:08,539 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/901157ab0/68bf6a821ebd472b8517442751502322/FLAG9aa823c0b [2020-12-23 09:54:08,807 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/901157ab0/68bf6a821ebd472b8517442751502322 [2020-12-23 09:54:08,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:54:08,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:54:08,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:54:08,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:54:08,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:54:08,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:54:08" (1/1) ... [2020-12-23 09:54:08,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58ba029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:08, skipping insertion in model container [2020-12-23 09:54:08,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:54:08" (1/1) ... [2020-12-23 09:54:08,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:54:08,914 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~send2~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[~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[~send3~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[~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[~send4~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[~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[~send5~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[~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[~send6~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[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~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~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[~alive1~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[~alive2~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[~alive3~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[~alive4~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[~alive5~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[~alive6~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[~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[~c1~0,] [2020-12-23 09:54:09,186 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-var-start-time.6.ufo.UNBOUNDED.pals.c[16964,16977] [2020-12-23 09:54:09,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:54:09,204 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~r1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m1~0,] left hand side expression in assignment: lhs: VariableLHS[~p6_old~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~st1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~send1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~p1_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~send2~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[~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[~send3~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[~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[~send4~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[~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[~send5~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[~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[~send6~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[~p6_new~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~mode6~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~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[~alive1~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[~alive2~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[~alive3~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[~alive4~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[~alive5~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[~alive6~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[~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[~c1~0,] [2020-12-23 09:54:09,287 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-var-start-time.6.ufo.UNBOUNDED.pals.c[16964,16977] [2020-12-23 09:54:09,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:54:09,312 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:54:09,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:09 WrapperNode [2020-12-23 09:54:09,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:54:09,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:54:09,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:54:09,315 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:54:09,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:09" (1/1) ... [2020-12-23 09:54:09,339 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:09" (1/1) ... [2020-12-23 09:54:09,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:54:09,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:54:09,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:54:09,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:54:09,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:09" (1/1) ... [2020-12-23 09:54:09,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:09" (1/1) ... [2020-12-23 09:54:09,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:09" (1/1) ... [2020-12-23 09:54:09,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:09" (1/1) ... [2020-12-23 09:54:09,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:09" (1/1) ... [2020-12-23 09:54:09,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:09" (1/1) ... [2020-12-23 09:54:09,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:09" (1/1) ... [2020-12-23 09:54:09,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:54:09,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:54:09,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:54:09,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:54:09,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:09" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:54:09,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:54:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:54:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:54:09,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:54:10,574 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:54:10,574 INFO L299 CfgBuilder]: Removed 25 assume(true) statements. [2020-12-23 09:54:10,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:54:10 BoogieIcfgContainer [2020-12-23 09:54:10,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:54:10,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:54:10,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:54:10,583 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:54:10,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:54:08" (1/3) ... [2020-12-23 09:54:10,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364da27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:54:10, skipping insertion in model container [2020-12-23 09:54:10,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:54:09" (2/3) ... [2020-12-23 09:54:10,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364da27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:54:10, skipping insertion in model container [2020-12-23 09:54:10,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:54:10" (3/3) ... [2020-12-23 09:54:10,587 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c [2020-12-23 09:54:10,594 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:54:10,608 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 09:54:10,629 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 09:54:10,658 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:54:10,659 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:54:10,659 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:54:10,659 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:54:10,659 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:54:10,659 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:54:10,660 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:54:10,660 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:54:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2020-12-23 09:54:10,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 09:54:10,690 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:10,691 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] [2020-12-23 09:54:10,691 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:10,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:10,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1143199986, now seen corresponding path program 1 times [2020-12-23 09:54:10,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:10,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114509872] [2020-12-23 09:54:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:11,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:54:11,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114509872] [2020-12-23 09:54:11,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:11,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:54:11,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495672285] [2020-12-23 09:54:11,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:54:11,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:11,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:54:11,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:54:11,035 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 5 states. [2020-12-23 09:54:11,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:11,208 INFO L93 Difference]: Finished difference Result 245 states and 409 transitions. [2020-12-23 09:54:11,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:54:11,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-12-23 09:54:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:11,225 INFO L225 Difference]: With dead ends: 245 [2020-12-23 09:54:11,225 INFO L226 Difference]: Without dead ends: 142 [2020-12-23 09:54:11,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:54:11,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-12-23 09:54:11,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-12-23 09:54:11,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-12-23 09:54:11,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 200 transitions. [2020-12-23 09:54:11,281 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 200 transitions. Word has length 38 [2020-12-23 09:54:11,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:11,282 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 200 transitions. [2020-12-23 09:54:11,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:54:11,282 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2020-12-23 09:54:11,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 09:54:11,286 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:11,286 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:54:11,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:54:11,286 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:11,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:11,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1334845828, now seen corresponding path program 1 times [2020-12-23 09:54:11,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:11,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518799867] [2020-12-23 09:54:11,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:54:11,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518799867] [2020-12-23 09:54:11,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:11,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:11,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127616052] [2020-12-23 09:54:11,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:11,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:11,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:11,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:11,530 INFO L87 Difference]: Start difference. First operand 142 states and 200 transitions. Second operand 3 states. [2020-12-23 09:54:11,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:11,588 INFO L93 Difference]: Finished difference Result 320 states and 486 transitions. [2020-12-23 09:54:11,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:54:11,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2020-12-23 09:54:11,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:11,597 INFO L225 Difference]: With dead ends: 320 [2020-12-23 09:54:11,597 INFO L226 Difference]: Without dead ends: 225 [2020-12-23 09:54:11,600 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-12-23 09:54:11,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2020-12-23 09:54:11,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-12-23 09:54:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 331 transitions. [2020-12-23 09:54:11,644 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 331 transitions. Word has length 78 [2020-12-23 09:54:11,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:11,644 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 331 transitions. [2020-12-23 09:54:11,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:54:11,645 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 331 transitions. [2020-12-23 09:54:11,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-23 09:54:11,652 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:11,653 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:54:11,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:54:11,653 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:11,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:11,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1690434603, now seen corresponding path program 1 times [2020-12-23 09:54:11,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:11,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878389278] [2020-12-23 09:54:11,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:54:11,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878389278] [2020-12-23 09:54:11,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:11,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:11,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758870916] [2020-12-23 09:54:11,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:11,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:11,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:11,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:11,887 INFO L87 Difference]: Start difference. First operand 223 states and 331 transitions. Second operand 3 states. [2020-12-23 09:54:11,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:11,917 INFO L93 Difference]: Finished difference Result 551 states and 859 transitions. [2020-12-23 09:54:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:54:11,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2020-12-23 09:54:11,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:11,921 INFO L225 Difference]: With dead ends: 551 [2020-12-23 09:54:11,921 INFO L226 Difference]: Without dead ends: 375 [2020-12-23 09:54:11,923 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:11,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2020-12-23 09:54:11,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2020-12-23 09:54:11,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-12-23 09:54:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 572 transitions. [2020-12-23 09:54:11,946 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 572 transitions. Word has length 79 [2020-12-23 09:54:11,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:11,946 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 572 transitions. [2020-12-23 09:54:11,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:54:11,947 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 572 transitions. [2020-12-23 09:54:11,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 09:54:11,949 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:11,949 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:54:11,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:54:11,949 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:11,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:11,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1185859852, now seen corresponding path program 1 times [2020-12-23 09:54:11,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:11,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164862346] [2020-12-23 09:54:11,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:54:12,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164862346] [2020-12-23 09:54:12,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:12,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:12,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880123716] [2020-12-23 09:54:12,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:12,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:12,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:12,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:12,096 INFO L87 Difference]: Start difference. First operand 373 states and 572 transitions. Second operand 3 states. [2020-12-23 09:54:12,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:12,137 INFO L93 Difference]: Finished difference Result 977 states and 1542 transitions. [2020-12-23 09:54:12,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:54:12,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-12-23 09:54:12,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:12,142 INFO L225 Difference]: With dead ends: 977 [2020-12-23 09:54:12,143 INFO L226 Difference]: Without dead ends: 651 [2020-12-23 09:54:12,145 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:12,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2020-12-23 09:54:12,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 649. [2020-12-23 09:54:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2020-12-23 09:54:12,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1012 transitions. [2020-12-23 09:54:12,212 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1012 transitions. Word has length 80 [2020-12-23 09:54:12,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:12,213 INFO L481 AbstractCegarLoop]: Abstraction has 649 states and 1012 transitions. [2020-12-23 09:54:12,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:54:12,214 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1012 transitions. [2020-12-23 09:54:12,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 09:54:12,215 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:12,215 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:54:12,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:54:12,216 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:12,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:12,217 INFO L82 PathProgramCache]: Analyzing trace with hash 600169947, now seen corresponding path program 1 times [2020-12-23 09:54:12,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:12,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629664545] [2020-12-23 09:54:12,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:12,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:54:12,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629664545] [2020-12-23 09:54:12,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:12,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:12,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794157329] [2020-12-23 09:54:12,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:12,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:12,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:12,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:12,357 INFO L87 Difference]: Start difference. First operand 649 states and 1012 transitions. Second operand 3 states. [2020-12-23 09:54:12,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:12,448 INFO L93 Difference]: Finished difference Result 1757 states and 2782 transitions. [2020-12-23 09:54:12,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:54:12,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2020-12-23 09:54:12,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:12,461 INFO L225 Difference]: With dead ends: 1757 [2020-12-23 09:54:12,462 INFO L226 Difference]: Without dead ends: 1155 [2020-12-23 09:54:12,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:12,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2020-12-23 09:54:12,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1153. [2020-12-23 09:54:12,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2020-12-23 09:54:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1808 transitions. [2020-12-23 09:54:12,510 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1808 transitions. Word has length 81 [2020-12-23 09:54:12,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:12,512 INFO L481 AbstractCegarLoop]: Abstraction has 1153 states and 1808 transitions. [2020-12-23 09:54:12,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:54:12,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1808 transitions. [2020-12-23 09:54:12,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-23 09:54:12,516 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:12,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] [2020-12-23 09:54:12,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:54:12,517 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:12,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:12,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1228760164, now seen corresponding path program 1 times [2020-12-23 09:54:12,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:12,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128308192] [2020-12-23 09:54:12,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:54:12,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128308192] [2020-12-23 09:54:12,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:12,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:12,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871915053] [2020-12-23 09:54:12,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:12,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:12,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:12,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:12,682 INFO L87 Difference]: Start difference. First operand 1153 states and 1808 transitions. Second operand 3 states. [2020-12-23 09:54:12,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:12,752 INFO L93 Difference]: Finished difference Result 3173 states and 5010 transitions. [2020-12-23 09:54:12,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:54:12,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2020-12-23 09:54:12,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:12,764 INFO L225 Difference]: With dead ends: 3173 [2020-12-23 09:54:12,765 INFO L226 Difference]: Without dead ends: 2067 [2020-12-23 09:54:12,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:12,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2020-12-23 09:54:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2065. [2020-12-23 09:54:12,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2065 states. [2020-12-23 09:54:12,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 3232 transitions. [2020-12-23 09:54:12,870 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 3232 transitions. Word has length 82 [2020-12-23 09:54:12,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:12,871 INFO L481 AbstractCegarLoop]: Abstraction has 2065 states and 3232 transitions. [2020-12-23 09:54:12,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:54:12,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 3232 transitions. [2020-12-23 09:54:12,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 09:54:12,877 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:12,877 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:54:12,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:54:12,877 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:12,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:12,879 INFO L82 PathProgramCache]: Analyzing trace with hash -991115381, now seen corresponding path program 1 times [2020-12-23 09:54:12,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:12,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102915504] [2020-12-23 09:54:12,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:13,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:54:13,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102915504] [2020-12-23 09:54:13,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:13,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:54:13,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686417004] [2020-12-23 09:54:13,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:54:13,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:13,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:54:13,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:54:13,206 INFO L87 Difference]: Start difference. First operand 2065 states and 3232 transitions. Second operand 8 states. [2020-12-23 09:54:13,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:13,794 INFO L93 Difference]: Finished difference Result 12877 states and 20102 transitions. [2020-12-23 09:54:13,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:54:13,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2020-12-23 09:54:13,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:13,852 INFO L225 Difference]: With dead ends: 12877 [2020-12-23 09:54:13,853 INFO L226 Difference]: Without dead ends: 10859 [2020-12-23 09:54:13,863 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:54:13,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10859 states. [2020-12-23 09:54:14,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10859 to 10849. [2020-12-23 09:54:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2020-12-23 09:54:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 16880 transitions. [2020-12-23 09:54:14,444 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 16880 transitions. Word has length 83 [2020-12-23 09:54:14,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:14,444 INFO L481 AbstractCegarLoop]: Abstraction has 10849 states and 16880 transitions. [2020-12-23 09:54:14,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:54:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 16880 transitions. [2020-12-23 09:54:14,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 09:54:14,446 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:14,446 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:54:14,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:54:14,447 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:14,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:14,447 INFO L82 PathProgramCache]: Analyzing trace with hash 120110007, now seen corresponding path program 1 times [2020-12-23 09:54:14,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:14,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91531415] [2020-12-23 09:54:14,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:54:14,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91531415] [2020-12-23 09:54:14,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:14,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:14,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107987484] [2020-12-23 09:54:14,615 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:14,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:14,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:14,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:14,616 INFO L87 Difference]: Start difference. First operand 10849 states and 16880 transitions. Second operand 3 states. [2020-12-23 09:54:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:15,317 INFO L93 Difference]: Finished difference Result 29861 states and 46290 transitions. [2020-12-23 09:54:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:54:15,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2020-12-23 09:54:15,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:15,413 INFO L225 Difference]: With dead ends: 29861 [2020-12-23 09:54:15,413 INFO L226 Difference]: Without dead ends: 19059 [2020-12-23 09:54:15,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:15,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19059 states. [2020-12-23 09:54:16,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19059 to 19057. [2020-12-23 09:54:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19057 states. [2020-12-23 09:54:16,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19057 states to 19057 states and 29264 transitions. [2020-12-23 09:54:16,340 INFO L78 Accepts]: Start accepts. Automaton has 19057 states and 29264 transitions. Word has length 84 [2020-12-23 09:54:16,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:16,341 INFO L481 AbstractCegarLoop]: Abstraction has 19057 states and 29264 transitions. [2020-12-23 09:54:16,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:54:16,341 INFO L276 IsEmpty]: Start isEmpty. Operand 19057 states and 29264 transitions. [2020-12-23 09:54:16,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 09:54:16,342 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:16,343 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:54:16,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:54:16,343 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:16,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:16,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1337229271, now seen corresponding path program 1 times [2020-12-23 09:54:16,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:16,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797978369] [2020-12-23 09:54:16,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:16,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:54:16,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797978369] [2020-12-23 09:54:16,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:16,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:54:16,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069387665] [2020-12-23 09:54:16,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:54:16,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:16,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:54:16,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:54:16,586 INFO L87 Difference]: Start difference. First operand 19057 states and 29264 transitions. Second operand 8 states. [2020-12-23 09:54:19,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:19,610 INFO L93 Difference]: Finished difference Result 106847 states and 164503 transitions. [2020-12-23 09:54:19,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:54:19,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2020-12-23 09:54:19,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:19,930 INFO L225 Difference]: With dead ends: 106847 [2020-12-23 09:54:19,930 INFO L226 Difference]: Without dead ends: 87837 [2020-12-23 09:54:19,997 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:54:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87837 states. [2020-12-23 09:54:22,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87837 to 38065. [2020-12-23 09:54:22,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38065 states. [2020-12-23 09:54:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38065 states to 38065 states and 57712 transitions. [2020-12-23 09:54:22,728 INFO L78 Accepts]: Start accepts. Automaton has 38065 states and 57712 transitions. Word has length 84 [2020-12-23 09:54:22,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:22,728 INFO L481 AbstractCegarLoop]: Abstraction has 38065 states and 57712 transitions. [2020-12-23 09:54:22,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:54:22,728 INFO L276 IsEmpty]: Start isEmpty. Operand 38065 states and 57712 transitions. [2020-12-23 09:54:22,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 09:54:22,730 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:22,730 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] [2020-12-23 09:54:22,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:54:22,730 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:22,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:22,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1112242464, now seen corresponding path program 1 times [2020-12-23 09:54:22,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:22,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352975476] [2020-12-23 09:54:22,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:54:22,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352975476] [2020-12-23 09:54:22,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:22,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:54:22,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857464526] [2020-12-23 09:54:22,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:54:22,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:22,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:54:22,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:54:22,854 INFO L87 Difference]: Start difference. First operand 38065 states and 57712 transitions. Second operand 8 states. [2020-12-23 09:54:25,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:25,778 INFO L93 Difference]: Finished difference Result 79155 states and 118449 transitions. [2020-12-23 09:54:25,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 09:54:25,778 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2020-12-23 09:54:25,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:26,009 INFO L225 Difference]: With dead ends: 79155 [2020-12-23 09:54:26,009 INFO L226 Difference]: Without dead ends: 79153 [2020-12-23 09:54:26,041 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2020-12-23 09:54:26,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79153 states. [2020-12-23 09:54:28,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79153 to 40369. [2020-12-23 09:54:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40369 states. [2020-12-23 09:54:28,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40369 states to 40369 states and 60016 transitions. [2020-12-23 09:54:28,910 INFO L78 Accepts]: Start accepts. Automaton has 40369 states and 60016 transitions. Word has length 85 [2020-12-23 09:54:28,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:28,911 INFO L481 AbstractCegarLoop]: Abstraction has 40369 states and 60016 transitions. [2020-12-23 09:54:28,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:54:28,911 INFO L276 IsEmpty]: Start isEmpty. Operand 40369 states and 60016 transitions. [2020-12-23 09:54:28,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-23 09:54:28,912 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:28,913 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] [2020-12-23 09:54:28,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:54:28,913 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:28,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:28,914 INFO L82 PathProgramCache]: Analyzing trace with hash 172356833, now seen corresponding path program 1 times [2020-12-23 09:54:28,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:28,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97635465] [2020-12-23 09:54:28,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:54:28,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97635465] [2020-12-23 09:54:28,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:28,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:28,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893978427] [2020-12-23 09:54:28,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:28,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:28,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:28,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:28,996 INFO L87 Difference]: Start difference. First operand 40369 states and 60016 transitions. Second operand 3 states. [2020-12-23 09:54:31,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:31,301 INFO L93 Difference]: Finished difference Result 99063 states and 147412 transitions. [2020-12-23 09:54:31,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:54:31,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-12-23 09:54:31,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:31,416 INFO L225 Difference]: With dead ends: 99063 [2020-12-23 09:54:31,417 INFO L226 Difference]: Without dead ends: 58741 [2020-12-23 09:54:31,474 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:31,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58741 states. [2020-12-23 09:54:34,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58741 to 58387. [2020-12-23 09:54:34,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58387 states. [2020-12-23 09:54:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58387 states to 58387 states and 86386 transitions. [2020-12-23 09:54:34,382 INFO L78 Accepts]: Start accepts. Automaton has 58387 states and 86386 transitions. Word has length 86 [2020-12-23 09:54:34,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:34,382 INFO L481 AbstractCegarLoop]: Abstraction has 58387 states and 86386 transitions. [2020-12-23 09:54:34,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:54:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 58387 states and 86386 transitions. [2020-12-23 09:54:34,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 09:54:34,417 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:34,417 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] [2020-12-23 09:54:34,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:54:34,418 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:34,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:34,419 INFO L82 PathProgramCache]: Analyzing trace with hash 668753880, now seen corresponding path program 1 times [2020-12-23 09:54:34,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:34,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948652475] [2020-12-23 09:54:34,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:34,755 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:54:34,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948652475] [2020-12-23 09:54:34,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817356407] [2020-12-23 09:54:34,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:54:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:34,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 09:54:34,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:54:35,532 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 09:54:35,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:54:35,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2020-12-23 09:54:35,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100210477] [2020-12-23 09:54:35,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 09:54:35,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:35,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 09:54:35,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-12-23 09:54:35,537 INFO L87 Difference]: Start difference. First operand 58387 states and 86386 transitions. Second operand 12 states. [2020-12-23 09:54:59,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:59,288 INFO L93 Difference]: Finished difference Result 482131 states and 707378 transitions. [2020-12-23 09:54:59,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-12-23 09:54:59,289 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2020-12-23 09:54:59,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:55:00,427 INFO L225 Difference]: With dead ends: 482131 [2020-12-23 09:55:00,428 INFO L226 Difference]: Without dead ends: 423793 [2020-12-23 09:55:00,612 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=666, Invalid=2640, Unknown=0, NotChecked=0, Total=3306 [2020-12-23 09:55:01,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423793 states. [2020-12-23 09:55:14,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423793 to 212131. [2020-12-23 09:55:14,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212131 states. [2020-12-23 09:55:15,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212131 states to 212131 states and 309698 transitions. [2020-12-23 09:55:15,581 INFO L78 Accepts]: Start accepts. Automaton has 212131 states and 309698 transitions. Word has length 118 [2020-12-23 09:55:15,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:55:15,581 INFO L481 AbstractCegarLoop]: Abstraction has 212131 states and 309698 transitions. [2020-12-23 09:55:15,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 09:55:15,581 INFO L276 IsEmpty]: Start isEmpty. Operand 212131 states and 309698 transitions. [2020-12-23 09:55:15,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 09:55:15,650 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:55:15,651 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:55:15,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-23 09:55:15,866 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:55:15,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:55:15,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1707736999, now seen corresponding path program 1 times [2020-12-23 09:55:15,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:55:15,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282804046] [2020-12-23 09:55:15,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:55:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:55:15,965 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:55:15,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282804046] [2020-12-23 09:55:15,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:55:15,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:55:15,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871417920] [2020-12-23 09:55:15,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:55:15,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:55:15,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:55:15,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:55:15,973 INFO L87 Difference]: Start difference. First operand 212131 states and 309698 transitions. Second operand 3 states. [2020-12-23 09:55:33,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:55:33,316 INFO L93 Difference]: Finished difference Result 534472 states and 780774 transitions. [2020-12-23 09:55:33,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:55:33,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2020-12-23 09:55:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:55:33,947 INFO L225 Difference]: With dead ends: 534472 [2020-12-23 09:55:33,947 INFO L226 Difference]: Without dead ends: 349574 [2020-12-23 09:55:34,126 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:55:34,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349574 states. [2020-12-23 09:55:53,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349574 to 349572. [2020-12-23 09:55:53,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349572 states. [2020-12-23 09:55:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349572 states to 349572 states and 506180 transitions. [2020-12-23 09:55:54,754 INFO L78 Accepts]: Start accepts. Automaton has 349572 states and 506180 transitions. Word has length 118 [2020-12-23 09:55:54,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:55:54,755 INFO L481 AbstractCegarLoop]: Abstraction has 349572 states and 506180 transitions. [2020-12-23 09:55:54,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:55:54,755 INFO L276 IsEmpty]: Start isEmpty. Operand 349572 states and 506180 transitions. [2020-12-23 09:55:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 09:55:54,852 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:55:54,852 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:55:54,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:55:54,853 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:55:54,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:55:54,853 INFO L82 PathProgramCache]: Analyzing trace with hash 322125977, now seen corresponding path program 1 times [2020-12-23 09:55:54,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:55:54,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503656203] [2020-12-23 09:55:54,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:55:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:55:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:55:54,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503656203] [2020-12-23 09:55:54,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:55:54,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:55:54,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376839432] [2020-12-23 09:55:54,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:55:54,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:55:54,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:55:54,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:55:54,932 INFO L87 Difference]: Start difference. First operand 349572 states and 506180 transitions. Second operand 3 states. [2020-12-23 09:56:25,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:56:25,358 INFO L93 Difference]: Finished difference Result 890419 states and 1287796 transitions. [2020-12-23 09:56:25,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:56:25,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2020-12-23 09:56:25,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:56:26,894 INFO L225 Difference]: With dead ends: 890419 [2020-12-23 09:56:26,894 INFO L226 Difference]: Without dead ends: 594513 [2020-12-23 09:56:27,308 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:56:27,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594513 states.