/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.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:53:03,424 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:53:03,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:53:03,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:53:03,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:53:03,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:53:03,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:53:03,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:53:03,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:53:03,522 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:53:03,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:53:03,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:53:03,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:53:03,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:53:03,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:53:03,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:53:03,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:53:03,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:53:03,552 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:53:03,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:53:03,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:53:03,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:53:03,568 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:53:03,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:53:03,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:53:03,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:53:03,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:53:03,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:53:03,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:53:03,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:53:03,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:53:03,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:53:03,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:53:03,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:53:03,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:53:03,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:53:03,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:53:03,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:53:03,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:53:03,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:53:03,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:53:03,585 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:53:03,631 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:53:03,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:53:03,633 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:53:03,633 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:53:03,633 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:53:03,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:53:03,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:53:03,634 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:53:03,634 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:53:03,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:53:03,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:53:03,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:53:03,635 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:53:03,635 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:53:03,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:53:03,636 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:53:03,636 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:53:03,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:53:03,636 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:53:03,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:53:03,637 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:53:03,637 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:53:03,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:53:03,637 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:53:03,638 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:53:03,638 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:53:03,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:53:04,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:53:04,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:53:04,026 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:53:04,027 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:53:04,028 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.1.ufo.UNBOUNDED.pals.c [2020-12-23 09:53:04,115 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b8403c622/f6997f7d4e0d4e8a968350afa2978207/FLAGf8890d0aa [2020-12-23 09:53:04,848 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:53:04,849 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c [2020-12-23 09:53:04,862 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b8403c622/f6997f7d4e0d4e8a968350afa2978207/FLAGf8890d0aa [2020-12-23 09:53:05,093 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b8403c622/f6997f7d4e0d4e8a968350afa2978207 [2020-12-23 09:53:05,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:53:05,102 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:53:05,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:53:05,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:53:05,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:53:05,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:53:05" (1/1) ... [2020-12-23 09:53:05,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f028524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:05, skipping insertion in model container [2020-12-23 09:53:05,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:53:05" (1/1) ... [2020-12-23 09:53:05,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:53:05,181 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[~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:53:05,471 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.1.ufo.UNBOUNDED.pals.c[17005,17018] [2020-12-23 09:53:05,479 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:53:05,498 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[~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:53:05,581 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.1.ufo.UNBOUNDED.pals.c[17005,17018] [2020-12-23 09:53:05,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:53:05,625 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:53:05,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:05 WrapperNode [2020-12-23 09:53:05,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:53:05,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:53:05,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:53:05,629 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:53:05,638 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:53:05" (1/1) ... [2020-12-23 09:53:05,666 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:53:05" (1/1) ... [2020-12-23 09:53:05,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:53:05,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:53:05,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:53:05,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:53:05,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:05" (1/1) ... [2020-12-23 09:53:05,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:05" (1/1) ... [2020-12-23 09:53:05,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:05" (1/1) ... [2020-12-23 09:53:05,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:05" (1/1) ... [2020-12-23 09:53:05,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:05" (1/1) ... [2020-12-23 09:53:05,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:05" (1/1) ... [2020-12-23 09:53:05,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:05" (1/1) ... [2020-12-23 09:53:05,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:53:05,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:53:05,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:53:05,788 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:53:05,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:05" (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:53:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:53:05,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:53:05,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:53:05,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:53:07,229 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:53:07,230 INFO L299 CfgBuilder]: Removed 25 assume(true) statements. [2020-12-23 09:53:07,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:53:07 BoogieIcfgContainer [2020-12-23 09:53:07,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:53:07,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:53:07,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:53:07,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:53:07,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:53:05" (1/3) ... [2020-12-23 09:53:07,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167985a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:53:07, skipping insertion in model container [2020-12-23 09:53:07,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:53:05" (2/3) ... [2020-12-23 09:53:07,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167985a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:53:07, skipping insertion in model container [2020-12-23 09:53:07,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:53:07" (3/3) ... [2020-12-23 09:53:07,243 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c [2020-12-23 09:53:07,251 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:53:07,257 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 09:53:07,279 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 09:53:07,313 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:53:07,313 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:53:07,313 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:53:07,314 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:53:07,314 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:53:07,314 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:53:07,314 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:53:07,314 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:53:07,340 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2020-12-23 09:53:07,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 09:53:07,360 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:07,361 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:53:07,362 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:07,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:07,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1143199986, now seen corresponding path program 1 times [2020-12-23 09:53:07,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:07,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024982400] [2020-12-23 09:53:07,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:07,792 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:53:07,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024982400] [2020-12-23 09:53:07,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:53:07,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:53:07,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012825231] [2020-12-23 09:53:07,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:53:07,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:07,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:53:07,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:53:07,854 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 5 states. [2020-12-23 09:53:08,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:53:08,066 INFO L93 Difference]: Finished difference Result 245 states and 409 transitions. [2020-12-23 09:53:08,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:53:08,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-12-23 09:53:08,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:53:08,082 INFO L225 Difference]: With dead ends: 245 [2020-12-23 09:53:08,082 INFO L226 Difference]: Without dead ends: 142 [2020-12-23 09:53:08,086 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:53:08,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-12-23 09:53:08,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-12-23 09:53:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-12-23 09:53:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 200 transitions. [2020-12-23 09:53:08,140 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 200 transitions. Word has length 38 [2020-12-23 09:53:08,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:53:08,140 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 200 transitions. [2020-12-23 09:53:08,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:53:08,141 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2020-12-23 09:53:08,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 09:53:08,144 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:08,144 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:53:08,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:53:08,145 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:08,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:08,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1334845828, now seen corresponding path program 1 times [2020-12-23 09:53:08,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:08,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944888999] [2020-12-23 09:53:08,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:08,385 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:53:08,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944888999] [2020-12-23 09:53:08,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:53:08,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:53:08,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969612123] [2020-12-23 09:53:08,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:53:08,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:08,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:53:08,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:53:08,391 INFO L87 Difference]: Start difference. First operand 142 states and 200 transitions. Second operand 3 states. [2020-12-23 09:53:08,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:53:08,440 INFO L93 Difference]: Finished difference Result 320 states and 486 transitions. [2020-12-23 09:53:08,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:53:08,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2020-12-23 09:53:08,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:53:08,446 INFO L225 Difference]: With dead ends: 320 [2020-12-23 09:53:08,446 INFO L226 Difference]: Without dead ends: 225 [2020-12-23 09:53:08,448 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:53:08,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-12-23 09:53:08,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2020-12-23 09:53:08,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-12-23 09:53:08,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 331 transitions. [2020-12-23 09:53:08,490 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 331 transitions. Word has length 78 [2020-12-23 09:53:08,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:53:08,491 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 331 transitions. [2020-12-23 09:53:08,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:53:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 331 transitions. [2020-12-23 09:53:08,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-23 09:53:08,497 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:08,497 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:53:08,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:53:08,498 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:08,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:08,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1690434603, now seen corresponding path program 1 times [2020-12-23 09:53:08,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:08,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763068386] [2020-12-23 09:53:08,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:08,705 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:53:08,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763068386] [2020-12-23 09:53:08,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:53:08,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:53:08,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380545540] [2020-12-23 09:53:08,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:53:08,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:08,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:53:08,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:53:08,708 INFO L87 Difference]: Start difference. First operand 223 states and 331 transitions. Second operand 3 states. [2020-12-23 09:53:08,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:53:08,755 INFO L93 Difference]: Finished difference Result 551 states and 859 transitions. [2020-12-23 09:53:08,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:53:08,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2020-12-23 09:53:08,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:53:08,767 INFO L225 Difference]: With dead ends: 551 [2020-12-23 09:53:08,767 INFO L226 Difference]: Without dead ends: 375 [2020-12-23 09:53:08,770 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:53:08,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2020-12-23 09:53:08,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2020-12-23 09:53:08,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-12-23 09:53:08,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 572 transitions. [2020-12-23 09:53:08,827 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 572 transitions. Word has length 79 [2020-12-23 09:53:08,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:53:08,832 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 572 transitions. [2020-12-23 09:53:08,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:53:08,832 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 572 transitions. [2020-12-23 09:53:08,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-23 09:53:08,837 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:08,838 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:53:08,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:53:08,839 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:08,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:08,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1185859852, now seen corresponding path program 1 times [2020-12-23 09:53:08,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:08,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115487776] [2020-12-23 09:53:08,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:09,030 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:53:09,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115487776] [2020-12-23 09:53:09,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:53:09,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:53:09,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544313874] [2020-12-23 09:53:09,036 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:53:09,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:09,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:53:09,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:53:09,039 INFO L87 Difference]: Start difference. First operand 373 states and 572 transitions. Second operand 3 states. [2020-12-23 09:53:09,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:53:09,084 INFO L93 Difference]: Finished difference Result 977 states and 1542 transitions. [2020-12-23 09:53:09,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:53:09,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-12-23 09:53:09,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:53:09,089 INFO L225 Difference]: With dead ends: 977 [2020-12-23 09:53:09,089 INFO L226 Difference]: Without dead ends: 651 [2020-12-23 09:53:09,092 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:53:09,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2020-12-23 09:53:09,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 649. [2020-12-23 09:53:09,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2020-12-23 09:53:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1012 transitions. [2020-12-23 09:53:09,154 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1012 transitions. Word has length 80 [2020-12-23 09:53:09,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:53:09,155 INFO L481 AbstractCegarLoop]: Abstraction has 649 states and 1012 transitions. [2020-12-23 09:53:09,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:53:09,158 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1012 transitions. [2020-12-23 09:53:09,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 09:53:09,160 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:09,160 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:53:09,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:53:09,161 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:09,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:09,162 INFO L82 PathProgramCache]: Analyzing trace with hash 600169947, now seen corresponding path program 1 times [2020-12-23 09:53:09,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:09,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987730578] [2020-12-23 09:53:09,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:09,239 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:53:09,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987730578] [2020-12-23 09:53:09,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:53:09,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:53:09,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718788580] [2020-12-23 09:53:09,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:53:09,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:09,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:53:09,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:53:09,242 INFO L87 Difference]: Start difference. First operand 649 states and 1012 transitions. Second operand 3 states. [2020-12-23 09:53:09,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:53:09,292 INFO L93 Difference]: Finished difference Result 1757 states and 2782 transitions. [2020-12-23 09:53:09,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:53:09,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2020-12-23 09:53:09,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:53:09,301 INFO L225 Difference]: With dead ends: 1757 [2020-12-23 09:53:09,301 INFO L226 Difference]: Without dead ends: 1155 [2020-12-23 09:53:09,303 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:53:09,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2020-12-23 09:53:09,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1153. [2020-12-23 09:53:09,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2020-12-23 09:53:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1808 transitions. [2020-12-23 09:53:09,351 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1808 transitions. Word has length 81 [2020-12-23 09:53:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:53:09,351 INFO L481 AbstractCegarLoop]: Abstraction has 1153 states and 1808 transitions. [2020-12-23 09:53:09,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:53:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1808 transitions. [2020-12-23 09:53:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-23 09:53:09,353 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:09,353 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:53:09,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:53:09,354 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:09,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:09,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1228760164, now seen corresponding path program 1 times [2020-12-23 09:53:09,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:09,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917039524] [2020-12-23 09:53:09,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:09,438 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:53:09,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917039524] [2020-12-23 09:53:09,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:53:09,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:53:09,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818254434] [2020-12-23 09:53:09,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:53:09,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:09,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:53:09,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:53:09,441 INFO L87 Difference]: Start difference. First operand 1153 states and 1808 transitions. Second operand 3 states. [2020-12-23 09:53:09,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:53:09,503 INFO L93 Difference]: Finished difference Result 3173 states and 5010 transitions. [2020-12-23 09:53:09,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:53:09,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2020-12-23 09:53:09,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:53:09,515 INFO L225 Difference]: With dead ends: 3173 [2020-12-23 09:53:09,515 INFO L226 Difference]: Without dead ends: 2067 [2020-12-23 09:53:09,518 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:53:09,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2020-12-23 09:53:09,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2065. [2020-12-23 09:53:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2065 states. [2020-12-23 09:53:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 3232 transitions. [2020-12-23 09:53:09,598 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 3232 transitions. Word has length 82 [2020-12-23 09:53:09,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:53:09,598 INFO L481 AbstractCegarLoop]: Abstraction has 2065 states and 3232 transitions. [2020-12-23 09:53:09,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:53:09,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 3232 transitions. [2020-12-23 09:53:09,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 09:53:09,600 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:09,600 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:53:09,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:53:09,601 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:09,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:09,601 INFO L82 PathProgramCache]: Analyzing trace with hash -991115381, now seen corresponding path program 1 times [2020-12-23 09:53:09,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:09,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834274086] [2020-12-23 09:53:09,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:09,941 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:53:09,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834274086] [2020-12-23 09:53:09,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:53:09,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:53:09,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864951583] [2020-12-23 09:53:09,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:53:09,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:09,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:53:09,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:53:09,948 INFO L87 Difference]: Start difference. First operand 2065 states and 3232 transitions. Second operand 8 states. [2020-12-23 09:53:10,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:53:10,584 INFO L93 Difference]: Finished difference Result 12877 states and 20102 transitions. [2020-12-23 09:53:10,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:53:10,585 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2020-12-23 09:53:10,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:53:10,642 INFO L225 Difference]: With dead ends: 12877 [2020-12-23 09:53:10,642 INFO L226 Difference]: Without dead ends: 10859 [2020-12-23 09:53:10,649 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:53:10,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10859 states. [2020-12-23 09:53:11,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10859 to 10849. [2020-12-23 09:53:11,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10849 states. [2020-12-23 09:53:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10849 states to 10849 states and 16880 transitions. [2020-12-23 09:53:11,246 INFO L78 Accepts]: Start accepts. Automaton has 10849 states and 16880 transitions. Word has length 83 [2020-12-23 09:53:11,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:53:11,247 INFO L481 AbstractCegarLoop]: Abstraction has 10849 states and 16880 transitions. [2020-12-23 09:53:11,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:53:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 10849 states and 16880 transitions. [2020-12-23 09:53:11,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 09:53:11,248 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:11,249 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:53:11,249 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:53:11,249 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:11,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:11,251 INFO L82 PathProgramCache]: Analyzing trace with hash 120110007, now seen corresponding path program 1 times [2020-12-23 09:53:11,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:11,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237756140] [2020-12-23 09:53:11,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:11,327 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:53:11,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237756140] [2020-12-23 09:53:11,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:53:11,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:53:11,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295053756] [2020-12-23 09:53:11,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:53:11,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:11,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:53:11,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:53:11,330 INFO L87 Difference]: Start difference. First operand 10849 states and 16880 transitions. Second operand 3 states. [2020-12-23 09:53:12,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:53:12,219 INFO L93 Difference]: Finished difference Result 29861 states and 46290 transitions. [2020-12-23 09:53:12,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:53:12,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2020-12-23 09:53:12,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:53:12,296 INFO L225 Difference]: With dead ends: 29861 [2020-12-23 09:53:12,296 INFO L226 Difference]: Without dead ends: 19059 [2020-12-23 09:53:12,315 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:53:12,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19059 states. [2020-12-23 09:53:13,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19059 to 19057. [2020-12-23 09:53:13,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19057 states. [2020-12-23 09:53:13,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19057 states to 19057 states and 29264 transitions. [2020-12-23 09:53:13,389 INFO L78 Accepts]: Start accepts. Automaton has 19057 states and 29264 transitions. Word has length 84 [2020-12-23 09:53:13,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:53:13,391 INFO L481 AbstractCegarLoop]: Abstraction has 19057 states and 29264 transitions. [2020-12-23 09:53:13,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:53:13,391 INFO L276 IsEmpty]: Start isEmpty. Operand 19057 states and 29264 transitions. [2020-12-23 09:53:13,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 09:53:13,392 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:13,393 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:53:13,393 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:53:13,393 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:13,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:13,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1337229271, now seen corresponding path program 1 times [2020-12-23 09:53:13,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:13,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282836316] [2020-12-23 09:53:13,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:13,666 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:53:13,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282836316] [2020-12-23 09:53:13,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:53:13,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:53:13,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141297224] [2020-12-23 09:53:13,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:53:13,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:13,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:53:13,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:53:13,677 INFO L87 Difference]: Start difference. First operand 19057 states and 29264 transitions. Second operand 8 states. [2020-12-23 09:53:17,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:53:17,179 INFO L93 Difference]: Finished difference Result 106847 states and 164503 transitions. [2020-12-23 09:53:17,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:53:17,180 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2020-12-23 09:53:17,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:53:17,466 INFO L225 Difference]: With dead ends: 106847 [2020-12-23 09:53:17,466 INFO L226 Difference]: Without dead ends: 87837 [2020-12-23 09:53:17,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:53:17,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87837 states. [2020-12-23 09:53:20,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87837 to 38065. [2020-12-23 09:53:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38065 states. [2020-12-23 09:53:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38065 states to 38065 states and 57712 transitions. [2020-12-23 09:53:20,107 INFO L78 Accepts]: Start accepts. Automaton has 38065 states and 57712 transitions. Word has length 84 [2020-12-23 09:53:20,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:53:20,108 INFO L481 AbstractCegarLoop]: Abstraction has 38065 states and 57712 transitions. [2020-12-23 09:53:20,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:53:20,108 INFO L276 IsEmpty]: Start isEmpty. Operand 38065 states and 57712 transitions. [2020-12-23 09:53:20,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-23 09:53:20,109 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:20,109 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:53:20,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:53:20,110 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:20,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:20,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1112242464, now seen corresponding path program 1 times [2020-12-23 09:53:20,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:20,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258363696] [2020-12-23 09:53:20,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:20,369 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:53:20,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258363696] [2020-12-23 09:53:20,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:53:20,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 09:53:20,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331169285] [2020-12-23 09:53:20,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:53:20,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:20,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:53:20,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:53:20,374 INFO L87 Difference]: Start difference. First operand 38065 states and 57712 transitions. Second operand 8 states. [2020-12-23 09:53:23,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:53:23,653 INFO L93 Difference]: Finished difference Result 79155 states and 118449 transitions. [2020-12-23 09:53:23,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 09:53:23,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2020-12-23 09:53:23,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:53:23,818 INFO L225 Difference]: With dead ends: 79155 [2020-12-23 09:53:23,818 INFO L226 Difference]: Without dead ends: 79153 [2020-12-23 09:53:23,839 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:53:23,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79153 states. [2020-12-23 09:53:26,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79153 to 40369. [2020-12-23 09:53:26,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40369 states. [2020-12-23 09:53:26,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40369 states to 40369 states and 60016 transitions. [2020-12-23 09:53:26,390 INFO L78 Accepts]: Start accepts. Automaton has 40369 states and 60016 transitions. Word has length 85 [2020-12-23 09:53:26,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:53:26,390 INFO L481 AbstractCegarLoop]: Abstraction has 40369 states and 60016 transitions. [2020-12-23 09:53:26,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:53:26,390 INFO L276 IsEmpty]: Start isEmpty. Operand 40369 states and 60016 transitions. [2020-12-23 09:53:26,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-23 09:53:26,391 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:26,391 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:53:26,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:53:26,392 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:26,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:26,392 INFO L82 PathProgramCache]: Analyzing trace with hash 172356833, now seen corresponding path program 1 times [2020-12-23 09:53:26,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:26,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504350639] [2020-12-23 09:53:26,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:26,472 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:53:26,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504350639] [2020-12-23 09:53:26,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:53:26,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:53:26,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437530493] [2020-12-23 09:53:26,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:53:26,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:26,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:53:26,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:53:26,474 INFO L87 Difference]: Start difference. First operand 40369 states and 60016 transitions. Second operand 3 states. [2020-12-23 09:53:28,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:53:28,681 INFO L93 Difference]: Finished difference Result 99063 states and 147412 transitions. [2020-12-23 09:53:28,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:53:28,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-12-23 09:53:28,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:53:28,781 INFO L225 Difference]: With dead ends: 99063 [2020-12-23 09:53:28,781 INFO L226 Difference]: Without dead ends: 58741 [2020-12-23 09:53:28,830 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:53:28,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58741 states. [2020-12-23 09:53:31,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58741 to 58387. [2020-12-23 09:53:31,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58387 states. [2020-12-23 09:53:31,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58387 states to 58387 states and 86386 transitions. [2020-12-23 09:53:31,701 INFO L78 Accepts]: Start accepts. Automaton has 58387 states and 86386 transitions. Word has length 86 [2020-12-23 09:53:31,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:53:31,701 INFO L481 AbstractCegarLoop]: Abstraction has 58387 states and 86386 transitions. [2020-12-23 09:53:31,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:53:31,702 INFO L276 IsEmpty]: Start isEmpty. Operand 58387 states and 86386 transitions. [2020-12-23 09:53:31,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 09:53:31,737 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:53:31,738 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:53:31,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:53:31,738 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:53:31,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:53:31,739 INFO L82 PathProgramCache]: Analyzing trace with hash 668753880, now seen corresponding path program 1 times [2020-12-23 09:53:31,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:53:31,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88151026] [2020-12-23 09:53:31,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:53:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:32,041 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:53:32,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88151026] [2020-12-23 09:53:32,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323676435] [2020-12-23 09:53:32,042 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:53:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:53:32,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 09:53:32,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:53:32,625 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:53:32,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:53:32,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2020-12-23 09:53:32,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621482087] [2020-12-23 09:53:32,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 09:53:32,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:53:32,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 09:53:32,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-12-23 09:53:32,629 INFO L87 Difference]: Start difference. First operand 58387 states and 86386 transitions. Second operand 12 states. [2020-12-23 09:53:32,889 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-12-23 09:53:55,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:53:55,670 INFO L93 Difference]: Finished difference Result 482131 states and 707378 transitions. [2020-12-23 09:53:55,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-12-23 09:53:55,672 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2020-12-23 09:53:55,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:53:56,805 INFO L225 Difference]: With dead ends: 482131 [2020-12-23 09:53:56,805 INFO L226 Difference]: Without dead ends: 423793 [2020-12-23 09:53:56,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=666, Invalid=2640, Unknown=0, NotChecked=0, Total=3306 [2020-12-23 09:53:57,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423793 states. [2020-12-23 09:54:10,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423793 to 212131. [2020-12-23 09:54:10,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212131 states. [2020-12-23 09:54:11,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212131 states to 212131 states and 309698 transitions. [2020-12-23 09:54:11,385 INFO L78 Accepts]: Start accepts. Automaton has 212131 states and 309698 transitions. Word has length 118 [2020-12-23 09:54:11,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:11,386 INFO L481 AbstractCegarLoop]: Abstraction has 212131 states and 309698 transitions. [2020-12-23 09:54:11,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 09:54:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 212131 states and 309698 transitions. [2020-12-23 09:54:11,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 09:54:11,433 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:11,434 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:54:11,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-23 09:54:11,650 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:11,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:11,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1707736999, now seen corresponding path program 1 times [2020-12-23 09:54:11,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:11,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646026112] [2020-12-23 09:54:11,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:11,742 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:54:11,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646026112] [2020-12-23 09:54:11,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:11,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:11,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907306496] [2020-12-23 09:54:11,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:11,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:11,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:11,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:11,751 INFO L87 Difference]: Start difference. First operand 212131 states and 309698 transitions. Second operand 3 states. [2020-12-23 09:54:27,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:54:27,912 INFO L93 Difference]: Finished difference Result 534472 states and 780774 transitions. [2020-12-23 09:54:27,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:54:27,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2020-12-23 09:54:27,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:54:28,932 INFO L225 Difference]: With dead ends: 534472 [2020-12-23 09:54:28,932 INFO L226 Difference]: Without dead ends: 349574 [2020-12-23 09:54:29,131 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:29,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349574 states. [2020-12-23 09:54:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349574 to 349572. [2020-12-23 09:54:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349572 states. [2020-12-23 09:54:49,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349572 states to 349572 states and 506180 transitions. [2020-12-23 09:54:49,517 INFO L78 Accepts]: Start accepts. Automaton has 349572 states and 506180 transitions. Word has length 118 [2020-12-23 09:54:49,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:54:49,518 INFO L481 AbstractCegarLoop]: Abstraction has 349572 states and 506180 transitions. [2020-12-23 09:54:49,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:54:49,518 INFO L276 IsEmpty]: Start isEmpty. Operand 349572 states and 506180 transitions. [2020-12-23 09:54:49,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 09:54:49,578 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:54:49,578 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:54:49,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:54:49,578 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:54:49,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:54:49,579 INFO L82 PathProgramCache]: Analyzing trace with hash 322125977, now seen corresponding path program 1 times [2020-12-23 09:54:49,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:54:49,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318352489] [2020-12-23 09:54:49,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:54:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:54:49,678 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:54:49,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318352489] [2020-12-23 09:54:49,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:54:49,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:54:49,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981439186] [2020-12-23 09:54:49,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:54:49,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:54:49,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:54:49,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:54:49,681 INFO L87 Difference]: Start difference. First operand 349572 states and 506180 transitions. Second operand 3 states. [2020-12-23 09:55:18,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:55:18,710 INFO L93 Difference]: Finished difference Result 890419 states and 1287796 transitions. [2020-12-23 09:55:18,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:55:18,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2020-12-23 09:55:18,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted.